Péter Hajnal

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 8

Top Topics

Nearest Neighbor

Boolean Functions

Prime Implicants

Uniform Distribution

Top Venues

Electron. J. Comb.

Publications

Péter Hajnal
Binary Numeration System with Alternating Signed Digits and Its Graph Theoretical Relationship. Algorithms 17 (2) (2024)
Péter Hajnal
A short note on Zeckendorf type numeration systems with negative digits allowed. Bull. ICA 97 (2023)
Péter Hajnal, Zhihao Liu, György Turán
Nearest neighbor representations of Boolean functions. Inf. Comput. 285 (Part) (2022)
Péter Hajnal, Zhihao Liu, György Turán
Nearest neighbor representations of Boolean functions. CoRR (2020)
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22 (1) (2018)
Beáta Bényi, Péter Hajnal
Poly-Bernoulli Numbers and Eulerian Numbers. J. Integer Seq. 21 (6) (2018)
Beáta Bényi, Péter Hajnal
Combinatorial Properties of Poly-Bernoulli Relatives. Integers 17 (2017)
János Csányi, Péter Hajnal, Gábor V. Nagy
On the Staircases of Gyárfás. Electron. J. Comb. 23 (2) (2016)
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Saturated Simple and 2-simple Topological Graphs with Few Edges. WG (2015)
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Saturated simple and 2-simple topological graphs with few edges. CoRR (2015)
Péter Hajnal, László I. Szabó, Vilmos Totik
Convex Polygons and Common Transversals. Am. Math. Mon. 122 (9) (2015)
Péter Hajnal, Gábor V. Nagy
A Bijective Proof of Shapiro's Catalan Convolution. Electron. J. Comb. 21 (2) (2014)
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) (2011)
Péter Hajnal, Gábor V. Nagy
Simply sequentially additive labelings of 2-regular graphs. Discret. Math. 310 (4) (2010)
Péter Hajnal, Zhihao Liu, György Turán
Nearest Neighbor Representations of Boolean Functions. AI&M (2006)
János Barát, Péter Hajnal
The Arc-Width of a Graph. Electron. J. Comb. 8 (1) (2001)
János Barát, Péter Hajnal
Operations Which Preserve Path-Width at Most Two. Comb. Probab. Comput. 10 (4) (2001)
József Békési, Gábor Galambos, Péter Hajnal
Analysis of permutation routing algorithms. Eur. J. Oper. Res. 125 (2) (2000)
Izak Broere, Péter Hajnal, Peter Mihók
Partition problems and kernels of graphs. Discuss. Math. Graph Theory 17 (2) (1997)
Péter Hajnal
Davenport-Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal). SIAM Rev. 38 (4) (1996)
Elias Dahlhaus, Péter Hajnal, Marek Karpinski
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms 15 (3) (1993)
Péter Hajnal, Mario Szegedy
On packing bipartite graphs. Comb. 12 (3) (1992)
Zoltán Füredi, Péter Hajnal
Davenport-Schinzel theory of matrices. Discret. Math. 103 (3) (1992)
Péter Hajnal
) lower bound on the randomized complexity of graph properties. Comb. 11 (2) (1991)
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) (1991)
Péter Hajnal, Endre Szemerédi
Brooks Coloring in Parallel. SIAM J. Discret. Math. 3 (1) (1990)
Péter Hajnal
On the Power of Randomness in the Decision Tree Model. Computational Complexity Conference (1990)
Jean-Paul Allouche, Péter Hajnal, Jeffrey O. Shallit
Analysis of an Infinite Product Algorithm. SIAM J. Discret. Math. 2 (1) (1989)
Elias Dahlhaus, Péter Hajnal, Marek Karpinski
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs FOCS (1988)
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) (1987)
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)
Péter Hajnal
Partition of graphs with condition on the connectivity and minimum degree. Comb. 3 (1) (1983)