Martin E. Dyer

J. Comput. Syst. Sci., 2023

Thick Forests.

[BibT_eX]

[DOI]

CoRR, 2023

A triangle process on graphs with given degree sequence.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Counting Weighted Independent Sets beyond the Permanent.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Counting independent sets in graphs with bounded bipartite pathwidth.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2021

Sampling hypergraphs with given degrees.

[BibT_eX]

[DOI]

Pieter Kleer

James Ross

Discret. Math., 2021

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

A Triangle Process on Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Random Walks on Small World Networks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

2019

Counting Perfect Matchings and the Switch Chain.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Order-preserving encryption using approximate common divisors.

[BibT_eX]

[DOI]

Karim Djemame

J. Inf. Secur. Appl., 2019

Counting independent sets in cocomparability graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Practical homomorphic encryption over the integers for secure computation in the cloud.

[BibT_eX]

[DOI]

Jie Xu

Int. J. Inf. Sec., 2019

Quasimonotone graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

The flip Markov chain for connected regular graphs.

[BibT_eX]

[DOI]

Andrew J. Handley

Discret. Appl. Math., 2019

Triangle-creation processes on cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Discordant Voting Processes on Finite Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

2017

On the Switch Markov Chain for Perfect Matchings.

[BibT_eX]

[DOI]

J. ACM, 2017

Practical Homomorphic Encryption Over the Integers.

[BibT_eX]

[DOI]

Jie Xu

CoRR, 2017

Order-Preserving Encryption Using Approximate Integer Common Divisors.

[BibT_eX]

[DOI]

Jie Xu

Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2017

2016

Counting 4×4 matrix partitions of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Erratum to: Computational complexity of stochastic programming problems.

[BibT_eX]

[DOI]

Math. Program., 2015

On the chromatic number of a random hypergraph.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2015

The complexity of approximating conservative counting CSPs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

2014

A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming.

[BibT_eX]

[DOI]

Math. Program., 2014

2013

An Effective Dichotomy for the Counting Constraint Satisfaction Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

The expressibility of functions on the boolean domain, with applications to counting CSPs.

[BibT_eX]

[DOI]

J. ACM, 2013

2012

The complexity of weighted and unweighted #CSP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

The complexity of approximating bounded-degree Boolean #CSP.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Log-supermodular functions, functional clones and counting CSPs.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

On the Imitation Strategy for Games on Graphs

[BibT_eX]

[DOI]

Velumailum Mohanaraj

CoRR, 2011

The Iterated Prisoner's Dilemma on a Cycle

[BibT_eX]

[DOI]

Velumailum Mohanaraj

CoRR, 2011

The #CSP Dichotomy is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Networks of random cycles.

[BibT_eX]

[DOI]

Andrew J. Handley

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Pairwise-Interaction Games.

[BibT_eX]

[DOI]

Velumailum Mohanaraj

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Approximately Counting Integral Flows and Cell-Bounded Contingency Tables.

[BibT_eX]

[DOI]

Mary Cryan

Dana Randall

SIAM J. Comput., 2010

Randomly coloring random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

An approximation trichotomy for Boolean #CSP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)

[BibT_eX]

[DOI]

CoRR, 2010

A Complexity Dichotomy For Hypergraph Partition Functions.

[BibT_eX]

[DOI]

Comput. Complex., 2010

On the complexity of #CSP.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009

The complexity of weighted Boolean #CSP with mixed signs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The Complexity of Weighted Boolean #CSP.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

The flip markov chain and a randomising P2P protocol.

[BibT_eX]

[DOI]

Andrew J. Handley

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Random walks on the vertices of transportation polytopes with constant number of sources.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Path coupling using stopping times and counting independent sets and colorings in hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Dobrushin Conditions and Systematic Scan.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Randomized and Approximation Algorithms, 11.05., 2008

2007

Path coupling without contraction.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

On counting homomorphisms to directed acyclic graphs.

[BibT_eX]

[DOI]

Mike Paterson

J. ACM, 2007

Sampling Regular Graphs and a Peer-to-Peer Network.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Matrix norms and rapid mixing for spin systems

[BibT_eX]

[DOI]

CoRR, 2007

2006

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Randomly coloring sparse random graphs with fewer colors than the maximum degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Computational complexity of stochastic programming problems.

[BibT_eX]

[DOI]

Math. Program., 2006

Stopping Times, Metrics and Approximate Counting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Metric Construction, Stopping Times and Path Coupling.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Path Coupling Using Stopping Times.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Randomized and Approximation Algorithms, 15.05., 2005

2004

Linear programming.

[BibT_eX]

[DOI]

Nimrod Megiddo

Emo Welzl

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Mixing in time and space for lattice spin systems: A combinatorial view.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Corrigendum: The complexity of counting graph homomorphisms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Counting and sampling H-colourings?

[BibT_eX]

[DOI]

Inf. Comput., 2004

Randomly coloring constant degree graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

The Relative Complexity of Approximate Counting Problems.

[BibT_eX]

[DOI]

Algorithmica, 2004

2003

A probabilistic analysis of randomly generated binary constraint satisfaction problems.

[BibT_eX]

[DOI]

Michael Molloy

Theor. Comput. Sci., 2003

Randomly coloring graphs with lower bounds on girth and maximum degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant.

[BibT_eX]

[DOI]

Mary Cryan

J. Comput. Syst. Sci., 2003

Approximate counting by dynamic programming.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems.

[BibT_eX]

[DOI]

Sammani D. Abdullahi

Les G. Proll

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

On Counting Independent Sets in Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs.

[BibT_eX]

[DOI]

Michael Molloy

Random Struct. Algorithms, 2002

Convergence Of The Iterated Prisoner's Dilemma Game.

[BibT_eX]

[DOI]

Gabriel Istrate

Comb. Probab. Comput., 2002

2001

On Markov Chains for Randomly H-Coloring a Graph.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.

[BibT_eX]

[DOI]

Eric Vigoda

Proceedings of the Graphs, 2001

On the Sampling Problem for H-Colorings on the Hypercubic Lattice.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Polynomial-time counting and sampling of two-rowed contingency tables.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems.

[BibT_eX]

[DOI]

Sandeep Sen

SIAM J. Comput., 2000

An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings.

[BibT_eX]

[DOI]

Michael Mitzenmacher

SIAM J. Comput., 2000

The complexity of counting graph homomorphisms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

On Markov Chains for Independent Sets.

[BibT_eX]

[DOI]

J. Algorithms, 2000

An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The complexity of counting graph homomorphisms (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

On Approximately Counting Colorings of Small Degree Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Faster random generation of linear extensions.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

On the Complexity of Computing Mixed Volumes.

[BibT_eX]

[DOI]

Peter Gritzmann

Alexander Hufnagel

SIAM J. Comput., 1998

Approximately Counting Hamilton Paths and Cycles in Dense Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

A more rapidly mixing Markov chain for graph colorings.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

An elementary analysis of a procedure for sampling points in a convex body.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Sampling contingency tables.

[BibT_eX]

[DOI]

John Mount

Random Struct. Algorithms, 1997

On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension.

[BibT_eX]

[DOI]

Math. Oper. Res., 1997

Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

A Scalable Shared Queue on a Distributed Memory Machine.

[BibT_eX]

[DOI]

Jonathan M. Nash

Peter M. Dew

Comput. J., 1996

Locating the Phase Transition in Binary Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Barbara M. Smith

Artif. Intell., 1996

Implementation Issues Relating to the WPRAM Model for Scalable Computing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Randomized Greedy Matching II.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

On Key Storage in Secure Networks.

[BibT_eX]

[DOI]

J. Cryptol., 1995

Ordering Clone Libraries in Computational Biology.

[BibT_eX]

[DOI]

Stephen Suen

J. Comput. Biol., 1995

The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance.

[BibT_eX]

[DOI]

Jonathan M. Nash

Peter M. Dew

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

A Parallel Algorithm for Linear Programming in Fixed Dimension.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Random walks, totally unimodular matrices, and a randomised dual simplex algorithm.

[BibT_eX]

[DOI]

Math. Program., 1994

The Probability of Unique Solutions of Sequencing by Hybridization.

[BibT_eX]

[DOI]

Stephen Suen

J. Comput. Biol., 1994

On a Universal Chain Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Approximately Counting Hamilton Cycles in Dense Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

On the Greedy Heuristic for Matchings.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

1992

Volumes Spanned by Random Points in the Hypercube.

[BibT_eX]

[DOI]

Zoltán Füredi

Colin McDiarmid

Random Struct. Algorithms, 1992

Probabilistic analysis of the generalised assignment problem.

[BibT_eX]

[DOI]

Math. Program., 1992

A Class of Convex Programs with Applications to Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

On Counting Lattice Points in Polyhedra.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1991

Randomized Greedy Matching.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1991

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies.

[BibT_eX]

[DOI]

J. ACM, 1991

1990

On Patching Algorithms for Random Asymmetric Travelling Salesman Problems.

[BibT_eX]

[DOI]

Math. Program., 1990

Formulating the single machine sequencing problem with release dates as a mixed integer program.

[BibT_eX]

[DOI]

Laurence A. Wolsey

Discret. Appl. Math., 1990

On an optimization problem with nested constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Random Volumes in the n-Cube.

[BibT_eX]

[DOI]

Zoltán Füredi

Colin McDiarmid

Proceedings of the Polyhedral Combinatorics, 1990

1989

A randomized algorithm for fixed-dimensional linear programming.

[BibT_eX]

[DOI]

Math. Program., 1989

Probabilistic Analysis of the Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 1989

The Solution of Some Random NP-Hard Problems in Polynomial Expected Time.

[BibT_eX]

[DOI]

J. Algorithms, 1989

1988

On the Complexity of Computing the Volume of a Polyhedron.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

1987

An algorithm for a separable integer programming problem with cumulatively bounded variables.

[BibT_eX]

[DOI]

John Walker

Discret. Appl. Math., 1987

1986

On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

On linear programs with random costs.

[BibT_eX]

[DOI]

Colin J. H. McDiarmid

Math. Program., 1986

Planar 3DM is NP-Complete.

[BibT_eX]

[DOI]

J. Algorithms, 1986

Fast Solution of Some Random NP-Hard Problems

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

On the complexity of partitioning graphs into connected subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1985

1984

Linear Time Algorithms for Two- and Three-Variable Linear Programs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

An O(<i>n</i>) algorithm for the multiple-choice knapsack linear program.

[BibT_eX]

[DOI]

Math. Program., 1984

A Partitioning Algorithm for Minimum Weighted Euclidean Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

A note on bicriterion programming.

[BibT_eX]

[DOI]

John Walker

Math. Program., 1983

The Complexity of Vertex Enumeration Methods.

[BibT_eX]

[DOI]

Math. Oper. Res., 1983

1982

Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints.

[BibT_eX]

[DOI]

John Walker

Math. Program., 1982

1980

Eliminating extraneous edges in Greenberg's algorithm.

[BibT_eX]

[DOI]

Les G. Proll

Math. Program., 1980

Calculating surrogate constraints.

[BibT_eX]

[DOI]

Math. Program., 1980

1977

An algorithm for determining all extreme points of a convex polytope.

[BibT_eX]

[DOI]