Martin Dyer - PDFSEARCH.IO - Document Search Engine

Martin Dyer
Results: 8

#	Item
1	Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs Magnus Bordewich∗, Martin Dyer∗ and Marek Karpinski† August 17, 2006 Abstract Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2007-03-12 00:19:27 Markov processes Hypergraph Markov chain Stopping time Spectral theory
2	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality
3	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality
4	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 Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2014-01-29 10:45:00 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
5	On the complexity of #CSP Martin Dyer University of Leeds Fields Institute Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2011-08-15 11:39:00 Constraint programming Constraint satisfaction problem Orbifold
6	Random Walks on Combinatorial Objects Martin Dyer and Catherine Greenhill Summary Approximate sampling from combinatorially-defined sets, using the Markov chain Monte Carlo method, is discussed from the perspective of co Add to Reading List Source URL: www.stat.ucla.edu Language: English - Date: 2012-11-02 15:07:34 Ordinal number Markov chain Spectral theory Mathematics Automata theory Mathematical analysis Mathematical sciences Probability theory Symbol Probability space
7	The EATCS Award 2013 Laudatio for Martin Dyer Martin Dyer has made enormous and multifaceted contributions to Theoretical Computer Add to Reading List Source URL: eatcs.org Language: English - Date: 2013-02-18 11:02:17 Computational complexity theory Operations research Analysis of algorithms Martin Dyer Polynomial-time algorithm for approximating the volume of convex bodies Algorithm Approximation algorithm Linear programming Time complexity Theoretical computer science Applied mathematics Mathematics
8	PDF Document Add to Reading List Source URL: www.ams.org Language: English - 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

UPDATE