WorldCat Identities

Szemerédi, E.

Overview
Works: 37 works in 71 publications in 3 languages and 616 library holdings
Genres: Conference proceedings  Bibliography 
Roles: Author, Editor, Contributor
Classifications: QA76.6, 001.642
Publication Timeline
.
Most widely held works about E Szemerédi
 
Most widely held works by E Szemerédi
Theory of algorithms( Book )

7 editions published between 1985 and 1986 in English and Dutch and held by 202 WorldCat member libraries worldwide

An irregular mind : Szemerédi is 70 by Imre Bárány( Book )

4 editions published in 2010 in English and held by 19 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 k-term 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
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

An upper bound on the number of planar k-sets 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 k-set if there is a hyperplane II that separates X from S - X. We prove that [formula] is an upper bound for the number of k-sets in the plane, thus improving the previous bound of Erdös, Lovász, Simmons and Strauss by a factor of [formula]."
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

Many hard examples for resolution by Vašek Chvátal( Book )

5 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide

Optimal slope selection by Richard Cole( Book )

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

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

On multiplicative representations of integers by P Erdoes( Book )

4 editions published in 1975 in English and Undetermined and held by 4 WorldCat member libraries worldwide

Theory of algorithms : colloquium; Pécs, July 16-21 1984( Book )

1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide

On complete subgraphs of r-chromatic graphs by Béla Bollobás( Book )

2 editions published in 1975 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
Regular partitions of graphs by E Szemerédi( Book )

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

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

Generating expanders from two permutations by M Ajtai( Book )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

On the running time of the Adleman-Pomerance-Rumely primality test by J Pelikán( Book )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

On 3-pushdown graphs with large separators by Zvi Galil( Book )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

On the running time of the Adelman-Pomerance-Rumely primality test by DIMACS (Group)( Book )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.71 (from 0.50 for On the run ... to 0.97 for Theory of ...)

An irregular mind : Szemerédi is 70
Alternative Names
Endre Szemerdi

Endre Szemerdi Hongaars wiskundige

Endre Szemerdi Hungarian-American combinatorial mathematician and theoretical computer scientist

Endre Szemerdi matemtico hngaro

Endre Szemerdi matematico ungherese

Endre Szemerdi ungarischer Mathematiker

Endre Szemerdi ungarsk informatiker og matematiker

Szemerdi, E. 1940-

Szemerdi, Endre 1940-

Ендре Семереді

Семереди, Эндре

세메레디 엔드레

塞迈雷迪安德烈

Languages
English (47)

German (3)

Dutch (1)

Covers