Selected papers
-
Peter Hajnal, A short note on numeration systems with
negative digits allowed, submitted
pdf file
-
Peter Hajnal, Endre Szemerédi,
Two geometrical applications of the semi-random method,
New trends in intuitive geometry, 189–199,
Bolyai Soc. Math. Stud., 27,
János Bolyai Math. Soc., Budapest, 2018.
pdf file
-
On connectivity related extremal problems
The Proceedings of the 1st Japanese-Hungarian Symposium on Discrete
Mathematics and its Apllications, (1999), 1--5.
pdf file
-
Partition problems and kernels of graphs
(with I. Broere and P. Mihok),
Discussiones Mathematicae Graph Theory, 17(1997), 311.
-
On the parallel complexity of Hamiltonian cycle and matching problem on
dense graphs (with E. Dahlhaus and M. Karpinski),
Journal of Algorithm, 15(1993), 367--384.
pdf file
-
Complexity of graph problems, Candidate Thesis,
Hungarian Academy of Sciences, 1992.
pdf file
-
On packing bipartite graphs (with M. Szegedy),
Combinatorica, 12(1992), 295--301.
pdf file
-
Decision tree complexity of Boolean functions,
Coll. Math. Soc. János Bolyai 60,
Sets, graphs and numbers, Budapest (Hungary), 1991; (1992), 365--389.
pdf file
-
Davenport-Schinzel theory of matrices
(with Z. Füredi ),
Discrete Math., 103(1992), 233--251.
pdf file
-
An n4/3 lower bound on the randomized complexity of graph properties,
Combinatorica, 11(1991), 131--143.
pdf file
-
A lower bound for one-time-only branching programs
(with L. Babai, E. Szemerédi
and Gy. Turán),
J.C.S.S., 35(1987), 153-162.
pdf file
-
Transversals for ordinal intervals (with Ron Aharoni),
Acta Math. Hung., 49(1-2)(1987), 291-292.
pdf file
-
Two lower bounds for branching programs
(with Ajtai M., L. Babai, J. Komlós,
P. Pudlák, V. Rödl, E. Szemerédi and Gy. Turán),
Proc. 18th ACM STOC, 1986, pp. 30--38.
pdf file