Stephan Mertens

Orcid: 0000-0001-9620-0995

According to our database1, Stephan Mertens authored at least 20 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Percolation is Odd.
CoRR, 2019

2017
The Perimeter of Proper Polycubes.
J. Integer Seq., 2017

2014
Stable Roommates Problem with Random Preferences.
CoRR, 2014

2013
The Complexity of the Fermionant and Immanants of Constant Width [Note].
Theory Comput., 2013

2012
Continuum Percolation Thresholds in Two Dimensions
CoRR, 2012

2011
The complexity of the fermionant, and immanants of constant width
CoRR, 2011

Parallel Complexity of Random Boolean Circuits
CoRR, 2011

The Nature of Computation.
Oxford University Press, ISBN: 978-0-19-923321-2, 2011

2009
Proof of the local REM conjecture for number partitioning. II. Growing energy scales.
Random Struct. Algorithms, 2009

Proof of the local REM conjecture for number partitioning. I: Constant energy scales.
Random Struct. Algorithms, 2009

2008
Analysis of the Karmarkar-Karp Differencing Algorithm
CoRR, 2008

2006
Threshold values of random <i>K</i>-SAT from the cavity method.
Random Struct. Algorithms, 2006

Random numbers for large scale distributed Monte Carlo simulations
CoRR, 2006

The Easiest Hard Problem: Number Partitioning.
Proceedings of the Computational Complexity and Statistical Physics., 2006

2004
Phase diagram for the constrained integer partitioning problem.
Random Struct. Algorithms, 2004

Constrained Integer Partitions.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Threshold values of Random K-SAT from the cavity method
CoRR, 2003

2002
Computational complexity for physicists.
Comput. Sci. Eng., 2002

2001
A physicist's approach to number partitioning.
Theor. Comput. Sci., 2001

1999
A complete anytime algorithm for balanced number partitioning
CoRR, 1999


  Loading...