| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.  |
Electr. J. Comb.  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ian Levitt, Gábor N. Sárközy, Endre Szemerédi |
How to avoid using the Regularity Lemma: Pósa's conjecture revisited. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi |
A fast algorithm for equitable coloring. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Perfect matchings in large uniform hypergraphs with large minimum collective degree. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
Stability of the path-path Ramsey number. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Martin, Endre Szemerédi |
Quadripartite version of the Hajnal-Szemerédi theorem. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski |
An approximate Dirac-type theorem for k -uniform hypergraphs. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C65, 05C45, 05D05 |
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Three-color Ramsey numbers for paths. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C55, 05C38 |
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Three-Color Ramsey Numbers For Paths. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C55, 05C38 |
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Tripartite Ramsey numbers for paths. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
An improved bound for the monochromatic cycle partition number. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Short paths in quasi-random triple systems with sparse underlying graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Endre Szemerédi |
Limit distribution for the existence of Hamiltonian cycles in a random graph. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Perfect matchings in uniform hypergraphs with large minimum degree. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ayman Khalfalah, Endre Szemerédi |
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
A Dirac-Type Theorem for 3-Uniform Hypergraphs. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl |
The Generalization of Dirac's Theorem for Hypergraphs. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi |
On the number of Hamiltonian cycles in Dirac graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Csaba, Ali Shokoufandeh, Endre Szemerédi |
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05C35, 05C70 |
| 1 | Ayman Khalfalah, Sachin Lodha, Endre Szemerédi |
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Gábor N. Sárközy, Endre Szemerédi |
Proof of the Alon-Yuster conjecture. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Gábor N. Sárközy, Endre Szemerédi |
Spanning Trees In Dense Graphs. |
Combinatorics, Probability & Computing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Near-optimum Universal Graphs for Graphs with Bounded Degrees. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Endre Szemerédi |
On Size Ramsey Numbers of Graphs with Bounded Degree. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Universality and Tolerance. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
positive integers, sparse universal graphs, random constructions, fault-tolerant bipartite random graph, graph theory, graph theory, graphs, bipartite graphs, universality, vertices, tolerance, maximum degree |
| 1 | János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi |
The Regularity Lemma and Its Applications in Graph Theory. |
Theoretical Aspects of Computer Science |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Gábor N. Sárközy, Endre Szemerédi |
An algorithmic version of the blow-up lemma. |
Random Struct. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Luczak, Vojtech Rödl, Endre Szemerédi |
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. |
Combinatorics, Probability & Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | János Komlós, Yuan Ma, Endre Szemerédi |
Matching Nuts and Bolts in O(n log n) Time. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Gábor N. Sárközy, Endre Szemerédi |
Blow-Up Lemma. |
Combinatorica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Gábor N. Sárközy, Endre Szemerédi |
On the square of a Hamiltonian cycle in dense graphs. |
Random Struct. Algorithms |
1996 |
DBLP BibTeX RDF |
|
| 1 | János Komlós, Endre Szemerédi |
Topological cliques in graphs 2. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Yuan Ma, Endre Szemerédi |
Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | László Pyber, Vojtech Rödl, Endre Szemerédi |
Dense Graphs without 3-Regular Subgraphs. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Gábor N. Sárközy, Endre Szemerédi |
proof of a Packing Conjecture of Bollobás. |
Combinatorics, Probability & Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi |
Lower bounds for sorting networks. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Endre Szemerédi |
Topological Cliques in Graphs. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi |
Turán-Ramsey Theorems and Kp-Independence Numbers. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Antal Balog, Endre Szemerédi |
A Statistical Theorem of Set Addition. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Razborov, Endre Szemerédi, Avi Wigderson |
Constructing Small Sets that are Uniform in Arithmetic Progressions. |
Combinatorics, Probability & Computing |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi |
Turán-Ramsey theorems and simple asymptotically extremal structures. |
Combinatorica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán |
Two Tapes Versus One for Off-Line Turing Machines. |
Computational Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, William L. Steiger, Endre Szemerédi |
An Upper Bound on the Number of Planar K-Sets. |
Discrete & Computational Geometry |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Fan R. K. Chung, Endre Szemerédi, William T. Trotter |
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane. |
Discrete & Computational Geometry |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Nisan, Endre Szemerédi, Avi Wigderson |
Undirected Connectivity in O(log ^1.5 n) Space |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
recursive doubling technique, connectivity problem, deterministic algorithm, undirected graphs, space complexity |
| 1 | Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi |
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
k-fault tolerant graph, performance degradation, disjoint paths, perfect hash functions |
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
Halvers and Expanders |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
k-sorter switches, comparator switch, asymptotic efficiency, combinatorial networks, halvers, parallel algorithms, building blocks, expanders, combinatorial circuits |
| 1 | László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi |
Lower Bounds to the Complexity of Symmetric Boolean Functions. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Hajnal, Endre Szemerédi |
Brooks Coloring in Parallel. |
SIAM J. Discrete Math. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi |
There are no p-Complete Families of Symmetric Boolean Functions. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Ravi Kannan, Endre Szemerédi |
On 3-pushdown graphs with large separators. |
Combinatorica |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi |
Sorting in Average Time o(log) n. |
SIAM J. Discrete Math. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi |
Optimal Parallel Selection has Complexity O(Log Log n). |
J. Comput. Syst. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Ravi Kannan, Endre Szemerédi |
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. |
J. Comput. Syst. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi |
An Optimal-Time Algorithm for Slope Selection. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, William L. Steiger, Endre Szemerédi |
An Upper Bound on the Number of Planar k-Sets |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
planar k-sets, hyperplane II, upper bound, geometry, points, combinatorics |
| 1 | Joel Friedman, Jeff Kahn, Endre Szemerédi |
On the Second Eigenvalue in Random Regular Graphs |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Endre Szemerédi |
Many Hard Examples for Resolution. |
J. ACM |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson |
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). |
SIAM J. Discrete Math. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi |
Optimal Slope Selection. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Janos Pintz, William L. Steiger, Endre Szemerédi |
Two Infinite Sets of Primes with Fast Primality Tests |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, Georg Schnitger, Endre Szemerédi |
Two Tapes Are Better than One for Off-Line Turing Machines |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
Deterministic Simulation in LOGSPACE |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Ravi Kannan, Endre Szemerédi |
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines |
STOC |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi |
Deterministic Selection in O(log log N) Parallel Time |
STOC |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt |
On the sum of the reciprocals of cycle lengths in sparse graphs. |
Combinatorica |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael L. Fredman, János Komlós, Endre Szemerédi |
Storing a Sparse Table with 0(1) Worst Case Access Time. |
J. ACM |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Endre Szemerédi, William T. Trotter |
On coloring graphs with locally small chromatic number. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Endre Szemerédi |
On the Complexity of Matrix Group Problems I |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Endre Szemerédi |
Short cycles in directed graphs. |
J. Comb. Theory, Ser. B |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Chvatál, Vojtech Rödl, Endre Szemerédi, W. T. Trotter Jr. |
The Ramsey number of a graph with bounded maximum degree. |
J. Comb. Theory, Ser. B |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | János Komlós, Endre Szemerédi |
Limit distribution for the existence of hamiltonian cycles in a random graph. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
Sorting in c log n parallel sets. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Szemerédi, William T. Trotter |
Extremal problems in discrete geometry. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi |
More results on Ramsey - Turán Type problems. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter |
On Determinism versus Non-Determinism and Related Problems (Preliminary Version) |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
An O(n log n) Sorting Network |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi |
Extremal Uncrowded Hypergraphs. |
J. Comb. Theory, Ser. A |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
Largest random component of a k-cube. |
Combinatorica |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael L. Fredman, János Komlós, Endre Szemerédi |
Storing a Sparse Table with O(1) Worst Case Access Time |
FOCS |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
The longest path in a random graph. |
Combinatorica |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi |
On Turáns theorem for sparse graphs. |
Combinatorica |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
A Note on Ramsey Numbers. |
J. Comb. Theory, Ser. A |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald L. Graham, Endre Szemerédi |
On subgraph number independence in trees. |
J. Comb. Theory, Ser. B |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Endre Szemerédi |
Combinatorial Properties of Systems of Sets. |
J. Comb. Theory, Ser. A |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Ajtai, János Komlós, Endre Szemerédi |
There is no Fast Single Hashing Algorithm. |
Inf. Process. Lett. |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonidas J. Guibas, Endre Szemerédi |
The Analysis of Double Hashing. |
J. Comput. Syst. Sci. |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonidas J. Guibas, Endre Szemerédi |
The Analysis of Double Hashing (Extended Abstract) |
STOC |
1976 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")