Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Mark
    Last name: Jerrum
    DBLP: j/MarkJerrum
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 101 to 155 of 155  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Mark Jerrum, Eric Vigoda.
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
    Electronic Colloquium on Computational Complexity (ECCC) 2000, Volume 7 (0) 2000
    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 11-15, 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 8-10, 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 Swendsen-Wang Process Does Not Always Mix Rapidly.
    STOC 1997 (0) 1997
    Conference paper
    Alan M. Frieze, Mark Jerrum.
    Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.
    Algorithmica 1997, Volume 18 (0) 1997
    Conference paper
    Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney.
    A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free 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 Optical-Communication 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 Polynomial-Time 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 Context-Free 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 29-31, 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 Vapnik-Chervonenkis 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 k-Colorings of a Low-Degree Graph.
    Random Struct. Algorithms 1995, Volume 7 (0) 1995
    Conference paper
    Yoram Hirshfeld, Mark Jerrum, Faron Moller.
    A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
    35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 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 Translation-Invariant Concepts Are Hard to Learn
    Inf. Comput. 1994, Volume 113 (0) 1994
    Conference paper
    Mark Jerrum.
    Counting Trees in a Graph is #P-Complete.
    Inf. Process. Lett. 1994, Volume 51 (0) 1994
    Conference paper
    Robert W. Irving, Mark Jerrum.
    Three-Dimensional 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 Vapnik-Chervonenkis 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, 3-5 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.
    Polynomial-Time 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 11-14, 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, 24-27 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.
    Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract).
    Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 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 24-25, 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 2-4, 1988, Chicago, Illinois, USA 1988 (0) 1988
    Conference paper
    Alistair Sinclair, Mark Jerrum.
    Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains.
    Graph-Theoretic 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 15-19, 1985, Proceedings 1985 (0) 1985
    Conference paper
    Mark Jerrum.
    The Complexity of Finding Minimum-Length Generator Sequences.
    Theor. Comput. Sci. 1985, Volume 36 (0) 1985
    Conference paper
    Mark Jerrum.
    The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract).
    Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 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, 3-5 November 1982 1982 (0) 1982
    Conference paper
    Mark Jerrum, Marc Snir.
    Some Exact Complexity Results for Straight-Line Computations over Semirings.
    J. ACM 1982, Volume 29 (0) 1982
    Show item 101 to 155 of 155  

    Your query returned 155 matches in the database.