Reachability is harder for directed than for undirected finite graphsMiklos AjtaiRonald Fagin1987FOCS 1987Conference paper
The set of continuous functions with everywhere convergent fourier seriesMiklos AjtaiA.S. Kechris1987Trans. Am. Math. Soc.Paper
DETERMINISTIC SIMULATION OF PROBABILISTIC CONSTANT DEPTH CIRCUITS.Miklos AjtaiAvi Wigderson1984FOCS 1984Conference paper