#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1958

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Zoltán Füredi, Péter Hajnal
- Discrete Mathematics
- 1992

- Péter Hajnal
- Combinatorica
- 1991

- Miklós Ajtai, László Babai, +5 authors György Turán
- STOC
- 1986

The rst result concerns branching programs having width (logn)O(1). We give an (n logn= log logn) lower bound for the size of such branching programs computing almost any symmetric Boolean function and in particular the following explicit function: \the sum of the input variables is a quadratic residue mod p" where p is any given prime between n1=4 and… (More)

- Elias Dahlhaus, Péter Hajnal, Marek Karpinski
- J. Algorithms
- 1993

Dirac's classical theorem asserts that, if every vertex of a graph G on n vertices has degree at least n2 then G has a Hamiltonian cycle. We give a fast parallel algorithm on a CREW PRAM to nd a Hamiltonian cycle in such graphs. Our algorithm uses a linear number of processors and is optimal up to a polylogarithmic factor. The algorithm works in O(log4 n)… (More)

- Izak Broere, Péter Hajnal, Peter Mihók
- Discussiones Mathematicae Graph Theory
- 1997

- János Barát, Péter Hajnal
- Electr. J. Comb.
- 2001

The arc-representation of a graph is a mapping from the set of vertices to the arcs of a circle such that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs having a point in common. The arc-width(aw) of a graph is the minimum width of its arc-representations. We show how arc-width is related… (More)

- Péter Hajnal
- Structure in Complexity Theory Conference
- 1990

- Péter Hajnal
- Combinatorica
- 1983

- Herbert Edelsbrunner, Péter Hajnal
- J. Comb. Theory, Ser. A
- 1991

- László Babai, Péter Hajnal, Endre Szemerédi, György Turán
- J. Comput. Syst. Sci.
- 1987