SZEMERÉDI, ENDRE: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

A note on Ramsey numbers

Miklós Ajtai, János Komlós, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series A

Year:

1980

Language:

english

File:

PDF, 310 KB

english, 1980

2

Storing a Sparse Table with 0(1) Worst Case Access Time

Fredman, Michael L., Komlós, János, Szemerédi, Endre

Journal:

Journal of the ACM

Year:

1984

Language:

english

File:

PDF, 348 KB

english, 1984

3

A Dense Infinite Sidon Sequence

Ajtai, Miklós, Komlós, János, Szemerédi, Endre

Journal:

European Journal of Combinatorics

Year:

1981

Language:

english

File:

PDF, 500 KB

english, 1981

4

On the Probability That a Random ± 1-Matrix Is Singular

Jeff Kahn, János Komlós and Endre Szemerédi

Journal:

Journal of the American Mathematical Society

Year:

1995

Language:

english

File:

PDF, 1.10 MB

english, 1995

5

Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes

Pintz, Janos, Steiger, William L., Szemeredi, Endre

Journal:

Mathematics of Computation

Year:

1989

Language:

english

File:

PDF, 1.05 MB

english, 1989

6

Many hard examples for resolution

Chvátal, Vašek, Szemerédi, Endre

Journal:

Journal of the ACM

Year:

1988

Language:

english

File:

PDF, 636 KB

english, 1988

7

The analysis of double hashing

Leo J. Guibas, Endre Szemeredi

Journal:

Journal of Computer and System Sciences

Year:

1978

Language:

english

File:

PDF, 2.79 MB

english, 1978

8

On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines

Zvi Galil, Ravi Kannan, Endre Szemerédi

Journal:

Journal of Computer and System Sciences

Year:

1989

Language:

english

File:

PDF, 1.05 MB

english, 1989

9

Sparse partition universal graphs for graphs of bounded degree

Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht, Endre Szemerédi

Journal:

Advances in Mathematics

Year:

2011

Language:

english

File:

PDF, 240 KB

english, 2011

10

Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs

Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

Advances in Mathematics

Year:

2011

Language:

english

File:

PDF, 897 KB

english, 2011

11

Short paths in quasi-random triple systems with sparse underlying graphs

Joanna Polcyn, Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series B

Year:

2006

Language:

english

File:

PDF, 257 KB

english, 2006

12

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - On determinism versus non-determinism and related problems

Paul, Wolfgang J., Pippenger, Nicholas, Szemeredi, Endre, Trotter, William T.

Year:

1983

Language:

english

File:

PDF, 821 KB

english, 1983

13

Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas

Szemerédi, Endre

Journal:

Communications in Mathematics and Statistics

Year:

2015

Language:

english

File:

PDF, 644 KB

english, 2015

14

On the square of a Hamiltonian cycle in dense graphs

János Komlós, Gábor N. Sárközy, Endre Szemerédi

Journal:

Random Structures & Algorithms

Year:

1996

Language:

english

File:

PDF, 1.01 MB

english, 1996

15

An algorithmic version of the blow-up lemma

János Komlós, Gabor N. Sarkozy, Endre Szemerédi

Journal:

Random Structures & Algorithms

Year:

1998

Language:

english

File:

PDF, 210 KB

english, 1998

16

Girth of sparse graphs

Béla Bollobás, Endre Szemerédi

Journal:

Journal of Graph Theory

Year:

2002

Language:

english

File:

PDF, 73 KB

english, 2002

17

Tripartite Ramsey numbers for paths

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Journal:

Journal of Graph Theory

Year:

2007

Language:

english

File:

PDF, 137 KB

english, 2007

18

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Journal of Graph Theory

Year:

2010

Language:

english

File:

PDF, 122 KB

english, 2010

19

Limit distribution for the existence of hamiltonian cycles in a random graph

János Komlós, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

1983

Language:

english

File:

PDF, 874 KB

english, 1983

20

A lower bound for read-once-only branching programs

László Babai, Péter Hajnal, Endre Szemerédi, György Turán

Journal:

Journal of Computer and System Sciences

Year:

1987

Language:

english

File:

PDF, 582 KB

english, 1987

21

Optimal parallel selection has complexity O(Log Log N)

Miklós Ajtai, János Komlós, W.L. Steiger, Endre Szemerédi

Journal:

Journal of Computer and System Sciences

Year:

1989

Language:

english

File:

PDF, 503 KB

english, 1989

22

How to avoid using the Regularity Lemma: Pósa’s conjecture revisited

Ian Levitt, Gábor N. Sárközy, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2010

Language:

english

File:

PDF, 699 KB

english, 2010

23

Perfect matchings in uniform hypergraphs with large minimum degree

Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

European Journal of Combinatorics

Year:

2006

Language:

english

File:

PDF, 435 KB

english, 2006

24

Perfect matchings in large uniform hypergraphs with large minimum collective degree

Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series A

Year:

2009

Language:

english

File:

PDF, 386 KB

english, 2009

25

An improved bound for the monochromatic cycle partition number

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series B

Year:

2006

Language:

english

File:

PDF, 205 KB

english, 2006

26

Proof of the Alon–Yuster conjecture

János Komlós, Gábor Sárközy, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2001

Language:

english

File:

PDF, 137 KB

english, 2001

27

On the number of Hamiltonian cycles in Dirac graphs

Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2003

Language:

english

File:

PDF, 167 KB

english, 2003

28

Blow-up Lemma

János Komlós, Gábor N. Sárközy, Endre Szemerédi

Journal:

Year:

1997

Language:

english

File:

PDF, 709 KB

english, 1997

29

A statistical theorem of set addition

Antal Balog, Endre Szemerédi

Journal:

Year:

1994

Language:

english

File:

PDF, 245 KB

english, 1994

30

Two tapes versus one for off-line Turing machines

Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán

Journal:

Computational Complexity

Year:

1993

Language:

english

File:

PDF, 603 KB

english, 1993

31

Proof of the Seymour conjecture for large graphs

János Komlós, Gábor N. Sárközy, Endre Szemerédi

Journal:

Annals of Combinatorics

Year:

1998

Language:

english

File:

PDF, 1.22 MB

english, 1998

32

An upper bound on the number of planarK-sets

János Pach, William Steiger, Endre Szemerédi

Journal:

Discrete & Computational Geometry

Year:

1992

Language:

english

File:

PDF, 746 KB

english, 1992

33

The longest path in a random graph

Miklós Ajtai, János Komlós, Endre Szemerédi

Journal:

Year:

1981

Language:

english

File:

PDF, 571 KB

english, 1981

34

Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Annals of Combinatorics

Year:

2010

Language:

english

File:

PDF, 190 KB

english, 2010

35

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Graphs and Combinatorics

Year:

2010

Language:

english

File:

PDF, 124 KB

english, 2010

36

Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three*

Béla Csaba†‡, Ali Shokoufandeh‡, Endre Szemerédi

Journal:

Year:

2003

Language:

english

File:

PDF, 432 KB

english, 2003

37

Three-Color Ramsey Numbers For Paths

András Gyárfás, Miklós Ruszinkó*, Gábor N. Sárközy†, Endre Szemerédi

Journal:

Year:

2007

Language:

english

File:

PDF, 450 KB

english, 2007

38

Three-color Ramsey numbers for paths

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Journal:

Year:

2008

Language:

english

File:

PDF, 325 KB

english, 2008

39

An approximate Dirac-type theorem fork-uniform hypergraphs

Vojtěch Rödl, Endre Szemerédi, Andrzej Ruciński

Journal:

Year:

2008

Language:

english

File:

PDF, 365 KB

english, 2008

40

A fast algorithm for equitable coloring

Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi

Journal:

Year:

2010

Language:

english

File:

PDF, 399 KB

english, 2010

41

On Size Ramsey Numbers of Graphs with Bounded Degree

Vojtěch Rödl, Endre Szemerédi

Journal:

Year:

2000

Language:

english

File:

PDF, 144 KB

english, 2000

42

Limit distribution for the existence of Hamiltonian cycles in a random graph

János Komlós, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2006

Language:

english

File:

PDF, 172 KB

english, 2006

43

Quadripartite version of the Hajnal–Szemerédi theorem

Ryan Martin, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2008

Language:

english

File:

PDF, 408 KB

english, 2008

44

Stability of the path–path Ramsey number

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2009

Language:

english

File:

PDF, 404 KB

english, 2009

45

There is no fast single hashing algorithm

Miklós Ajtai, János Komlós, Endre Szemerédi

Journal:

Information Processing Letters

Year:

1978

Language:

english

File:

PDF, 485 KB

english, 1978

46

There are no p-complete families of symmetric boolean functions

Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi

Journal:

Information Processing Letters

Year:

1989

Language:

english

File:

PDF, 279 KB

english, 1989

47

An Optimal-Time Algorithm for Slope Selection

Cole, Richard, Salowe, Jeffrey S., Steiger, W. L., Szemerédi, Endre

Journal:

SIAM Journal on Computing

Year:

1989

Language:

english

File:

PDF, 2.49 MB

english, 1989

48

The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$

Ragde, Prabhakar, Steiger, William, Szemerédi, Endre, Wigderson, Avi

Journal:

SIAM Journal on Discrete Mathematics

Year:

1988

Language:

english

File:

PDF, 1.70 MB

english, 1988

49

Matching Nuts and Bolts in O(n log n) Time

Komlós, János, Ma, Yuan, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

1998

Language:

english

File:

PDF, 454 KB

english, 1998

50

Brooks Coloring in Parallel

Hajnal, Péter, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

1990

Language:

english

File:

PDF, 971 KB

english, 1990