Leslie Ann Goldberg

305 papers A* 45A 14B 11Journal 205Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Planting and MCMC Sampling from the Potts Model. STACS Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2026	J	`jnl`	The Instability of all Backoff Protocols. CoRR Leslie Ann Goldberg, John Lapinskas
2025	J	`jnl`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. ACM Trans. Algorithms Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2025	J	`jnl`	Instability of backoff protocols with arbitrary arrival rates. J. Comput. Syst. Sci. Leslie Ann Goldberg, John Lapinskas
2025	A*	`conf`	Low-Temperature Sampling on Sparse Random Graphs. ICALP Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2025	J	`jnl`	Low-temperature Sampling on Sparse Random Graphs. CoRR Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2025	A*	`conf`	One-Shot Learning for k-SAT. ICALP Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang
2025	J	`jnl`	One-Shot Learning for k-SAT. CoRR Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang
2025	J	`jnl`	One-shot learning for k-SAT. Inf. Comput. Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang
2025	J	`jnl`	Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. Comb. Probab. Comput. Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2025	J	`jnl`	Simulating Gaussian boson sampling on graphs in polynomial time. CoRR Konrad Anand, Zongchen Chen, Mary Cryan, Graham Freifeld, Leslie Ann Goldberg, Heng Guo, Xinyuan Zhang
2025	J	`jnl`	Two-state spin systems with negative interactions. Inf. Comput. Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
2024	J	`jnl`	Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. Proc. ACM Manag. Data Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2024	J	`jnl`	Counting Subgraphs in Somewhere Dense Graphs. SIAM J. Comput. Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2024	J	`jnl`	Fast Sampling of Satisfying Assignments from Random $\boldsymbol{k}$-SAT with Applications to Connectivity. SIAM J. Discret. Math. Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra
2024	J	`jnl`	Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2024	J	`jnl`	Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Algorithmica Leslie Ann Goldberg, Marc Roth
2024	J	`jnl`	Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process. Theor. Comput. Sci. Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz
2024	J	`jnl`	Planting and MCMC Sampling from the Potts model. CoRR Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2024	J	`jnl`	The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data Andreas Göbel, Leslie Ann Goldberg, Marc Roth
2024	A	`conf`	Two-State Spin Systems with Negative Interactions. ITCS Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
2023	J	`jnl`	Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2023	A	`conf`	Counting Subgraphs in Somewhere Dense Graphs. ITCS Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2023	A*	`conf`	Graph Ranking and the Cost of Sybil Defense. EC Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro
2023	J	`jnl`	Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2023	A*	`conf`	Instability of backoff protocols with arbitrary arrival rates. SODA Leslie Ann Goldberg, John Lapinskas
2023	J	`jnl`	Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process. CoRR Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz
2023	A*	`conf`	Parameterised and Fine-Grained Subgraph Counting, Modulo 2. ICALP Leslie Ann Goldberg, Marc Roth
2023	J	`jnl`	Parameterised and Fine-grained Subgraph Counting, modulo 2. CoRR Leslie Ann Goldberg, Marc Roth
2023	A	`conf`	Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics. APPROX/RANDOM Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2023	J	`jnl`	Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. CoRR Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
2023	J	`jnl`	The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR Andreas Göbel, Leslie Ann Goldberg, Marc Roth
2023	J	`jnl`	Two-State Spin Systems with Negative Interactions. CoRR Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
2022	A*	`conf`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2022	J	`jnl`	Counting Subgraphs in Somewhere Dense Graphs. CoRR Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2022	A*	`conf`	Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2022	J	`jnl`	Fast mixing via polymers for random graphs with unbounded degree. Inf. Comput. Andreas Galanis, Leslie Ann Goldberg, James Stewart
2022	J	`jnl`	Fast sampling of satisfying assignments from random k-SAT. CoRR Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos
2022	J	`jnl`	Instability of backoff protocols with arbitrary arrival rates. CoRR Leslie Ann Goldberg, John Lapinskas
2022	A*	`conf`	Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
2022	J	`jnl`	Metastability of the Potts ferromagnet on random regular graphs. CoRR Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
2022	A*	`conf`	Some New (And Old) Results on Contention Resolution (Invited Talk). ICALP Leslie Ann Goldberg
2022	J	`jnl`	The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs. SIAM J. Discret. Math. Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
2022	J	`jnl`	The complexity of approximating the complex-valued Potts model. Comput. Complex. Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
2021	J	`jnl`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	—	`conf`	Approximately Counting Graph Homomorphisms and Retractions (Invited Talk). FSTTCS Leslie Ann Goldberg
2021	J	`jnl`	Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. J. Comput. Syst. Sci. Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
2021	A*	`conf`	Counting Homomorphisms to SODA Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	J	`jnl`	Counting Homomorphisms to K SIAM J. Discret. Math. Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	J	`jnl`	Counting Solutions to Random CNF Formulas. SIAM J. Comput. Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
2021	J	`jnl`	Fast Algorithms for General Spin Systems on Bipartite Expanders. ACM Trans. Comput. Theory Andreas Galanis, Leslie Ann Goldberg, James Stewart
2021	—	`conf`	Fast Mixing via Polymers for Random Graphs with Unbounded Degree. APPROX-RANDOM Andreas Galanis, Leslie Ann Goldberg, James Stewart
2021	J	`jnl`	Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
2021	J	`jnl`	Fast mixing via polymers for random graphs with unbounded degree. CoRR Andreas Galanis, Leslie Ann Goldberg, James Stewart
2021	J	`jnl`	Fast sampling via spectral independence beyond bounded-degree graphs. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2021	J	`jnl`	Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. Leslie Ann Goldberg, John Lapinskas, David Richerby
2021	J	`jnl`	The Complexity of Approximately Counting Retractions to Square-free Graphs. ACM Trans. Algorithms Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2021	J	`jnl`	The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2021	J	`jnl`	The complexity of approximating the complex-valued Ising model on bounded degree graphs. CoRR Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
2020	J	`jnl`	Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. J. Comput. Syst. Sci. Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
2020	J	`jnl`	Counting Homomorphisms to K CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2020	A*	`conf`	Counting Solutions to Random CNF Formulas. ICALP Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
2020	B	`conf`	Fast Algorithms for General Spin Systems on Bipartite Expanders. MFCS Andreas Galanis, Leslie Ann Goldberg, James Stewart
2020	J	`jnl`	Fast algorithms for general spin systems on bipartite expanders. CoRR Andreas Galanis, Leslie Ann Goldberg, James Stewart
2020	J	`jnl`	Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR Leslie Ann Goldberg, John Lapinskas, David Richerby
2020	J	`jnl`	Holant Clones and the Approximability of Conservative Holant Problems. ACM Trans. Algorithms Miriam Backens, Leslie Ann Goldberg
2020	J	`jnl`	Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2020	J	`jnl`	Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms Leslie Ann Goldberg, John Lapinskas, David Richerby
2020	J	`jnl`	Random Walks on Small World Networks. ACM Trans. Algorithms Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
2020	J	`jnl`	Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. SIAM J. Discret. Math. Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
2020	J	`jnl`	The Complexity of Approximately Counting Retractions. ACM Trans. Comput. Theory Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2020	B	`conf`	The Complexity of Approximating the Complex-Valued Potts Model. MFCS Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
2020	J	`jnl`	The complexity of approximating the complex-valued Potts model. CoRR Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
2019	J	`jnl`	A Fixed-Parameter Perspective on #BIS. Algorithmica Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2019	J	`jnl`	A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. CoRR Andreas Galanis, Leslie Ann Goldberg, James Stewart
2019	J	`jnl`	Approximating Pairwise Correlations in the Ising Model. ACM Trans. Comput. Theory Leslie Ann Goldberg, Mark Jerrum
2019	J	`jnl`	Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
2019	J	`jnl`	Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister
2019	A	`conf`	Computational Complexity and Partition Functions (Invited Talk). STACS Leslie Ann Goldberg
2019	J	`jnl`	Counting solutions to random CNF formulas. CoRR Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
2019	—	`conf`	Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
2019	J	`jnl`	The Complexity of Approximately Counting Retractions to Square-Free Graphs. CoRR Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2019	A*	`conf`	The Complexity of Approximately Counting Retractions. SODA Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2019	A*	`conf`	The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2019	J	`jnl`	The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J. Discret. Math. Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2018	J	`jnl`	Approximating Pairwise Correlations in the Ising Model. CoRR Leslie Ann Goldberg, Mark Jerrum
2018	J	`jnl`	Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. CoRR Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
2018	J	`jnl`	Holant clones and the approximability of conservative holant problems. CoRR Miriam Backens, Leslie Ann Goldberg
2018	A*	`conf`	Inapproximability of the independent set polynomial in the complex plane. STOC Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2018	J	`jnl`	Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR Leslie Ann Goldberg, John Lapinskas, David Richerby
2018	—	`conf`	Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
2018	J	`jnl`	Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. CoRR Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
2018	J	`jnl`	The Complexity of Approximately Counting Retractions. CoRR Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2018	A*	`conf`	The Complexity of Counting Surjective Homomorphisms and Compactions. SODA Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2018	J	`jnl`	The complexity of approximating the matching polynomial in the complex plane. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2018	J	`jnl`	Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. CoRR Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
2017	J	`jnl`	A Complexity Trichotomy for Approximately Counting List ACM Trans. Comput. Theory Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2017	B	`conf`	A Fixed-Parameter Perspective on #BIS. IPEC Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2017	J	`jnl`	A Fixed-Parameter Perspective on #BIS. CoRR Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2017	J	`jnl`	Amplifiers for the Moran Process. J. ACM Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
2017	A*	`conf`	Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. ICALP Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
2017	J	`jnl`	Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum
2017	J	`jnl`	Functional clones and expressibility of partition functions. Theor. Comput. Sci. Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2017	A*	`conf`	Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2017	J	`jnl`	Inapproximability of the independent set polynomial in the complex plane. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2017	J	`jnl`	Random Walks on Small World Networks. CoRR Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
2017	J	`jnl`	Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. Bull. EATCS Paul G. Spirakis, Leslie Ann Goldberg, Antonín Kucera, Giuseppe Persiano
2017	J	`jnl`	The Complexity of Approximating complex-valued Ising and Tutte partition functions. Comput. Complex. Leslie Ann Goldberg, Heng Guo
2017	J	`jnl`	The Complexity of Counting Surjective Homomorphisms and Compactions. CoRR Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2016	J	`jnl`	#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
2016	A*	`conf`	A Complexity Trichotomy for Approximately Counting List H-Colourings. ICALP Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	A complexity trichotomy for approximately counting list H-colourings. CoRR Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	Absorption time of the Moran process. Random Struct. Algorithms Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna
2016	A*	`conf`	Amplifiers for the Moran Process. ICALP Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
2016	J	`jnl`	Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	Approximately counting locally-optimal structures. J. Comput. Syst. Sci. Leslie Ann Goldberg, Rob Gysel, John Lapinskas
2016	J	`jnl`	Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. CoRR Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
2016	A*	`conf`	Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
2016	J	`jnl`	Asymptotically Optimal Amplifiers for the Moran Process. CoRR Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister
2016	J	`jnl`	Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. Martin E. Dyer, Leslie Ann Goldberg, David Richerby
2016	J	`jnl`	Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory Andreas Göbel, Leslie Ann Goldberg, David Richerby
2016	J	`jnl`	Functional Clones and Expressibility of Partition Functions. CoRR Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2016	J	`jnl`	Inapproximability of the independent set polynomial below the Shearer threshold. CoRR Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2016	A*	`conf`	The complexity of approximately counting in 2-spin systems on SODA Andreas Galanis, Leslie Ann Goldberg
2016	J	`jnl`	The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Inf. Comput. Andreas Galanis, Leslie Ann Goldberg
2016	J	`jnl`	The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. Leslie Ann Goldberg, Mark Jerrum
2015	J	`jnl`	A complexity classification of spin systems with an external field. Proc. Natl. Acad. Sci. USA Leslie Ann Goldberg, Mark Jerrum
2015	J	`jnl`	Amplifiers for the Moran Process. CoRR Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
2015	J	`jnl`	Approximately Counting H-Colourings is #BIS-Hard. CoRR Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2015	—	`conf`	Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. ICALP (1) Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2015	—	`conf`	Approximately Counting Locally-Optimal Structures. ICALP (1) Leslie Ann Goldberg, Rob Gysel, John Lapinskas
2015	J	`jnl`	Approximating the partition function of planar two-state spin systems. J. Comput. Syst. Sci. Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2015	J	`jnl`	Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
2015	—	`conf`	Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) Andreas Göbel, Leslie Ann Goldberg, David Richerby
2015	J	`jnl`	Counting Homomorphisms to Square-Free Graphs, Modulo 2. CoRR Andreas Göbel, Leslie Ann Goldberg, David Richerby
2015	J	`jnl`	Counting List Matrix Partitions of Graphs. SIAM J. Comput. Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2015	A	`conf`	Evolutionary Dynamics on Graphs: Invited Talk. FOGA Leslie Ann Goldberg
2015	J	`jnl`	The complexity of Boolean #MaximalCSP. CoRR Leslie Ann Goldberg, Mark Jerrum
2015	J	`jnl`	The complexity of approximately counting in 2-spin systems on $k$-uniform bounded-degree hypergraphs. CoRR Andreas Galanis, Leslie Ann Goldberg
2015	J	`jnl`	The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2014	—	`conf`	#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
2014	—	`conf`	Absorption Time of the Moran Process. APPROX-RANDOM Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna
2014	J	`jnl`	Approximately counting locally-optimal structures. CoRR Leslie Ann Goldberg, Rob Gysel, John Lapinskas
2014	J	`jnl`	Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2014	J	`jnl`	Counting 4×4 Matrix Partitions of Graphs. CoRR Martin E. Dyer, Leslie Ann Goldberg, David Richerby
2014	A	`conf`	Counting Homomorphisms to Cactus Graphs Modulo 2. STACS Andreas Göbel, Leslie Ann Goldberg, David Richerby
2014	A	`conf`	Counting List Matrix Partitions of Graphs. CCC Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2014	J	`jnl`	The Complexity of Approximately Counting Tree Homomorphisms. ACM Trans. Comput. Theory Leslie Ann Goldberg, Mark Jerrum
2014	J	`jnl`	The Complexity of Computing the Sign of the Tutte Polynomial. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum
2014	J	`jnl`	The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation. CoRR Leslie Ann Goldberg, Heng Guo
2014	J	`jnl`	The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Trans. Comput. Theory Andreas Göbel, Leslie Ann Goldberg, David Richerby
2013	J	`jnl`	A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum
2013	J	`jnl`	Absorption Time of the Moran Process. CoRR Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna
2013	J	`jnl`	Adaptive Drift Analysis. Algorithmica Benjamin Doerr, Leslie Ann Goldberg
2013	J	`jnl`	Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum
2013	J	`jnl`	Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. J. Comput. Syst. Sci. Leslie Ann Goldberg, Mark Jerrum
2013	J	`jnl`	Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran
2013	J	`jnl`	Counting list matrix partitions of graphs. CoRR Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami
2013	J	`jnl`	Ranking Games that have Competitiveness-based Strategies CoRR Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2013	J	`jnl`	Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2013	J	`jnl`	The Complexity of Approximately Counting Tree Homomorphisms CoRR Leslie Ann Goldberg, Mark Jerrum
2013	J	`jnl`	The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2. CoRR Andreas Göbel, Leslie Ann Goldberg, David Richerby
2013	J	`jnl`	The EATCS Award 2014 - Call for nominations. Bull. EATCS Leslie Ann Goldberg
2013	A	`conf`	The complexity of approximating conservative counting CSPs. STACS Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2013	J	`jnl`	The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2012	A*	`conf`	Approximating fixation probabilities in the generalized Moran process. SODA Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2012	J	`jnl`	Approximating the partition function of planar two-state spin systems CoRR Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2012	J	`jnl`	Approximating the partition function of the ferromagnetic potts model. J. ACM Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	Can Fixation be Guaranteed in the Generalized Moran Process? CoRR Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2012	J	`jnl`	Inapproximability of the Tutte polynomial of a planar graph. Comput. Complex. Leslie Ann Goldberg, Mark Jerrum
2012	A	`conf`	Log-supermodular functions, functional clones and counting CSPs. STACS Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2012	—	`conf`	The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). ICALP (1) Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation) CoRR Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	The complexity of approximately counting stable matchings. Theor. Comput. Sci. Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
2012	J	`jnl`	The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
2012	J	`jnl`	The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2012	J	`jnl`	The complexity of approximating conservative counting CSPs CoRR Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2012	J	`jnl`	The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2011	J	`jnl`	A Counterexample to rapid mixing of the Ge-Stefankovic Process CoRR Leslie Ann Goldberg, Mark Jerrum
2011	—	`conf`	A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. ICALP (1) Leslie Ann Goldberg, Mark Jerrum
2011	J	`jnl`	Adaptive Drift Analysis CoRR Benjamin Doerr, Leslie Ann Goldberg
2011	J	`jnl`	Approximating Fixation Probabilities in the Generalized Moran Process CoRR Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2011	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings APPROX-RANDOM Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim
2011	J	`jnl`	Log-supermodular functions, functional clones and counting CSPs CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2011	B	`conf`	Stabilizing consensus with the power of two choices. SPAA Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2010	—	`conf`	10481 Abstracts Collection - Computational Counting. Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	10481 Executive Summary - Computational Counting. Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2010	J	`jnl`	A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid CoRR Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	Adaptive Drift Analysis. PPSN (1) Benjamin Doerr, Leslie Ann Goldberg
2010	J	`jnl`	An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials CoRR Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Approximating the partition function of the ferromagnetic Potts model CoRR Leslie Ann Goldberg, Mark Jerrum
2010	A	`conf`	Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2010	—	`ed.`	Computational Counting, 28.11. - 03.12.2010 Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	Drift Analysis with Tail Bounds. PPSN (1) Benjamin Doerr, Leslie Ann Goldberg
2010	A*	`conf`	Ranking games that have competitiveness-based strategies. EC Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
2010	J	`jnl`	The Complexity of Approximately Counting Stable Matchings CoRR Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin
2010	—	`conf`	The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin
2010	J	`jnl`	The Complexity of Approximately Counting Stable Roommate Assignments CoRR Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin
2010	J	`jnl`	The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2010	A	`conf`	The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2010	J	`jnl`	The complexity of weighted and unweighted #CSP CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2010	J	`jnl`	The mixing time of Glauber dynamics for coloring regular trees. Random Struct. Algorithms Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski
2009	A	`conf`	A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2009	J	`jnl`	A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2009	J	`jnl`	Inapproximability of the Tutte polynomial of a planar graph CoRR Leslie Ann Goldberg, Mark Jerrum
2009	J	`jnl`	On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2009	—	`conf`	Stabilizing Consensus with the Power of Two Choices. Algorithmic Methods for Distributed Cooperative Systems Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2009	J	`jnl`	The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2009	J	`jnl`	The Complexity of Weighted Boolean #CSP. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2009	J	`jnl`	The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2008	J	`jnl`	A complexity dichotomy for hypergraph partition functions CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	J	`jnl`	A complexity dichotomy for partition functions with mixed signs CoRR Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2008	—	`conf`	A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2008	—	`ed.`	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games ICALP (1) Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
2008	—	`ed.`	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations ICALP (2) Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
2008	J	`jnl`	Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	J	`jnl`	Inapproximability of the Tutte polynomial. Inf. Comput. Leslie Ann Goldberg, Mark Jerrum
2008	A*	`conf`	On the Dimensionality of Voting Games. AAAI Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2008	J	`jnl`	The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2008	J	`jnl`	The Mixing Time of Glauber Dynamics for Colouring Regular Trees CoRR Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski
2007	J	`jnl`	An approximation trichotomy for Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2007	A*	`conf`	Computational Complexity of Weighted Threshold Games. AAAI Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge
2007	J	`jnl`	Computing Good Nash Equilibria in Graphical Games CoRR Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2007	A*	`conf`	Computing good nash equilibria in graphical games. EC Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2007	J	`jnl`	Distributed Selfish Load Balancing. SIAM J. Comput. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
2007	A*	`conf`	Frugality ratios and improved truthful mechanisms for vertex cover. EC Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2007	A*	`conf`	Inapproximability of the Tutte polynomial. STOC Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	Matrix norms and rapid mixing for spin systems CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	On counting homomorphisms to directed acyclic graphs. J. ACM Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
2007	J	`jnl`	The Complexity of Ferromagnetic Ising with Local Fields. Comb. Probab. Comput. Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	The Complexity of Weighted Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2006	A*	`conf`	Distributed selfish load balancing. SODA Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
2006	—	`conf`	Dobrushin Conditions and Systematic Scan. APPROX-RANDOM Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2006	J	`jnl`	Frugality ratios and improved truthful mechanisms for vertex cover CoRR Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2006	J	`jnl`	Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z LMS J. Comput. Math. Leslie Ann Goldberg, Markus Jalsenius, Russell Martin, Mike Paterson
2006	J	`jnl`	Inapproximability of the Tutte polynomial CoRR Leslie Ann Goldberg, Mark Jerrum
2006	J	`jnl`	Nash Equilibria in Graphical Games on Trees Revisited Electron. Colloquium Comput. Complex. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2006	A*	`conf`	Nash equilibria in graphical games on trees revisited. EC Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
2006	—	`conf`	On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
2006	J	`jnl`	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
2006	J	`jnl`	Utilitarian resource assignment. J. Discrete Algorithms Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
2005	J	`jnl`	Distributed Selfish Load Balancing CoRR Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
2005	J	`jnl`	Dobrushin conditions and Systematic Scan Electron. Colloquium Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2005	J	`jnl`	On counting homomorphisms to directed acyclic graphs Electron. Colloquium Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
2005	J	`jnl`	Strong Spatial Mixing with Fewer Colors for Lattice Graphs. SIAM J. Comput. Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
2004	J	`jnl`	A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
2004	J	`jnl`	Counting and sampling H-colourings? Inf. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2004	J	`jnl`	Random sampling of 3-colorings in Z Random Struct. Algorithms Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
2004	J	`jnl`	The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM J. Comput. Leslie Ann Goldberg, Steven Kelk, Mike Paterson
2004	J	`jnl`	The Relative Complexity of Approximate Counting Problems. Algorithmica Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2004	J	`jnl`	Utilitarian resource assignment CoRR Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
2004	A*	`conf`	trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
2003	B	`conf`	A proportionate fair scheduling rule with good worst-case performance. SPAA Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson
2003	J	`jnl`	The Natural Work-Stealing Algorithm is Stable. SIAM J. Comput. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
2003	J	`jnl`	The computational complexity of two-state spin systems. Random Struct. Algorithms Leslie Ann Goldberg, Mark Jerrum, Mike Paterson
2002	J	`jnl`	Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
2002	—	`conf`	Counting and Sampling H-Colourings. RANDOM Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2002	A*	`conf`	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
2002	J	`jnl`	The "Burnside Process" Converges Slowly. Comb. Probab. Comput. Leslie Ann Goldberg, Mark Jerrum
2002	A*	`conf`	The complexity of choosing an H-colouring (nearly) uniformly at random. STOC Leslie Ann Goldberg, Steven Kelk, Mike Paterson
2001	J	`jnl`	An Improved Stability Bound for Binary Exponential Backoff. Theory Comput. Syst. Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
2001	J	`jnl`	Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discret. Math. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
2001	J	`jnl`	Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. SIAM J. Comput. Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
2001	J	`jnl`	The Complexity of Gene Placement. J. Algorithms Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
2001	A*	`conf`	The Natural Work-Stealing Algorithm is Stable. FOCS Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
2000	A*	`conf`	A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
2000	J	`jnl`	An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	A*	`conf`	An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	A	`conf`	Binary Exponential Backoff Is Stable for High Arrival Rates. STACS Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
2000	J	`jnl`	Contention resolution with constant expected delay. J. ACM Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan
2000	J	`jnl`	Counting Unlabelled Subtrees of a Tree is #P-complete. LMS J. Comput. Math. Leslie Ann Goldberg, Mark Jerrum
2000	—	`conf`	On the relative complexity of approximate counting problems. APPROX Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2000	A*	`conf`	Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson
1999	J	`jnl`	An Optical Simulation of Shared Memory. SIAM J. Comput. Leslie Ann Goldberg, Yossi Matias, Satish Rao
1999	J	`jnl`	Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. Comput. Syst. Sci. Leslie Ann Goldberg, Philip D. MacKenzie
1999	J	`jnl`	Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
1999	J	`jnl`	Randomly Sampling Molecules. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum
1999	A*	`conf`	The Complexity of Gene Placement. SODA Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
1998	J	`jnl`	An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
1998	J	`jnl`	Constructing Computer Virus Phylogenies. J. Algorithms Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
1998	A*	`conf`	Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. FOCS Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
1998	—	`conf`	The "Burnside Process" Converges Slowly. RANDOM Leslie Ann Goldberg, Mark Jerrum
1997	B	`conf`	Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
1997	A*	`conf`	Better Approximation Guarantees for Job-shop Scheduling. SODA Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
1997	A*	`conf`	Contention Resolution with Guaranteed Constant Expected Delay. FOCS Leslie Ann Goldberg, Philip D. MacKenzie
1997	J	`jnl`	Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1997	A*	`conf`	Randomly Sampling Molecules. SODA Leslie Ann Goldberg, Mark Jerrum
1996	A*	`conf`	Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA Leslie Ann Goldberg, Philip D. MacKenzie
1996	A*	`conf`	Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. COLT Leslie Ann Goldberg
1996	B	`conf`	Constructing Computer Virus Phylogenies. CPM Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
1996	J	`jnl`	Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discret. Appl. Math. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow
1995	B	`conf`	Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow
1994	B	`conf`	An Optical Simulation of Shared Memory. SPAA Leslie Ann Goldberg, Yossi Matias, Satish Rao
1994	B	`conf`	An W(log log n) Lower Bound for Routing in Optical Networks. SPAA Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
1994	J	`jnl`	Listing Graphs That Satisfy First-Order Sentences. J. Comput. Syst. Sci. Leslie Ann Goldberg
1994	—	`conf`	Routing in Optical networks: The problem of contention. Interconnection Networks and Mapping and Scheduling Parallel Computations Leslie Ann Goldberg
1993	B	`conf`	A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1993	J	`jnl`	Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial Inf. Comput. Leslie Ann Goldberg
1993	A*	`conf`	Polynomial space polynomial delay algorithms for listing families of graphs. STOC Leslie Ann Goldberg
1992	J	`jnl`	Efficient Algorithms for Listing Unlabeled Graphs. J. Algorithms Leslie Ann Goldberg
1991	—	`—`	Efficient algorithms for listing combinatorial structures. Leslie Ann Goldberg