Tibor Hegedüs

Complexity theoretic hardness results for query learning

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

on the Geometric Separability of Boolean Functions

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

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.