Travelled to:1 × Finland
7 × USA
Collaborated with:M.Ajtai J.Komlós W.L.Steiger L.J.Guibas J.Friedman J.Kahn J.Pintz W.Maass G.Schnitger Z.Galil R.Kannan R.Cole J.S.Salowe N.Kahale F.T.Leighton Y.Ma C.G.Plaxton T.Suel L.Babai P.Hajnal P.Pudlák V.Rödl G.Turán
Talks about:two (3) log (3) determinist (2) network (2) select (2) machin (2) simul (2) lower (2) graph (2) bound (2)
Person: Endre Szemerédi
DBLP: Szemer=eacute=di:Endre
Contributed to:
19951989
198819881987198619831976Wrote 11 papers:
- STOC-1995-KahaleLMPSS #bound #network #sorting
- Lower bounds for sorting networks (NK, FTL, YM, CGP, TS, ES), pp. 437–446.
- STOC-1989-FriedmanKS #graph #on the #random
- On the Second Eigenvalue in Random Regular Graphs (JF, JK, ES), pp. 587–598.
- ICALP-1988-ColeSSS
- Optimal Slope Selection (RC, JSS, WLS, ES), pp. 133–146.
- STOC-1988-PintzSS #infinity #performance #testing
- Two Infinite Sets of Primes with Fast Primality Tests (JP, WLS, ES), pp. 504–509.
- STOC-1987-AjtaiKS #simulation
- Deterministic Simulation in LOGSPACE (MA, JK, ES), pp. 132–140.
- STOC-1987-MaassSS #turing machine
- Two Tapes Are Better than One for Off-Line Turing Machines (WM, GS, ES), pp. 94–100.
- STOC-1986-AjtaiBHKPRST #bound #branch #source code
- Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.
- STOC-1986-AjtaiKSS #parallel
- Deterministic Selection in O(log log N) Parallel Time (MA, JK, WLS, ES), pp. 188–195.
- STOC-1986-GalilKS #graph #nondeterminism #on the #simulation #turing machine
- On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
- STOC-1983-AjtaiKS #network #sorting
- An O(n log n) Sorting Network (MA, JK, ES), pp. 1–9.
- STOC-1976-GuibasS #analysis
- The Analysis of Double Hashing (LJG, ES), pp. 187–191.