WorldCat Identities

Szemerédi, E.

Overview
Works: 34 works in 76 publications in 3 languages and 688 library holdings
Genres: Conference papers and proceedings  Bibliography 
Roles: Editor, Contributor, Author
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 )

9 editions published between 1985 and 1986 in English and Dutch and held by 221 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 21 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 Janos Pintz( Book )

4 editions published in 1987 in German and English and held by 7 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

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

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

Regular partitions of graphs by E Szemerédi( Book )

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

A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph can be decomposed into relatively few 'nearly regular' bipartite subgraphs. In this note the author generalizes this result to arbitrary graphs, at the same time strengthening and simplifying the original bipartite result
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 held by 4 WorldCat member libraries worldwide

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

2 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide

Number theory, analysis, and combinatorics : proceedings of the Paul Tuŕan Memorial Conference held August 22-26, 2011 in Budapest by P Turán( Book )

1 edition published in 2013 in English and held by 4 WorldCat member libraries worldwide

Main description: 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 22-26, 2011. Some of the invited lectures reviewed different aspects of Paul Turán's work and influence. Most of the lectures allowed participants to report about their own work in the above mentioned areas of mathematics
Optimal slope selection by Richard Cole( Book )

1 edition published in 1987 in English and held by 4 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

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 Sparse Graphs with Dense Long Paths by P Erdoes( Book )

4 editions published in 1975 in English 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
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

Deterministic simulation in LOGSPACE by Thomas J. Watson IBM Research Center( Book )

2 editions published in 1986 in English and held by 2 WorldCat member libraries worldwide

On a conjecture of Loebl by Thomas J. Watson IBM Research Center( Book )

2 editions published in 1994 in English and held by 2 WorldCat member libraries 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

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

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.70 (from 0.01 for Number the ... to 0.98 for Theory of ...)

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

Endre Szemerédi Hongaars wiskundige

Endre Szemerédi Hungarian-American combinatorial mathematician and theoretical computer scientist

Endre Szemerédi matemático húngaro

Endre Szemerédi matematico ungherese

Endre Szemerédi ungarischer Mathematiker

Endre Szemerédi ungarsk informatiker og matematiker

Szemerédi, E.

Szemerédi, E. 1940-

Szemerédi, Endre 1940-

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

Ендре Семереді угорський математик

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

אנדרה סמרדי

세메레디 엔드레

エンドレ・セメレディ

塞迈雷迪·安德烈

Languages
English (57)

German (3)

Dutch (1)

Covers