
Search the dblp DataBase
Tibor Hegedüs:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Tibor Hegedüs, Piotr Indyk
On Learning Disjunctions of ZeroOne Treshold Functions with Queries. [Citation Graph (0, 0)][DBLP] ALT, 1997, pp:446460 [Conf]
 Tibor Hegedüs
Geometrical Concept Learning and Convex Polytopes. [Citation Graph (0, 0)][DBLP] COLT, 1994, pp:228236 [Conf]
 Tibor Hegedüs
Generalized Teaching Dimensions and the Query Complexity of Learning. [Citation Graph (0, 0)][DBLP] COLT, 1995, pp:108117 [Conf]
 Tibor Hegedüs
Can Complexity Theory Benefit from Learning Theory? [Citation Graph (0, 0)][DBLP] ECML, 1993, pp:354359 [Conf]
 Tibor Hegedüs
Combinatorial Results on the Complexity of Teaching and Learning. [Citation Graph (0, 0)][DBLP] MFCS, 1994, pp:393402 [Conf]
 Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt
Complexity Theoretic Hardness Results for Query Learning. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1998, v:7, n:1, pp:1953 [Journal]
 Tibor Hegedüs, Nimrod Megiddo
on the Geometric Separability of Boolean Functions. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:66, n:3, pp:205218 [Journal]
Search in 0.003secs, Finished in 0.003secs
