|
Search the dblp DataBase
Endre Szemerédi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Michael L. Fredman, János Komlós, Endre Szemerédi
Storing a Sparse Table with 0(1) Worst Case Access Time. [Citation Graph (10, 0)][DBLP] J. ACM, 1984, v:31, n:3, pp:538-544 [Journal]
- Michael L. Fredman, János Komlós, Endre Szemerédi
Storing a Sparse Table with O(1) Worst Case Access Time [Citation Graph (2, 0)][DBLP] FOCS, 1982, pp:165-169 [Conf]
- Leonidas J. Guibas, Endre Szemerédi
The Analysis of Double Hashing. [Citation Graph (1, 0)][DBLP] J. Comput. Syst. Sci., 1978, v:16, n:2, pp:226-274 [Journal]
- János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
The Regularity Lemma and Its Applications in Graph Theory. [Citation Graph (0, 0)][DBLP] Theoretical Aspects of Computer Science, 2000, pp:84-112 [Conf]
- Miklós Ajtai, János Komlós, Endre Szemerédi
Halvers and Expanders [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:686-692 [Conf]
- 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 [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:693-702 [Conf]
- Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Universality and Tolerance. [Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:14-21 [Conf]
- László Babai, Endre Szemerédi
On the Complexity of Matrix Group Problems I [Citation Graph (0, 0)][DBLP] FOCS, 1984, pp:229-240 [Conf]
- Noam Nisan, Endre Szemerédi, Avi Wigderson
Undirected Connectivity in O(log ^1.5 n) Space [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:24-29 [Conf]
- János Pach, William L. Steiger, Endre Szemerédi
An Upper Bound on the Number of Planar k-Sets [Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:72-79 [Conf]
- Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
On Determinism versus Non-Determinism and Related Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP] FOCS, 1983, pp:429-438 [Conf]
- Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
Optimal Slope Selection. [Citation Graph (0, 0)][DBLP] ICALP, 1988, pp:133-146 [Conf]
- Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
The Generalization of Dirac's Theorem for Hypergraphs. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:52-56 [Conf]
- Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Near-optimum Universal Graphs for Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:170-180 [Conf]
- János Komlós, Yuan Ma, Endre Szemerédi
Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). [Citation Graph (0, 0)][DBLP] SODA, 1996, pp:232-241 [Conf]
- 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 [Citation Graph (0, 0)][DBLP] STOC, 1986, pp:30-38 [Conf]
- Miklós Ajtai, János Komlós, Endre Szemerédi
An O(n log n) Sorting Network [Citation Graph (0, 0)][DBLP] STOC, 1983, pp:1-9 [Conf]
- Miklós Ajtai, János Komlós, Endre Szemerédi
Deterministic Simulation in LOGSPACE [Citation Graph (0, 0)][DBLP] STOC, 1987, pp:132-140 [Conf]
- Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
Deterministic Selection in O(log log N) Parallel Time [Citation Graph (0, 0)][DBLP] STOC, 1986, pp:188-195 [Conf]
- Joel Friedman, Jeff Kahn, Endre Szemerédi
On the Second Eigenvalue in Random Regular Graphs [Citation Graph (0, 0)][DBLP] STOC, 1989, pp:587-598 [Conf]
- Zvi Galil, Ravi Kannan, Endre Szemerédi
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines [Citation Graph (0, 0)][DBLP] STOC, 1986, pp:39-49 [Conf]
- Leonidas J. Guibas, Endre Szemerédi
The Analysis of Double Hashing (Extended Abstract) [Citation Graph (0, 0)][DBLP] STOC, 1976, pp:187-191 [Conf]
- Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
Lower bounds for sorting networks. [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:437-446 [Conf]
- Wolfgang Maass, Georg Schnitger, Endre Szemerédi
Two Tapes Are Better than One for Off-Line Turing Machines [Citation Graph (0, 0)][DBLP] STOC, 1987, pp:94-100 [Conf]
- Janos Pintz, William L. Steiger, Endre Szemerédi
Two Infinite Sets of Primes with Fast Primality Tests [Citation Graph (0, 0)][DBLP] STOC, 1988, pp:504-509 [Conf]
- Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
Two Tapes Versus One for Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1993, v:3, n:, pp:392-401 [Journal]
- Antal Balog, Endre Szemerédi
A Statistical Theorem of Set Addition. [Citation Graph (0, 0)][DBLP] Combinatorica, 1994, v:14, n:3, pp:263-268 [Journal]
- Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi
On Turáns theorem for sparse graphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 1981, v:1, n:4, pp:313-317 [Journal]
- Miklós Ajtai, János Komlós, Endre Szemerédi
The longest path in a random graph. [Citation Graph (0, 0)][DBLP] Combinatorica, 1981, v:1, n:1, pp:1-12 [Journal]
- Miklós Ajtai, János Komlós, Endre Szemerédi
Largest random component of a k-cube. [Citation Graph (0, 0)][DBLP] Combinatorica, 1982, v:2, n:1, pp:1-7 [Journal]
- Miklós Ajtai, János Komlós, Endre Szemerédi
Sorting in c log n parallel sets. [Citation Graph (0, 0)][DBLP] Combinatorica, 1983, v:3, n:1, pp:1-19 [Journal]
- Béla Csaba, Ali Shokoufandeh, Endre Szemerédi
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. [Citation Graph (0, 0)][DBLP] Combinatorica, 2003, v:23, n:1, pp:35-72 [Journal]
- Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
More results on Ramsey - Turán Type problems. [Citation Graph (0, 0)][DBLP] Combinatorica, 1983, v:3, n:1, pp:69-81 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Combinatorica, 1993, v:13, n:1, pp:31-56 [Journal]
- Zvi Galil, Ravi Kannan, Endre Szemerédi
On 3-pushdown graphs with large separators. [Citation Graph (0, 0)][DBLP] Combinatorica, 1989, v:9, n:1, pp:9-19 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Combinatorica, 1985, v:5, n:1, pp:41-52 [Journal]
- Henry A. Kierstead, Endre Szemerédi, William T. Trotter
On coloring graphs with locally small chromatic number. [Citation Graph (0, 0)][DBLP] Combinatorica, 1984, v:4, n:2, pp:183-185 [Journal]
- János Komlós, Gábor N. Sárközy, Endre Szemerédi
Blow-Up Lemma. [Citation Graph (0, 0)][DBLP] Combinatorica, 1997, v:17, n:1, pp:109-123 [Journal]
- Vojtech Rödl, Endre Szemerédi
On Size Ramsey Numbers of Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP] Combinatorica, 2000, v:20, n:2, pp:257-262 [Journal]
- Endre Szemerédi, William T. Trotter
Extremal problems in discrete geometry. [Citation Graph (0, 0)][DBLP] Combinatorica, 1983, v:3, n:3, pp:381-392 [Journal]
- Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
Turán-Ramsey Theorems and Kp-Independence Numbers. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:297-325 [Journal]
- János Komlós, Endre Szemerédi
Topological cliques in graphs 2. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:79-90 [Journal]
- János Komlós, Endre Szemerédi
Topological Cliques in Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:247-256 [Journal]
- János Komlós, Gábor N. Sárközy, Endre Szemerédi
Spanning Trees In Dense Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal]
- János Komlós, Gábor N. Sárközy, Endre Szemerédi
proof of a Packing Conjecture of Bollobás. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1995, v:4, n:, pp:241-255 [Journal]
- Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:423-436 [Journal]
- Alexander A. Razborov, Endre Szemerédi, Avi Wigderson
Constructing Small Sets that are Uniform in Arithmetic Progressions. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:513-518 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:7, n:, pp:1-11 [Journal]
- János Pach, William L. Steiger, Endre Szemerédi
An Upper Bound on the Number of Planar K-Sets. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:7, n:, pp:109-123 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:256, n:1-2, pp:243-255 [Journal]
- János Komlós, Endre Szemerédi
Limit distribution for the existence of Hamiltonian cycles in a random graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:10-11, pp:1032-1038 [Journal]
- János Komlós, Gábor N. Sárközy, Endre Szemerédi
Proof of the Alon-Yuster conjecture. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:235, n:1-3, pp:255-269 [Journal]
- Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
On the number of Hamiltonian cycles in Dirac graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:265, n:1-3, pp:237-250 [Journal]
- Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Perfect matchings in uniform hypergraphs with large minimum degree. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2006, v:27, n:8, pp:1333-1349 [Journal]
- Miklós Ajtai, János Komlós, Endre Szemerédi
There is no Fast Single Hashing Algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1978, v:7, n:6, pp:270-273 [Journal]
- Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi
There are no p-Complete Families of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:30, n:1, pp:47-49 [Journal]
- Vasek Chvátal, Endre Szemerédi
Many Hard Examples for Resolution. [Citation Graph (0, 0)][DBLP] J. ACM, 1988, v:35, n:4, pp:759-768 [Journal]
- Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
Optimal Parallel Selection has Complexity O(Log Log n). [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1989, v:38, n:1, pp:125-133 [Journal]
- László Babai, Péter Hajnal, Endre Szemerédi, György Turán
A Lower Bound for Read-Once-Only Branching Programs. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1987, v:35, n:2, pp:153-162 [Journal]
- Zvi Galil, Ravi Kannan, Endre Szemerédi
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1989, v:38, n:1, pp:134-149 [Journal]
- Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi
Extremal Uncrowded Hypergraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:321-335 [Journal]
- Miklós Ajtai, János Komlós, Endre Szemerédi
A Note on Ramsey Numbers. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1980, v:29, n:3, pp:354-360 [Journal]
- C. Chvatál, Vojtech Rödl, Endre Szemerédi, W. T. Trotter Jr.
The Ramsey number of a graph with bounded maximum degree. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:239-243 [Journal]
- Vasek Chvátal, Endre Szemerédi
Short cycles in directed graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:323-327 [Journal]
- Paul Erdös, Endre Szemerédi
Combinatorial Properties of Systems of Sets. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:308-313 [Journal]
- László Pyber, Vojtech Rödl, Endre Szemerédi
Dense Graphs without 3-Regular Subgraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:41-54 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:855-873 [Journal]
- Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Short paths in quasi-random triple systems with sparse underlying graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:584-607 [Journal]
- Ronald L. Graham, Endre Szemerédi
On subgraph number independence in trees. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1978, v:24, n:2, pp:213-222 [Journal]
- János Komlós, Gábor N. Sárközy, Endre Szemerédi
An algorithmic version of the blow-up lemma. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1998, v:12, n:3, pp:297-312 [Journal]
- János Komlós, Gábor N. Sárközy, Endre Szemerédi
On the square of a Hamiltonian cycle in dense graphs. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1996, v:9, n:1-2, pp:193-211 [Journal]
- Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
An Optimal-Time Algorithm for Slope Selection. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:4, pp:792-810 [Journal]
- Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi
Sorting in Average Time o(log) n. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1989, v:2, n:3, pp:285-292 [Journal]
- Péter Hajnal, Endre Szemerédi
Brooks Coloring in Parallel. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1990, v:3, n:1, pp:74-80 [Journal]
- János Komlós, Yuan Ma, Endre Szemerédi
Matching Nuts and Bolts in O(n log n) Time. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1998, v:11, n:3, pp:347-372 [Journal]
- Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1988, v:1, n:3, pp:399-410 [Journal]
- László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi
Lower Bounds to the Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:3, pp:313-323 [Journal]
- András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-Color Ramsey Numbers For Paths. [Citation Graph (0, 0)][DBLP] Combinatorica, 2007, v:27, n:1, pp:35-69 [Journal]
- János Komlós, Endre Szemerédi
Limit distribution for the existence of hamiltonian cycles in a random graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:43, n:1, pp:55-63 [Journal]
An approximate Dirac-type theorem for k -uniform hypergraphs. [Citation Graph (, )][DBLP]
Three-color Ramsey numbers for paths. [Citation Graph (, )][DBLP]
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$. [Citation Graph (, )][DBLP]
A Dirac-Type Theorem for 3-Uniform Hypergraphs. [Citation Graph (, )][DBLP]
Quadripartite version of the Hajnal-Szemerédi theorem. [Citation Graph (, )][DBLP]
Stability of the path-path Ramsey number. [Citation Graph (, )][DBLP]
How to avoid using the Regularity Lemma: Pósa's conjecture revisited. [Citation Graph (, )][DBLP]
Search in 0.010secs, Finished in 0.016secs
|