Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Péter Hajnal
2010 – today
- 2011
[j14]János Barát, Péter Hajnal, Eszter K. Horváth: Elementary proof techniques for the maximum number of islands. Eur. J. Comb. 32(2): 276-281 (2011)- 2010
- [j13]Péter Hajnal, Gábor Nagy: Simply sequentially additive labelings of 2-regular graphs. Discrete Mathematics 310(4): 922-928 (2010)
2000 – 2009
- 2006
- [c4]Péter Hajnal, Zhihao Liu, György Turán: Nearest Neighbor Representations of Boolean Functions. ISAIM 2006
- 2001
- [j12]
- 2000
- [j11]József Békési, Gábor Galambos, Péter Hajnal: Analysis of permutation routing algorithms. European Journal of Operational Research 125(2): 249-256 (2000)
1990 – 1999
- 1997
- [j10]Izak Broere, Péter Hajnal, Peter Mihók: Partition problems and kernels of graphs. Discussiones Mathematicae Graph Theory 17(2): 311-313 (1997)
- 1993
- [j9]Elias Dahlhaus, Péter Hajnal, Marek Karpinski: On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms 15(3): 367-384 (1993)
- 1992
- [j8]
- [j7]Zoltán Füredi, Péter Hajnal: Davenport-Schinzel theory of matrices. Discrete Mathematics 103(3): 233-251 (1992)
- 1991
- [j6]Péter Hajnal: An Omega(n4/3) lower bound on the randomized complexity of graph properties. Combinatorica 11(2): 131-143 (1991)
- [j5]Herbert Edelsbrunner, Péter Hajnal: A lower bound on the number of unit distances between the vertices of a convex polygon. J. Comb. Theory, Ser. A 56(2): 312-316 (1991)
- 1990
- [j4]Péter Hajnal, Endre Szemerédi: Brooks Coloring in Parallel. SIAM J. Discrete Math. 3(1): 74-80 (1990)
- [c3]Péter Hajnal: On the Power of Randomness in the Decision Tree Model. Structure in Complexity Theory Conference 1990: 66-77
1980 – 1989
- 1989
- [j3]Jean-Paul Allouche, Péter Hajnal, Jeffrey Shallit: Analysis of an Infinite Product Algorithm. SIAM J. Discrete Math. 2(1): 1-15 (1989)
- 1988
- [c2]Elias Dahlhaus, Péter Hajnal, Marek Karpinski: Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs. FOCS 1988: 186-193
- 1987
- [j2]László Babai, Péter Hajnal, Endre Szemerédi, György Turán: A Lower Bound for Read-Once-Only Branching Programs. J. Comput. Syst. Sci. 35(2): 153-162 (1987)
- 1986
- [c1]Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán: Two lower bounds for branching programs. STOC 1986: 30-38
- 1983
- [j1]Péter Hajnal: Partition of graphs with condition on the connectivity and minimum degree. Combinatorica 3(1): 95-99 (1983)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:51 CET by the dblp team