Tibor Hegedüs

on the Geometric Separability of Boolean Functions

Nimrod Megiddo, Tibor Hegedüs, N. Megiddo, 1996, Discret. Appl. Math..

Complexity theoretic hardness results for query learning

Lisa Hellerstein, Leonard Pitt, Howard Aizenstein, 1998, computational complexity.

Can Complexity Theory Benefit from Learning Theory?

Tibor Hegedüs, 1993, ECML.

Combinatorial Results on the Complexity of Teaching and Learning

Tibor Hegedüs, 1994, MFCS.

Geometrical Concept Learning and Convex Polytopes

Tibor Hegedüs, 1994, COLT.

On Learning Disjunctions of Zero-One Treshold Functions with Queries

Piotr Indyk, Tibor Hegedüs, P. Indyk, 1997, ALT.

Generalized Teaching Dimensions and the Query Complexity of Learning

Tibor Hegedüs, Tibor Hegedüs, 1995, COLT.