Select a publication 
Show 
Title 
Venue 
Rating 
Date 

Conference paper
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher.
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings.

SIAM J. Comput. 2000, Volume 30 
(0)

2000 

Conference paper
Martin E. Dyer, Alan M. Frieze, Mark Jerrum.
On Counting Independent Sets in Sparse Graphs.

FOCS 1999 
(0)

1999 

Conference paper
Yoram Hirshfeld, Mark Jerrum.
Bisimulation Equivanlence Is Decidable for Normed Process Algebra.

Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 1115, 1999, Proceedings 1999 
(0)

1999 

Conference paper
Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum.
On Approximately Counting Colorings of Small Degree Graphs.

SIAM J. Comput. 2000, Volume 29 
(0)

1999 

Conference paper
Leslie Ann Goldberg, Mark Jerrum.
Randomly Sampling Molecules.

SIAM J. Comput. 2000, Volume 29 
(0)

1999 

Conference paper
Leslie Ann Goldberg, Mark Jerrum.
The "Burnside Process" Converges Slowly.

Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 810, 1998, Proceedings 1998 
(0)

1998 

Conference paper
Mark Jerrum, Gregory B. Sorkin.
The Metropolis Algorithm for Graph Bisection.

Discrete Applied Mathematics 1998, Volume 82 
(0)

1998 

Conference paper
Russ Bubley, Martin E. Dyer, Mark Jerrum.
An elementary analysis of a procedure for sampling points in a convex body.

Random Struct. Algorithms 1998, Volume 12 
(0)

1998 

Conference paper
Martin E. Dyer, Alan M. Frieze, Mark Jerrum.
Approximately Counting Hamilton Paths and Cycles in Dense Graphs.

SIAM J. Comput. 1998, Volume 27 
(0)

1998 

Conference paper
Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie.
An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks.

SIAM J. Comput. 1998, Volume 27 
(0)

1998 

Conference paper
Vivek Gore, Mark Jerrum.
The SwendsenWang Process Does Not Always Mix Rapidly.

STOC 1997 
(0)

1997 

Conference paper
Alan M. Frieze, Mark Jerrum.
Improved Approximation Algorithms for MAX kCUT and MAX BISECTION.

Algorithmica 1997, Volume 18 
(0)

1997 

Conference paper
Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney.
A QuasiPolynomialTime Algorithm for Sampling Words from a ContextFree Language.

Inf. Comput. 1997, Volume 134 
(0)

1997 

Conference paper
Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao.
Doubly Logarithmic Communication Algorithms for OpticalCommunication Parallel Computers.

SIAM J. Comput. 1997, Volume 26 
(0)

1997 

Conference paper
Leslie Ann Goldberg, Mark Jerrum.
Randomly Sampling Molecules.

SODA 1997 
(0)

1997 

Conference paper
Alan M. Frieze, Mark Jerrum, Ravi Kannan.
Learning Linear Transformations.

FOCS 1996 
(0)

1996 

Conference paper
Mark Jerrum, Umesh V. Vazirani.
A Mildly Exponential Approximation Algorithm for the Permanent.

Algorithmica 1996, Volume 16 
(0)

1996 

Conference paper
Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald.
Generating and Counting Hamilton Cycles in Random Regular Graphs.

J. Algorithms 1996, Volume 21 
(0)

1996 

Conference paper
Yoram Hirshfeld, Mark Jerrum, Faron Moller.
A PolynomialTime Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes.

Mathematical Structures in Computer Science 1996, Volume 6 
(0)

1996 

Conference paper
Yoram Hirshfeld, Mark Jerrum, Faron Moller.
A Polynomial Algorithm for Deciding Bisimilarity of Normed ContextFree Processes.

Theor. Comput. Sci. 1996, Volume 158 
(0)

1996 

Conference paper
Alan M. Frieze, Mark Jerrum.
Improved Approximation Algorithms for MAX

Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 2931, 1995, Proceedings 1995 
(0)

1995 

Conference paper
Alan M. Frieze, Mark Jerrum.
An Analysis of a Monte Carlo Algorithm for Estimating the Permanent.

Combinatorica 1995, Volume 15 
(0)

1995 

Conference paper
Paul W. Goldberg, Mark Jerrum.
Bounding the VapnikChervonenkis Dimension of Concept Classes Parameterized by Real Numbers.

Machine Learning 1995, Volume 18 
(0)

1995 

Conference paper
Mark Jerrum.
A Very Simple Algorithm for Estimating the Number of kColorings of a LowDegree Graph.

Random Struct. Algorithms 1995, Volume 7 
(0)

1995 

Conference paper
Yoram Hirshfeld, Mark Jerrum, Faron Moller.
A Polynomialtime Algorithm for Deciding Equivalence of Normed Contextfree Processes

35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 2022 November 1994 1994 
(0)

1994 

Conference paper
Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie.
An W(log log n) Lower Bound for Routing in Optical Networks.

SPAA 1994 
(0)

1994 

Conference paper
Mark Jerrum.
Simple TranslationInvariant Concepts Are Hard to Learn

Inf. Comput. 1994, Volume 113 
(0)

1994 

Conference paper
Mark Jerrum.
Counting Trees in a Graph is #PComplete.

Inf. Process. Lett. 1994, Volume 51 
(0)

1994 

Conference paper
Robert W. Irving, Mark Jerrum.
ThreeDimensional Statistical Data Security Problems.

SIAM J. Comput. 1994, Volume 23 
(0)

1994 

Conference paper
Martin E. Dyer, Alan M. Frieze, Mark Jerrum.
Approximately Counting Hamilton Cycles in Dense Graphs.

SODA 1994 
(0)

1994 

Conference paper
Paul W. Goldberg, Mark Jerrum.
Bounding the VapnikChervonenkis Dimension of Concept Classes Parameterized by Real Numbers.

COLT 1993 
(0)

1993 

Conference paper
Mark Jerrum, Gregory B. Sorkin.
Simulated Annealing for Graph Bisection

34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 35 November 1993 1993 
(0)

1993 

Conference paper
Mark Jerrum.
An analysis of a Monte Carlo algorithm for estimating the permanent.

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29  May 1, 1993 1993 
(0)

1993 

Conference paper
Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao.
A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer.

SPAA 1993 
(0)

1993 

Conference paper
Mark Jerrum, Alistair Sinclair.
PolynomialTime Approximation Algorithms for the Ising Model.

SIAM J. Comput. 1993, Volume 22 
(0)

1993 

Conference paper
Mark Jerrum.
Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation.

Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 1114, 1992 1993 
(0)

1992 

Conference paper
Mark Jerrum, Umesh V. Vazirani.
A Mildly Exponential Approximation Algorithm for the Permanent

33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 2427 October 1992 1992 
(0)

1992 

Conference paper
Mark Jerrum.
Large Cliques Elude the Metropolis Process.

Random Struct. Algorithms 1992, Volume 3 
(0)

1992 

Conference paper
Mark Jerrum, Alistair Sinclair.
PolynomialTime Approximation Algorithms for Ising Model (Extended Abstract).

Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 1620, 1990, Proceedings 1990 
(0)

1990 

Conference paper
Mark Jerrum, Alistair Sinclair.
Fast Uniform Generation of Regular Graphs.

Theor. Comput. Sci. 1990, Volume 73 
(0)

1990 

Conference paper
Alistair Sinclair, Mark Jerrum.
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains

Inf. Comput. 1989, Volume 82 
(0)

1989 

Conference paper
Mark Jerrum, Alistair Sinclair.
Approximating the Permanent.

SIAM J. Comput. 1989, Volume 18 
(0)

1989 

Conference paper
Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum.
On Continuous Homotopic One Layer Routing.

Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, Würzburg, Germany, March 2425, 1988 1988 
(0)

1988 

Conference paper
Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling.
On Continuous Homotopic One Layer Routing.

Symposium on Computational Geometry 1988 
(0)

1988 

Conference paper
Mark Jerrum, Alistair Sinclair.
Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version)

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 24, 1988, Chicago, Illinois, USA 1988 
(0)

1988 

Conference paper
Alistair Sinclair, Mark Jerrum.
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains.

GraphTheoretic Concepts in Computer Science, International Workshop, WG '87, Kloster Banz/Staffelstein, Germany, June 29  July 1, 1987, Proceedings 1988 
(0)

1987 

Conference paper
Mark Jerrum.
A Compact Representation for Permutation Groups.

J. Algorithms 1986, Volume 7 
(0)

1986 

Conference paper
Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani.
Random Generation of Combinatorial Structures from a Uniform Distribution.

Theor. Comput. Sci. 1986, Volume 43 
(0)

1986 

Conference paper
Mark Jerrum.
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract).

Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 1519, 1985, Proceedings 1985 
(0)

1985 

Conference paper
Mark Jerrum.
The Complexity of Finding MinimumLength Generator Sequences.

Theor. Comput. Sci. 1985, Volume 36 
(0)

1985 

Conference paper
Mark Jerrum.
The Complexity of Finding MinimumLength Generator Sequences (Extended Abstract).

Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 1620, 1984, Proceedings 1984 
(0)

1984 

Conference paper
Mark Jerrum, Sven Skyum.
Families of Fixed Degree Graphs for Processor Interconnection.

IEEE Trans. Computers 1984, Volume 33 
(0)

1984 

Conference paper
Mark Jerrum.
A Compact Representation for Permutation Groups

23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 35 November 1982 1982 
(0)

1982 

Conference paper
Mark Jerrum, Marc Snir.
Some Exact Complexity Results for StraightLine Computations over Semirings.

J. ACM 1982, Volume 29 
(0)

1982 