The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Mark Jerrum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alistair Sinclair, Mark Jerrum
    Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:1, pp:93-133 [Journal]
  2. Paul W. Goldberg, Mark Jerrum
    Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. [Citation Graph (1, 0)][DBLP]
    Machine Learning, 1995, v:18, n:2-3, pp:131-148 [Journal]
  3. Mark Jerrum, Alistair Sinclair
    Approximating the Permanent. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:6, pp:1149-1178 [Journal]
  4. Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
    Random Generation of Combinatorial Structures from a Uniform Distribution. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:169-188 [Journal]
  5. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
    On the relative complexity of approximate counting problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:108-119 [Conf]
  6. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Dobrushin Conditions and Systematic Scan. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:327-338 [Conf]
  7. Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1988, pp:55-70 [Conf]
  8. Paul W. Goldberg, Mark Jerrum
    Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:361-369 [Conf]
  9. Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:392-402 [Conf]
  10. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
    Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:711-720 [Conf]
  11. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:210-217 [Conf]
  12. Alan M. Frieze, Mark Jerrum, Ravi Kannan
    Learning Linear Transformations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:359-368 [Conf]
  13. Yoram Hirshfeld, Mark Jerrum, Faron Moller
    A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:623-631 [Conf]
  14. Mark Jerrum
    A Compact Representation for Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:126-133 [Conf]
  15. Mark Jerrum, Jung-Bae Son
    Spectral Gap and log-Sobolev Constant for Balanced Matroids. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:721-0 [Conf]
  16. Mark Jerrum, Gregory B. Sorkin
    Simulated Annealing for Graph Bisection [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:94-103 [Conf]
  17. Mark Jerrum, Umesh V. Vazirani
    A Mildly Exponential Approximation Algorithm for the Permanent [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:320-326 [Conf]
  18. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:705-716 [Conf]
  19. Yoram Hirshfeld, Mark Jerrum
    Bisimulation Equivanlence Is Decidable for Normed Process Algebra. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:412-421 [Conf]
  20. Mark Jerrum
    The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:270-280 [Conf]
  21. Mark Jerrum
    Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:290-299 [Conf]
  22. Mark Jerrum, Alistair Sinclair
    Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:462-475 [Conf]
  23. Alan M. Frieze, Mark Jerrum
    Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:1-13 [Conf]
  24. Mark Jerrum
    An analysis of a Monte Carlo algorithm for estimating the permanent. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:171-182 [Conf]
  25. Leslie Ann Goldberg, Mark Jerrum
    The "Burnside Process" Converges Slowly. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:331-345 [Conf]
  26. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Counting and Sampling H-Colourings. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:51-67 [Conf]
  27. Martin E. Dyer, Mark Jerrum, Eric Vigoda
    Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:68-77 [Conf]
  28. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:336-343 [Conf]
  29. 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 colourings (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:616-624 [Conf]
  30. Leslie Ann Goldberg, Mark Jerrum
    Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:183-192 [Conf]
  31. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
    A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:300-309 [Conf]
  32. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
    An W(log log n) Lower Bound for Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:147-156 [Conf]
  33. Vivek Gore, Mark Jerrum
    The Swendsen-Wang Process Does Not Always Mix Rapidly. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:674-681 [Conf]
  34. Mark Jerrum, Alistair Sinclair
    Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:235-244 [Conf]
  35. Mark Jerrum, Alistair Sinclair, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:712-721 [Conf]
  36. Alistair Sinclair, Mark Jerrum
    Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. [Citation Graph (0, 0)][DBLP]
    WG, 1987, pp:134-148 [Conf]
  37. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
    The Relative Complexity of Approximate Counting Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:471-500 [Journal]
  38. Alan M. Frieze, Mark Jerrum
    Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:67-81 [Journal]
  39. Mark Jerrum, Umesh V. Vazirani
    A Mildly Exponential Approximation Algorithm for the Permanent. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:392-401 [Journal]
  40. Alan M. Frieze, Mark Jerrum
    An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:67-83 [Journal]
  41. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
    Convergence Of The Iterated Prisoner's Dilemma Game [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  42. Leslie Ann Goldberg, Mark Jerrum
    The "Burnside Process" Converges Slowly [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:1, pp:- [Journal]
  43. Mark Jerrum, Gregory B. Sorkin
    The Metropolis Algorithm for Graph Bisection. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:155-175 [Journal]
  44. Mark Jerrum, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:79, pp:- [Journal]
  45. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Dobrushin conditions and Systematic Scan [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:075, pp:- [Journal]
  46. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Counting and sampling H-colourings? [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:1, pp:1-16 [Journal]
  47. Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
    A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:134, n:1, pp:59-74 [Journal]
  48. Mark Jerrum
    Simple Translation-Invariant Concepts Are Hard to Learn [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:113, n:2, pp:300-311 [Journal]
  49. Mark Jerrum
    Counting Trees in a Graph is #P-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:3, pp:111-116 [Journal]
  50. Mark Jerrum, Marc Snir
    Some Exact Complexity Results for Straight-Line Computations over Semirings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:874-897 [Journal]
  51. Mark Jerrum, Alistair Sinclair, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:671-697 [Journal]
  52. Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
    Generating and Counting Hamilton Cycles in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:176-198 [Journal]
  53. Mark Jerrum
    A Compact Representation for Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:60-78 [Journal]
  54. Yoram Hirshfeld, Mark Jerrum, Faron Moller
    A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:3, pp:251-259 [Journal]
  55. Russ Bubley, Martin E. Dyer, Mark Jerrum
    An elementary analysis of a procedure for sampling points in a convex body. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:213-235 [Journal]
  56. Leslie Ann Goldberg, Mark Jerrum, Mike Paterson
    The computational complexity of two-state spin systems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:2, pp:133-154 [Journal]
  57. Mark Jerrum
    Large Cliques Elude the Metropolis Process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:4, pp:347-360 [Journal]
  58. Mark Jerrum
    A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:2, pp:157-166 [Journal]
  59. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
    On Approximately Counting Colorings of Small Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:387-400 [Journal]
  60. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1527-1541 [Journal]
  61. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Paths and Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1262-1272 [Journal]
  62. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1962-1975 [Journal]
  63. Leslie Ann Goldberg, Mark Jerrum
    Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:834-853 [Journal]
  64. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A bound on the capacity of backoff and acknowledgment-based protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:313-331 [Journal]
  65. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
    Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1100-1119 [Journal]
  66. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
    An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1083-1098 [Journal]
  67. Robert W. Irving, Mark Jerrum
    Three-Dimensional Statistical Data Security Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:170-184 [Journal]
  68. Mark Jerrum, Alistair Sinclair
    Polynomial-Time Approximation Algorithms for the Ising Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1087-1116 [Journal]
  69. Mark Jerrum, Sven Skyum
    Families of Fixed Degree Graphs for Processor Interconnection. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:2, pp:190-194 [Journal]
  70. Yoram Hirshfeld, Mark Jerrum, Faron Moller
    A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:143-159 [Journal]
  71. Mark Jerrum
    The Complexity of Finding Minimum-Length Generator Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:265-289 [Journal]
  72. Mark Jerrum, Alistair Sinclair
    Fast Uniform Generation of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:1, pp:91-100 [Journal]
  73. Leslie Ann Goldberg, Mark Jerrum
    Inapproximability of the Tutte polynomial. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:459-468 [Conf]
  74. Mark Jerrum
    Two Remarks Concerning Balanced Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:6, pp:733-742 [Journal]
  75. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Matrix norms and rapid mixing for spin systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  76. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    The Complexity of Weighted Boolean #CSP [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  77. Leslie Ann Goldberg, Mark Jerrum
    Inapproximability of the Tutte polynomial [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  78. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    An approximation trichotomy for Boolean #CSP [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  79. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
    Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:247-278 [Journal]

  80. Approximating the Partition Function of the Ferromagnetic Potts Model. [Citation Graph (, )][DBLP]


  81. A Complexity Dichotomy for Partition Functions with Mixed Signs. [Citation Graph (, )][DBLP]


  82. A complexity dichotomy for partition functions with mixed signs [Citation Graph (, )][DBLP]


  83. The Mixing Time of Glauber Dynamics for Colouring Regular Trees [Citation Graph (, )][DBLP]


  84. A complexity dichotomy for hypergraph partition functions [Citation Graph (, )][DBLP]


  85. Inapproximability of the Tutte polynomial of a planar graph [Citation Graph (, )][DBLP]


  86. Approximating the partition function of the ferromagnetic Potts model [Citation Graph (, )][DBLP]


  87. The complexity of weighted and unweighted #CSP [Citation Graph (, )][DBLP]


  88. Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials [Citation Graph (, )][DBLP]


  89. The Complexity of Ferromagnetic Ising with Local Fields. [Citation Graph (, )][DBLP]


  90. Dobrushin Conditions and Systematic Scan. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002