![]() |
| 2007 | ||
|---|---|---|
| 4 | EE | Lev Reyzin, Nikhil Srivastava: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. ALT 2007: 285-297 |
| 3 | EE | Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65 |
| 2 | EE | Lev Reyzin, Nikhil Srivastava: On the longest path algorithm for reconstructing trees from distance matrices. Inf. Process. Lett. 101(3): 98-100 (2007) |
| 2006 | ||
| 1 | EE | Lev Reyzin, Robert E. Schapire: How boosting the margin can also boost classifier complexity. ICML 2006: 753-760 |
| 1 | Dana Angluin | [3] |
| 2 | James Aspnes | [3] |
| 3 | Jiang Chen | [3] |
| 4 | Robert E. Schapire | [1] |
| 5 | Nikhil Srivastava | [2] [4] |