default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Jerrum
Mark Richard Jerrum
Person information
- affiliation: Queen Mary University of London, UK
- award (1996): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i53]Mark Jerrum:
Glauber dynamics for the hard-core model on bounded-degree H-free graphs. CoRR abs/2404.07615 (2024)- [i52]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang:
Rapid mixing of the flip chain over non-crossing spanning trees. CoRR abs/2409.07892 (2024) - 2023
- [j82]Heng Guo, Mark Jerrum
:
Counting Vertices of Integral Polytopes Defined by Facets. Discret. Comput. Geom. 70(3): 975-990 (2023) - [j81]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS 2 (2023) - [c50]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA 2023: 343-347 - [i51]Konrad Anand, Mark Jerrum:
Perfect Sampling of q-Spin Systems on ℤ2 via Weak Spatial Mixing. CoRR abs/2302.07821 (2023) - 2022
- [j80]Konrad Anand, Mark Jerrum:
Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing. SIAM J. Comput. 51(3): 1280-1295 (2022) - [i50]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for total variation distances between product distributions. CoRR abs/2208.00740 (2022) - [i49]Holger Dell, Mark Richard Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik:
Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). Dagstuhl Reports 12(11): 124-145 (2022) - 2021
- [j79]Mark Jerrum, Tamás Makai:
The Size of the Giant Joint Component in a Binomial Random Double Graph. Electron. J. Comb. 28(1): 1 (2021) - [j78]Heng Guo, Mark Jerrum:
Approximately counting bases of bicircular matroids. Comb. Probab. Comput. 30(1): 124-135 (2021) - [j77]Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller:
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. 30(6): 905-921 (2021) - [j76]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. 35(2): 1503-1524 (2021) - [i48]Heng Guo, Mark Jerrum:
Counting vertices of integer polytopes defined by facets. CoRR abs/2105.01469 (2021) - [i47]Mark Jerrum:
Fundamentals of Partial Rejection Sampling. CoRR abs/2106.07744 (2021) - [i46]Konrad Anand, Mark Jerrum:
Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing. CoRR abs/2106.15992 (2021) - 2020
- [j75]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. ACM Trans. Algorithms 16(3): 37:1-37:33 (2020) - [i45]Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller:
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR abs/2005.07944 (2020)
2010 – 2019
- 2019
- [j74]Heng Guo, Mark Jerrum, Jingcheng Liu:
Uniform Sampling Through the Lovász Local Lemma. J. ACM 66(3): 18:1-18:31 (2019) - [j73]Heng Guo, Mark Jerrum:
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. SIAM J. Comput. 48(3): 964-978 (2019) - [j72]Leslie Ann Goldberg, Mark Jerrum:
Approximating Pairwise Correlations in the Ising Model. ACM Trans. Comput. Theory 11(4): 23:1-23:20 (2019) - [i44]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting weighted independent sets beyond the permanent. CoRR abs/1909.03414 (2019) - 2018
- [c49]Heng Guo, Mark Jerrum:
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. ICALP 2018: 68:1-68:12 - [c48]Heng Guo, Mark Jerrum:
Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. ICALP 2018: 69:1-69:10 - [i43]Heng Guo, Mark Jerrum:
Perfect simulation of the Hard Disks Model by Partial Rejection Sampling. CoRR abs/1801.07342 (2018) - [i42]Heng Guo, Mark Jerrum:
Approximately counting bases of bicircular matroids. CoRR abs/1808.09548 (2018) - [i41]Leslie Ann Goldberg, Mark Jerrum:
Approximating Pairwise Correlations in the Ising Model. CoRR abs/1810.05830 (2018) - 2017
- [j71]Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting even and odd induced subgraphs. Comb. 37(5): 965-990 (2017) - [j70]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the Switch Markov Chain for Perfect Matchings. J. ACM 64(2): 12:1-12:33 (2017) - [j69]Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný:
Functional clones and expressibility of partition functions. Theor. Comput. Sci. 687: 11-39 (2017) - [j68]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colorings. ACM Trans. Comput. Theory 9(2): 9:1-9:22 (2017) - [c47]Heng Guo, Mark Jerrum:
Random cluster dynamics for the Ising model is rapidly mixing. SODA 2017: 1818-1827 - [c46]Heng Guo, Mark Jerrum, Jingcheng Liu:
Uniform sampling through the Lovasz local lemma. STOC 2017: 342-355 - [p1]Mark Jerrum:
Counting Constraint Satisfaction Problems. The Constraint Satisfaction Problem 2017: 205-231 - [i40]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. CoRR abs/1707.02467 (2017) - [i39]Heng Guo, Mark Jerrum:
A simple FPRAS for bi-directed reachability. CoRR abs/1709.08561 (2017) - [i38]Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum:
Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports 7(8): 23-44 (2017) - 2016
- [j67]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5): 690-711 (2016) - [j66]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. 45(3): 680-711 (2016) - [j65]Leslie Ann Goldberg, Mark Jerrum:
The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. 634: 35-46 (2016) - [c45]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colourings. ICALP 2016: 46:1-46:13 - [c44]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the switch Markov chain for perfect matchings. SODA 2016: 1972-1983 - [i37]Leslie Ann Goldberg, Mark Jerrum:
A complexity trichotomy for approximately counting list H-colourings. CoRR abs/1602.03985 (2016) - [i36]Heng Guo, Mark Jerrum:
Random cluster dynamics for the Ising model is rapidly mixing. CoRR abs/1605.00139 (2016) - [i35]Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný:
Functional Clones and Expressibility of Partition Functions. CoRR abs/1609.07377 (2016) - [i34]Heng Guo, Mark Jerrum, Jingcheng Liu:
Uniform Sampling through the Lovász Local Lemma. CoRR abs/1611.01647 (2016) - 2015
- [j64]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81(1): 311-329 (2015) - [j63]Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
Approximating the partition function of planar two-state spin systems. J. Comput. Syst. Sci. 81(1): 330-358 (2015) - [j62]Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. 81(4): 702-716 (2015) - [j61]Leslie Ann Goldberg, Mark Jerrum:
A complexity classification of spin systems with an external field. Proc. Natl. Acad. Sci. USA 112(43): 13161-13166 (2015) - [j60]John D. Faben, Mark Jerrum:
The Complexity of Parity Graph Homomorphism: An Initial Investigation. Theory Comput. 11: 35-57 (2015) - [j59]Mark Jerrum, Kitty Meeks:
Some Hard Families of Parameterized Counting Problems. ACM Trans. Comput. Theory 7(3): 11:1-11:18 (2015) - [c43]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. ICALP (1) 2015: 529-541 - [i33]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the switch Markov chain for perfect matchings. CoRR abs/1501.07725 (2015) - [i32]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #BIS-Hard. CoRR abs/1502.01335 (2015) - [i31]Leslie Ann Goldberg, Mark Jerrum:
The complexity of Boolean #MaximalCSP. CoRR abs/1509.03543 (2015) - 2014
- [j58]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial. SIAM J. Comput. 43(6): 1921-1952 (2014) - [j57]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Approximately Counting Tree Homomorphisms. ACM Trans. Comput. Theory 6(2): 8:1-8:31 (2014) - [c42]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM 2014: 582-595 - [i30]Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting even and odd induced subgraphs. CoRR abs/1410.3375 (2014) - 2013
- [j56]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM 60(5): 32:1-32:36 (2013) - [j55]Leslie Ann Goldberg, Mark Jerrum:
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. J. Comput. Syst. Sci. 79(1): 68-78 (2013) - [j54]Leslie Ann Goldberg, Mark Jerrum:
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. SIAM J. Comput. 42(3): 1132-1157 (2013) - [c41]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - [i29]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Approximately Counting Tree Homomorphisms. CoRR abs/1305.6306 (2013) - [i28]Mark Jerrum, Kitty Meeks:
The Parameterised Complexity of Counting Connected Subgraphs. CoRR abs/1308.1575 (2013) - [i27]John D. Faben, Mark Jerrum:
The complexity of parity graph homomorphism: an initial investigation. CoRR abs/1309.4033 (2013) - [i26]Mark Jerrum, Kitty Meeks:
Some hard classes of parameterised counting problems. CoRR abs/1310.6524 (2013) - [i25]Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum:
Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR abs/1311.4451 (2013) - [i24]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran:
Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports 3(1): 47-66 (2013) - 2012
- [j53]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial of a planar graph. Comput. Complex. 21(4): 605-642 (2012) - [j52]Leslie Ann Goldberg, Mark Jerrum:
Approximating the partition function of the ferromagnetic potts model. J. ACM 59(5): 25:1-25:31 (2012) - [j51]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2): 681-688 (2012) - [c40]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). ICALP (1) 2012: 399-410 - [c39]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313 - [i23]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation). CoRR abs/1202.0313 (2012) - [i22]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) - [i21]Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
Approximating the partition function of planar two-state spin systems. CoRR abs/1208.4987 (2012) - 2011
- [c38]Leslie Ann Goldberg, Mark Jerrum:
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. ICALP (1) 2011: 521-532 - [i20]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. CoRR abs/1108.5288 (2011) - [i19]Leslie Ann Goldberg, Mark Jerrum:
A Counterexample to rapid mixing of the Ge-Stefankovic Process. CoRR abs/1109.5242 (2011) - 2010
- [j50]Mark Jerrum:
Constraint satisfaction problems and computational complexity: technical persepctive. Commun. ACM 53(9): 98 (2010) - [j49]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. 19(4): 605-633 (2010) - [j48]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76(3-4): 267-277 (2010) - [j47]Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski:
The mixing time of Glauber dynamics for coloring regular trees. Random Struct. Algorithms 36(4): 464-476 (2010) - [j46]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. 39(7): 3336-3402 (2010) - [c37]Leslie Ann Goldberg, Mark Jerrum:
Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) 2010: 396-407 - [e3]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
Computational Counting, 28.11. - 03.12.2010. Dagstuhl Seminar Proceedings 10481, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i18]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
10481 Abstracts Collection - Computational Counting. Computational Counting 2010 - [i17]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
10481 Executive Summary - Computational Counting. Computational Counting 2010 - [i16]Leslie Ann Goldberg, Mark Jerrum:
Approximating the partition function of the ferromagnetic Potts model. CoRR abs/1002.0986 (2010) - [i15]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. CoRR abs/1005.2678 (2010) - [i14]Leslie Ann Goldberg, Mark Jerrum:
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. CoRR abs/1006.5234 (2010) - [i13]Leslie Ann Goldberg, Mark Jerrum:
A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid. CoRR abs/1010.6231 (2010)
2000 – 2009
- 2009
- [j45]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. SIAM J. Comput. 38(5): 1970-1986 (2009) - [c36]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504 - [i12]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial of a planar graph. CoRR abs/0907.1724 (2009) - 2008
- [j44]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. 17(6): 761-779 (2008) - [j43]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial. Inf. Comput. 206(7): 908-929 (2008) - [e2]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008. Dagstuhl Seminar Proceedings 08201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i11]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms 2008 - [i10]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A complexity dichotomy for partition functions with mixed signs. CoRR abs/0804.1932 (2008) - [i9]Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski:
The Mixing Time of Glauber Dynamics for Colouring Regular Trees. CoRR abs/0806.0921 (2008) - [i8]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A complexity dichotomy for hypergraph partition functions. CoRR abs/0811.0037 (2008) - 2007
- [j42]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Ferromagnetic Ising with Local Fields. Comb. Probab. Comput. 16(1): 43-61 (2007) - [c35]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial. STOC 2007: 459-468 - [i7]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. CoRR abs/0704.3683 (2007) - [i6]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. CoRR abs/0710.4272 (2007) - [i5]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Matrix norms and rapid mixing for spin systems. CoRR abs/math/0702744 (2007) - 2006
- [j41]Mark Jerrum:
Two Remarks Concerning Balanced Matroids. Comb. 26(6): 733-742 (2006) - [j40]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. SIAM J. Comput. 36(1): 247-278 (2006) - [c34]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. APPROX-RANDOM 2006: 327-338 - [i4]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial. CoRR abs/cs/0605140 (2006) - 2005
- [e1]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005. Dagstuhl Seminar Proceedings 05201, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 [contents] - [i3]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms 2005 - [i2]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin conditions and Systematic Scan. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j39]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2004) - [j38]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and sampling H-colourings? Inf. Comput. 189(1): 1-16 (2004) - [j37]Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4): 671-697 (2004) - [j36]Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson:
A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. 33(2): 313-331 (2004) - 2003
- [j35]Leslie Ann Goldberg, Mark Jerrum, Mike Paterson:
The computational complexity of two-state spin systems. Random Struct. Algorithms 23(2): 133-154 (2003) - 2002
- [j34]Leslie Ann Goldberg, Mark Jerrum:
The "Burnside Process" Converges Slowly. Comb. Probab. Comput. 11(1): 21-34 (2002) - [j33]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum:
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11(2): 135-147 (2002) - [j32]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. 31(5): 1527-1541 (2002) - [c33]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. FOCS 2002: 711-720 - [c32]Mark Jerrum, Jung-Bae Son:
Spectral Gap and log-Sobolev Constant for Balanced Matroids. FOCS 2002: 721- - [c31]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and Sampling H-Colourings. RANDOM 2002: 51-67 - [c30]Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. RANDOM 2002: 68-77 - 2001
- [c29]Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. Graphs, Morphisms and Statistical Physics 2001: 87-95 - [c28]Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. STOC 2001: 712-721 - 2000
- [j31]Leslie Ann Goldberg, Mark Jerrum:
Counting Unlabelled Subtrees of a Tree is #P-complete. LMS J. Comput. Math. 3: 117-124 (2000) - [j30]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. 30(6): 1962-1975 (2000) - [c27]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
On the relative complexity of approximate counting problems. APPROX 2000: 108-119 - [c26]Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson:
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716 - [c25]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). SODA 2000: 616-624 - [i1]Mark Jerrum, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j29]Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum:
On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. 29(2): 387-400 (1999) - [j28]Leslie Ann Goldberg, Mark Jerrum:
Randomly Sampling Molecules. SIAM J. Comput. 29(3): 834-853 (1999) - [c24]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
On Counting Independent Sets in Sparse Graphs. FOCS 1999: 210-217 - [c23]Yoram Hirshfeld, Mark Jerrum:
Bisimulation Equivanlence Is Decidable for Normed Process Algebra. ICALP 1999: 412-421 - 1998
- [j27]Mark Jerrum, Gregory B. Sorkin:
The Metropolis Algorithm for Graph Bisection. Discret. Appl. Math. 82(1-3): 155-175 (1998) - [j26]Russ Bubley, Martin E. Dyer, Mark Jerrum:
An elementary analysis of a procedure for sampling points in a convex body. Random Struct. Algorithms 12(3): 213-235 (1998) - [j25]Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. 27(4): 1083-1098 (1998) - [j24]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. 27(5): 1262-1272 (1998) - [c22]Leslie Ann Goldberg, Mark Jerrum:
The "Burnside Process" Converges Slowly. RANDOM 1998: 331-345 - 1997
- [j23]Alan M. Frieze, Mark Jerrum:
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1): 67-81 (1997) - [j22]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. 134(1): 59-74 (1997) - [j21]Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao:
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. 26(4): 1100-1119 (1997) - [c21]Leslie Ann Goldberg, Mark Jerrum:
Randomly Sampling Molecules. SODA 1997: 183-192 - [c20]Vivek Gore, Mark Jerrum:
The Swendsen-Wang Process Does Not Always Mix Rapidly. STOC 1997: 674-681 - 1996
- [j20]Mark Jerrum, Umesh V. Vazirani:
A Mildly Exponential Approximation Algorithm for the Permanent. Algorithmica 16(4/5): 392-401 (1996) - [j19]Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald:
Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms 21(1): 176-198 (1996) - [j18]Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. Math. Struct. Comput. Sci. 6(3): 251-259 (1996) - [j17]Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. 158(1&2): 143-159 (1996) - [c19]Alan M. Frieze, Mark Jerrum, Ravi Kannan:
Learning Linear Transformations. FOCS 1996: 359-368 - 1995
- [j16]Alan M. Frieze, Mark Jerrum:
An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. Comb. 15(1): 67-83 (1995) - [j15]Paul W. Goldberg, Mark Jerrum:
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. Mach. Learn. 18(2-3): 131-148 (1995) - [j14]Mark Jerrum:
A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. Random Struct. Algorithms 7(2): 157-166 (1995) - [c18]Alan M. Frieze, Mark Jerrum:
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. IPCO 1995: 1-13 - 1994
- [j13]Mark Jerrum:
Simple Translation-Invariant Concepts Are Hard to Learn. Inf. Comput. 113(2): 300-311 (1994) - [j12]Mark Jerrum:
Counting Trees in a Graph is #P-Complete. Inf. Process. Lett. 51(3): 111-116 (1994) - [j11]Robert W. Irving, Mark Jerrum:
Three-Dimensional Statistical Data Security Problems. SIAM J. Comput. 23(1): 170-184 (1994) - [c17]Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes. FOCS 1994: 623-631 - [c16]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
Approximately Counting Hamilton Cycles in Dense Graphs. SODA 1994: 336-343 - [c15]Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156 - 1993
- [j10]Mark Jerrum, Alistair Sinclair:
Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. 22(5): 1087-1116 (1993) - [c14]Paul Goldberg, Mark Jerrum:
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. COLT 1993: 361-369 - [c13]Mark Jerrum, Gregory B. Sorkin:
Simulated Annealing for Graph Bisection. FOCS 1993: 94-103 - [c12]Mark Jerrum:
An analysis of a Monte Carlo algorithm for estimating the permanent. IPCO 1993: 171-182 - [c11]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: 300-309 - 1992
- [j9]Mark Jerrum:
Large Cliques Elude the Metropolis Process. Random Struct. Algorithms 3(4): 347-360 (1992) - [c10]Mark Jerrum:
Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation. Expanding Graphs 1992: 37-47 - [c9]Mark Jerrum, Umesh V. Vazirani:
A Mildly Exponential Approximation Algorithm for the Permanent. FOCS 1992: 320-326 - 1990
- [j8]Mark Jerrum, Alistair Sinclair:
Fast Uniform Generation of Regular Graphs. Theor. Comput. Sci. 73(1): 91-100 (1990) - [c8]Mark Jerrum, Alistair Sinclair:
Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). ICALP 1990: 462-475
1980 – 1989
- 1989
- [j7]Alistair Sinclair, Mark Jerrum:
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. Inf. Comput. 82(1): 93-133 (1989) - [j6]Mark Jerrum, Alistair Sinclair:
Approximating the Permanent. SIAM J. Comput. 18(6): 1149-1178 (1989) - 1988
- [c7]Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum:
On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry 1988: 55-70 - [c6]Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling:
On Continuous Homotopic One Layer Routing. SCG 1988: 392-402 - [c5]Mark Jerrum, Alistair Sinclair:
Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version). STOC 1988: 235-244 - 1987
- [c4]Alistair Sinclair, Mark Jerrum:
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. WG 1987: 134-148 - 1986
- [j5]Mark Jerrum:
A Compact Representation for Permutation Groups. J. Algorithms 7(1): 60-78 (1986) - [j4]Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani:
Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169-188 (1986) - 1985
- [j3]Mark Jerrum:
The Complexity of Finding Minimum-Length Generator Sequences. Theor. Comput. Sci. 36: 265-289 (1985) - [c3]Mark Jerrum:
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). ICALP 1985: 290-299 - 1984
- [j2]Mark Jerrum, Sven Skyum:
Families of Fixed Degree Graphs for Processor Interconnection. IEEE Trans. Computers 33(2): 190-194 (1984) - [c2]Mark Jerrum:
The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract). ICALP 1984: 270-280 - 1982
- [j1]Mark Jerrum, Marc Snir:
Some Exact Complexity Results for Straight-Line Computations over Semirings. J. ACM 29(3): 874-897 (1982) - [c1]Mark Jerrum:
A Compact Representation for Permutation Groups. FOCS 1982: 126-133
Coauthor Index
[j75] [j72] [i41] [j69] [j68] [i40] [i38] [j67] [j66] [j65] [c45] [i37] [i35] [j64] [j63] [j61] [c43] [i32] [i31] [j58] [j57] [c42] [j56] [j55] [j54] [c41] [i29] [i25] [i24] [j53] [j52] [j51] [c40] [c39] [i23] [i22] [i21] [c38] [i20] [i19] [j49] [j48] [j47] [j46] [c37] [e3] [i18] [i17] [i16] [i15] [i14] [i13] [j45] [c36] [i12] [j44] [j43] [i10] [i9] [i8] [j42] [c35] [i7] [i6] [i5] [j40] [c34] [i4] [i2] [j39] [j38] [j36] [j35] [j34] [j33] [c33] [c31] [j31] [j30] [c27] [c26] [c25] [j28] [j25] [c22] [j21] [c21] [c15] [c11]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
