| |
| * | 1998 | |
|---|---|---|
| 7 | Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt: Complexity Theoretic Hardness Results for Query Learning. Computational Complexity 7(1): 19-53 (1998) | |
| 1997 | ||
| 6 | Tibor Hegedüs, Piotr Indyk: On Learning Disjunctions of Zero-One Treshold Functions with Queries. ALT 1997: 446-460 | |
| 1996 | ||
| 5 | EE | Tibor Hegedüs, Nimrod Megiddo: on the Geometric Separability of Boolean Functions. Discrete Applied Mathematics 66(3): 205-218 (1996) |
| 1995 | ||
| 4 | EE | Tibor Hegedüs: Generalized Teaching Dimensions and the Query Complexity of Learning. COLT 1995: 108-117 |
| 1994 | ||
| 3 | EE | Tibor Hegedüs: Geometrical Concept Learning and Convex Polytopes. COLT 1994: 228-236 |
| 2 | EE | Tibor Hegedüs: Combinatorial Results on the Complexity of Teaching and Learning. MFCS 1994: 393-402 |
| 1993 | ||
| 1 | EE | Tibor Hegedüs: Can Complexity Theory Benefit from Learning Theory? ECML 1993: 354-359 |
| 1 | Howard Aizenstein | [7] |
| 2 | Lisa Hellerstein | [7] |
| 3 | Piotr Indyk | [6] |
| 4 | Nimrod Megiddo | [5] |
| 5 | Leonard Pitt | [7] |