<--- Back to Details
First PageDocument Content
Endre Szemerédi / Jeong Han Kim / Fulkerson Prize / Alan M. Frieze / Graph theory / László Lovász / Ravi Kannan / Éva Tardos / Martin Dyer / Mathematics / Combinatorics / Knuth Prize laureates
Date: 1999-03-08 15:16:54
Endre Szemerédi
Jeong Han Kim
Fulkerson Prize
Alan M. Frieze
Graph theory
László Lovász
Ravi Kannan
Éva Tardos
Martin Dyer
Mathematics
Combinatorics
Knuth Prize laureates

Add to Reading List

Source URL: www.ams.org

Download Document from Source Website

File Size: 74,64 KB

Share Document on Facebook

Similar Documents

Markov processes / Hypergraph / Markov chain / Stopping time / Spectral theory

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs Magnus Bordewich∗, Martin Dyer∗ and Marek Karpinski† August 17, 2006 Abstract

DocID: 1pLfa - View Document

Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational geometry / Bounding sphere / LP-type problem / Simplex algorithm / Time complexity / Mathematical optimization / Integer programming / Duality

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

DocID: 1pt06 - View Document

Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational geometry / Bounding sphere / LP-type problem / Simplex algorithm / Time complexity / Mathematical optimization / Integer programming / Duality

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

DocID: 1phok - View Document

International Colloquium on Automata /  Languages and Programming / European Association for Theoretical Computer Science / Gödel Prize / ACM SIGACT / Martin Dyer / Algorithm / Mike Paterson / International Conference on Developments in Language Theory / Theoretical computer science / Computer science / Applied mathematics

Letter from the President Dear EATCS members, Time flies somehow and the 40th ICALP conference is now upon us. I hope that many of you will attend the conference, which will be held in Riga, Latvia, in the

DocID: ZAtP - View Document

Constraint programming / Constraint satisfaction problem / Orbifold

On the complexity of #CSP Martin Dyer University of Leeds Fields Institute

DocID: NlWH - View Document