Skip to content

Endre Szemerdi

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

22

Venues

6

Active years

1976–2013

Best venue rank

A*

Where they publish

Papers

22 indexed papers, newest first.

YearVenueTitleAuthors
2013CiEVarious Regularity Lemmas in Graphs and Hypergraphs.Endre Szemerdi
2005MFCSThe Generalization of Dirac's Theorem for Hypergraphs.Endre Szemerdi, Andrzej Rucinski, Vojtech Rdl
2000FOCSUniversality and Tolerance.Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rdl, Andrzej Rucinski, Endre Szemerdi
1996SODAMatching Nuts and Bolts in O(n log n) Time (Extended Abstract).Jnos Komls, Yuan Ma, Endre Szemerdi
1995STOCLower bounds for sorting networks.Nabil Kahal, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerdi
1992FOCSFault Tolerant Graphs, Perfect Hash Functions and Disjoint PathsMikls Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerdi
1992FOCSHalvers and ExpandersMikls Ajtai, Jnos Komls, Endre Szemerdi
1992FOCSUndirected Connectivity in O(log ^1.5 n) SpaceNoam Nisan, Endre Szemerdi, Avi Wigderson
1989FOCSAn Upper Bound on the Number of Planar k-SetsJnos Pach, William L. Steiger, Endre Szemerdi
1989STOCOn the Second Eigenvalue in Random Regular GraphsJoel Friedman, Jeff Kahn, Endre Szemerdi
1988ICALPOptimal Slope Selection.Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerdi
1988STOCTwo Infinite Sets of Primes with Fast Primality TestsJanos Pintz, William L. Steiger, Endre Szemerdi
1987STOCDeterministic Simulation in LOGSPACEMikls Ajtai, Jnos Komls, Endre Szemerdi
1987STOCTwo Tapes Are Better than One for Off-Line Turing MachinesWolfgang Maass, Georg Schnitger, Endre Szemerdi
1986STOCTwo lower bounds for branching programsMikls Ajtai, Lszl Babai, Pter Hajnal, Jnos Komls, Pavel Pudlk, Vojtech Rdl, Endre Szemerdi, Gyrgy Turn
1986STOCDeterministic Selection in O(log log N) Parallel TimeMikls Ajtai, Jnos Komls, William L. Steiger, Endre Szemerdi
1986STOCOn Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing MachinesZvi Galil, Ravi Kannan, Endre Szemerdi
1984FOCSOn the Complexity of Matrix Group Problems ILszl Babai, Endre Szemerdi
1983FOCSOn Determinism versus Non-Determinism and Related Problems (Preliminary Version)Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerdi, William T. Trotter
1983STOCAn O(n log n) Sorting NetworkMikls Ajtai, Jnos Komls, Endre Szemerdi
1982FOCSStoring a Sparse Table with O(1) Worst Case Access TimeMichael L. Fredman, Jnos Komls, Endre Szemerdi
1976STOCThe Analysis of Double Hashing (Extended Abstract)Leonidas J. Guibas, Endre Szemerdi