<--- 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

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

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

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

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

DocID: 1pt06 - View Document

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

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

DocID: 1phok - View Document

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

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

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

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

DocID: NlWH - View Document