The SCEAS System
Navigation Menu

Search the dblp DataBase


Tibor Hegedüs: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tibor Hegedüs, Piotr Indyk
    On Learning Disjunctions of Zero-One Treshold Functions with Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:446-460 [Conf]
  2. Tibor Hegedüs
    Geometrical Concept Learning and Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:228-236 [Conf]
  3. Tibor Hegedüs
    Generalized Teaching Dimensions and the Query Complexity of Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:108-117 [Conf]
  4. Tibor Hegedüs
    Can Complexity Theory Benefit from Learning Theory? [Citation Graph (0, 0)][DBLP]
    ECML, 1993, pp:354-359 [Conf]
  5. Tibor Hegedüs
    Combinatorial Results on the Complexity of Teaching and Learning. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:393-402 [Conf]
  6. 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:19-53 [Journal]
  7. 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:205-218 [Journal]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002