Szemerédi, E.
Overview
Works:  35 works in 69 publications in 3 languages and 610 library holdings 

Genres:  Conference proceedings Bibliography 
Roles:  Author, Editor, Contributor 
Classifications:  QA241 .P38 2013, 512.7 
Publication Timeline
.
Most widely held works about
E Szemerédi
 An irregular mind Szemerédi is 70 by Imre Bárány Imre Bárány( Book )
Most widely held works by
E Szemerédi
An irregular mind Szemerédi is 70
by
Imre Bárány(
)
4 editions published in 2010 in English and held by 334 WorldCat member libraries worldwide
Szemerédi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This volume is a celebration of Szemerédi's achievements and personality, on the occasion of his seventieth birthday. It exemplifies his extraordinary vision and unique way of thinking. A number of colleagues and friends, all top authorities in their fields, have contributed their latest research papers to this volume. The topics include extension and applications of the regularity lemma, the existence of kterm arithmetic progressions in various subsets of the integers, extremal problems in hypergraphs theory, and random graphs, all of them beautiful, Szemerédi type mathematics. It also contains published accounts of the first two, very original and highly successful Polymath projects, one led by Tim Gowers and the other by Terry Tao
4 editions published in 2010 in English and held by 334 WorldCat member libraries worldwide
Szemerédi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This volume is a celebration of Szemerédi's achievements and personality, on the occasion of his seventieth birthday. It exemplifies his extraordinary vision and unique way of thinking. A number of colleagues and friends, all top authorities in their fields, have contributed their latest research papers to this volume. The topics include extension and applications of the regularity lemma, the existence of kterm arithmetic progressions in various subsets of the integers, extremal problems in hypergraphs theory, and random graphs, all of them beautiful, Szemerédi type mathematics. It also contains published accounts of the first two, very original and highly successful Polymath projects, one led by Tim Gowers and the other by Terry Tao
Theory of algorithms
(
Book
)
7 editions published between 1985 and 1986 in English and Dutch and held by 204 WorldCat member libraries worldwide
7 editions published between 1985 and 1986 in English and Dutch and held by 204 WorldCat member libraries worldwide
Two infinite sets of primes with fast primality tests
by
János Pintz(
Book
)
4 editions published in 1987 in German and English and held by 6 WorldCat member libraries worldwide
4 editions published in 1987 in German and English and held by 6 WorldCat member libraries worldwide
Infinite sets of primes with fast primality tests and quick generation of large primes
by
János Pintz(
Book
)
3 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
An upper bound on the number of planar ksets
by
János Pach(
Book
)
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Given a set S of n points, a subset X of size k is called a kset if there is a hyperplane II that separates X from S  X. We prove that [formula] is an upper bound for the number of ksets in the plane, thus improving the previous bound of Erdös, Lovász, Simmons and Strauss by a factor of [formula]."
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Given a set S of n points, a subset X of size k is called a kset if there is a hyperplane II that separates X from S  X. We prove that [formula] is an upper bound for the number of ksets in the plane, thus improving the previous bound of Erdös, Lovász, Simmons and Strauss by a factor of [formula]."
Optimal slope selection
by
Richard Cole(
Book
)
1 edition published in 1987 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 4 WorldCat member libraries worldwide
On sets of natural numbers whose difference set contains no squares
by
János Pintz(
Book
)
3 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
On subgraph number independence in trees
by
Ronald L Graham(
Book
)
4 editions published in 1975 in English and Undetermined and held by 4 WorldCat member libraries worldwide
4 editions published in 1975 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Many hard examples for resolution
by
V Chvatal(
Book
)
5 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
5 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
On multiplicative representations of integers
by Paul Erdös(
Book
)
4 editions published in 1975 in English and Undetermined and held by 4 WorldCat member libraries worldwide
4 editions published in 1975 in English and Undetermined and held by 4 WorldCat member libraries worldwide
On complete subgraphs of rchromatic graphs
by
Béla Bollobás(
Book
)
2 editions published in 1975 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1975 in English and held by 3 WorldCat member libraries worldwide
Theory of algorithms : colloquium; Pécs, July 1621 1984
(
Book
)
1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide
On Sparse Graphs with Dense Long Paths
by P Erdoes(
Book
)
4 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
The following problem was raised by H.J. Stoss in connection with certain questions related to the complexity of Boolean functions. An acyclic directed graph G is said to have property p (m, n) if for any set of X of m vertices of G, there is a directed path of length n in G which does not intersect X. Let f(m, n) denote the minimum number of edges a graph with property p(m, n) can have
4 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
The following problem was raised by H.J. Stoss in connection with certain questions related to the complexity of Boolean functions. An acyclic directed graph G is said to have property p (m, n) if for any set of X of m vertices of G, there is a directed path of length n in G which does not intersect X. Let f(m, n) denote the minimum number of edges a graph with property p(m, n) can have
Regular partitions of graphs
by
E Szemerédi(
Book
)
2 editions published in 1975 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1975 in English and held by 3 WorldCat member libraries worldwide
On a problem in additive number theory
by
András Sárközy(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
A cure for the telephone disease
by
A Hajnal(
Book
)
1 edition published in 1971 in English and held by 1 WorldCat member library worldwide
1 edition published in 1971 in English and held by 1 WorldCat member library worldwide
Number Theory, Analysis, and Combinatorics Proceedings of the Paul Turan Memorial Conference held August 2226, 2011 in Budapest
by
Kálmán Györy(
Book
)
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
Paul Turán, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910. To celebrate this occasion the Hungarian Academy of Sciences, the Alfréd Rényi Institute of Mathematics, the János Bolyai Mathematical Society and the Mathematical Institute of Eötvös Loránd University organized an international conference devoted to Paul Turán's main areas of interest: number theory, selected branches of analysis, and selected branches of combinatorics. The conference was held in Budapest, August 2226, 2011. Some of the invited lectures reviewed different aspects of Paul Tur
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
Paul Turán, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910. To celebrate this occasion the Hungarian Academy of Sciences, the Alfréd Rényi Institute of Mathematics, the János Bolyai Mathematical Society and the Mathematical Institute of Eötvös Loránd University organized an international conference devoted to Paul Turán's main areas of interest: number theory, selected branches of analysis, and selected branches of combinatorics. The conference was held in Budapest, August 2226, 2011. Some of the invited lectures reviewed different aspects of Paul Tur
On the running time of the AdelmanPomeranceRumely primality test
by
NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
On the running time of the AdlemanPomeranceRumely primality test
by J Pelikán(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Generating expanders from two permutations
by M Ajtai(
Book
)
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Combinatorial analysis Combinatorial geometry Combinatorial set theory Computational complexity Computer programming Computer scienceMathematics Field theory (Physics) Functions Graph theory Hungary Machine translating Mathematical analysis Mathematicians Mathematics MathematicsData processing Numbers, Natural Numbers, Prime Numbers, PrimeData processing Number theory Numerical analysis Partitions (Mathematics) Proof theory Set theory Set theoryData processing Topology Trees (Graph theory)