Search the dblp DataBase

Publications of Author

1. Péter Hajnal
   On the Power of Randomness in the Decision Tree Model. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1990, pp:66-77 [Conf]
   
2. Elias Dahlhaus, Péter Hajnal, Marek Karpinski
   Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs [Citation Graph (0, 0)][DBLP]
   FOCS, 1988, pp:186-193 [Conf]
   
3. 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 [Citation Graph (0, 0)][DBLP]
   STOC, 1986, pp:30-38 [Conf]
   
4. Péter Hajnal
   Partition of graphs with condition on the connectivity and minimum degree. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1983, v:3, n:1, pp:95-99 [Journal]
   
5. Péter Hajnal
   An Omega(n^4/3) lower bound on the randomized complexity of graph properties. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:2, pp:131-143 [Journal]
   
6. Péter Hajnal, Mario Szegedy
   On packing bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1992, v:12, n:3, pp:295-301 [Journal]
   
7. János Barát, Péter Hajnal
   The Arc-Width of a Graph. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
   
8. Elias Dahlhaus, Péter Hajnal, Marek Karpinski
   On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1993, v:15, n:3, pp:367-384 [Journal]
   
9. László Babai, Péter Hajnal, Endre Szemerédi, György Turán
   A Lower Bound for Read-Once-Only Branching Programs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1987, v:35, n:2, pp:153-162 [Journal]
   
10. Herbert Edelsbrunner, Péter Hajnal
    A lower bound on the number of unit distances between the vertices of a convex polygon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:56, n:2, pp:312-316 [Journal]
    
11. Jean-Paul Allouche, Péter Hajnal, Jeffrey Shallit
    Analysis of an Infinite Product Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:1, pp:1-15 [Journal]
    
12. Péter Hajnal, Endre Szemerédi
    Brooks Coloring in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:74-80 [Journal]
    
13. Zoltán Füredi, Péter Hajnal
    Davenport-Schinzel theory of matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:233-251 [Journal]
    
14. 
    Simply sequentially additive labelings of 2-regular graphs. [Citation Graph (, )][DBLP]