 |
||||
|
||||
|
|
Publications
 |
 |
Papers
- S. Mertens and C. Moore
Continuum Percolation Thresholds in Two Dimensions
Physical Review E 86 (2012) 061109 - S. Mertens and C. Moore
The complexity of the fermionant, and immanants of constant width
Theory of Computing 9 (2013) 273 - S. Luther and S. Mertens
Counting Lattice Animals in High Dimensions
J. Stat. Mech. (2011) P09026 - J. Machta, S. DeDeo, S. Mertens and C. Moore
Parallel Complexity of Random Boolean Circuits
J. Stat. Mech. (2011) P04015 - S. Mertens and S. Boettcher
Asymptotics of Lagged Fibonacci Sequences
http://arXiv.org/abs/0912.2459 - S. Mertens
Random Number Generators: A Survival Guide for Large Scale Simulations
to appear in Modern Computational Science 09, R. Leidl and A.K. Hartmann (eds), BIS-Verlag, Oldenburg, 2009 - C. Borgs, J. Chayes, S. Mertens and C. Nair
Proof of the local REM conjecture for number partitioning I: Constant energy scales
Random Structures and Algorithms 34 217 (2008) - C. Borgs, J. Chayes, S. Mertens and C. Nair
Proof of the local REM conjecture for number partitioning II: Growing energy scales
Random Structures and Algorithms 34 241 (2008) - S. Mertens and S. Mingramm
Brachistochrones with loose ends
European Journal of Physics 29 1191 (2008) - S. Boettcher and S. Mertens
Analysis of the Karmarkar-Karp Differencing Algorithm
European Physics Journal B 65 131 (2008)
arXiv.org:08024040 - H. Bauke and S. Mertens
Random Numbers for Large Scale Distributed Monte Carlo Simulations
Phys. Rev. E 75 066701 (2007)
arxiv.org/abs/cond-mat/0609584 - S. Mertens, M. Mézard and R. Zecchina
Threshold values of random K-SAT from the cavity method
Random Structures and Algorithms 28 340-373 (2006)
arXiv.org/abs/cs.CC/0309020 - S. Mertens
The Easiest Hard Problem: Number Partitioning (Review)
A.G. Percus, G. Istrate and C. Moore, eds., Computational Complexity and Statistical Physics (Oxford University Press, New York, 2006), p. 125-139
arxiv.org/abs/cond-mat/0310317 - S. Mertens
Random Stable Matchings
J. Stat. Mech. (2005) P10008
arxiv.org/abs/cond-mat/0509221
see the Open Problem Garden - H. Bauke and S. Mertens
Pseudo Random Coins Show More Heads Than Tails
J. Stat. Phys. 114 1149-1169 (2004)
http://arxiv.org/abs/cond-mat/0307138
see also the press coverage of this and the following paper - S. Mertens and H. Bauke
Entropy of Pseudo Random Number Generators
Phys. Rev. E 69 055702(R) (2004)
arxiv.org/abs/cond-mat/0305319 - C. Borgs, J.T. Chayes, S. Mertens and B. Pittel
Constrained Integer Partitions
Proc. LATIN 2004 59--68, Springer Lecture Notes in Computer Science, vol. 2976 (2004), - H. Bauke, S. Franz and S. Mertens
Number partitioning as random energy model
J. Stat. Mech. P04003 (2004)
arxiv.org/abs/cond-mat/0402010 - H. Bauke and S. Mertens
Universality in the level statistics of disordered systems
Phys. Rev. E 70 025102(R) (2004) - C. Borgs, J.T. Chayes, S. Mertens and B. Pittel
Phase Diagram for the Constrained Integer Partitioning Problem
Random Structures and Algorithms 24 315-380 (2004)
arxiv.org/abs/cond-mat/0302536 - H. Bauke, S. Mertens and A. Engel
Phase Transition in Multiprocessor Scheduling
Phys.Rev.Lett. 90 158701 (2003)
see also Physics tackles processor problem by Kim Patch
Technology Research News, November 19, 2003 - S. Mertens
Computational complexity for physicists (Review)
Computing in Science & Engineering, vol.4, no.3, May/June 2002, pp. 31-47 - S. Mertens
A physicist’s approach to number partitioning
Theor. Comp. Science 265 79-108 (2001)
see also The Easiest Hard Problem by Brian Hayes
American Scientist, March-April 2002
also cited in Eric Weisstein’s mathworld - S. Mertens
Random Costs in Combinatorial Optimization
Phys.Rev.Lett 84 1347 (2000) - S. Mertens
A complete anytime algorithm for balanced number partitioning
arXiv.org/abs/cs.DS/9903011 - S. Mertens
Phase transition in the number partitioning problem
Phys.Rev.Lett 81 4281 (1998) - S. Mertens and C. Bessenrodt
On the ground states of the Bernasconi model
J. Phys. A 31 3731 (1998) - S. Mertens and A. Engel
On the VC-dimension of neural networks with binary weights
Phys. Rev. E 55 4478 (1997) - S. Mertens
Exhaustive Search for Low Autocorrelation Binary Sequences
J. Phys. A 29 L473 (1996) - S. Mertens
On the Vapnik-Chervonenkis Dimension of the Ising-Perceptron
J. Phys. A 29 L199 (1996) - S. Mertens and M.E. Lautenbacher
Counting Lattice Animals: A Parallel Attack
J. Stat. Phys. 66 669 (1992) - S. Mertens
Lattice Animals: A Fast Enumeration Algorithm and New Perimeter Polynomials
J. Stat. Phys. 58 1095 (1990)
also cited in Eric Weisstein’s mathworld - S. Mertens, H.M. Köhler and S. Bös
Learning grey-toned patterns in neural networks
J. Phys. A 24 4941 (1991) - S. Mertens
An extremely diluted asymmetric network with graded response neurons
J. Phys A 24 337 (1991) - E. Gardner, S. Mertens and A. Zippelius
Retrieval properties of a neural network with an asymmetric learning rule
J. Phys. A 22 2009 (1989)
Books
- C. Moore and S. Mertens
The Nature of Computation
Oxford University Press (2011)
www.nature-of-computation.org - H. Bauke and S. Mertens
Cluster Computing
Springer-Verlag, Berlin, Heidelberg, New York (2005)
www.clustercomputing.de
Book Reviews
- On the Back of an Envelope
A review of Guesstimation. Solving the World's Problems on the Back of a Cocktail Napkin
by Lawrence Weinstein and John A. Adam, 319 pp., Princeton University Press, Princeton, NJ, 2008
Science 321 1160, (2008) - Connecting the Dots
A review of Nets, Puzzles and Postmen. An exploration of mathematical connections.
by Peter M. Higgins, 255 pp., Oxford University Press, 2007
Science 320 181, (2008) - The Revolution Will Be Digitized
A review of Phase Change. The Computer Revolution in Science and Mathematics
by Douglas S. Robertson, xi + 190 pp., Oxford University Press, 2003
American Scientist 92, March-April (2004) - Node by Node
A review of Linked: The New Science of Networks
by Albert-László Barabási, viii + 280 pp., Perseus Publishing, 2002
American Scientist 91, March-April (2003)
|
|
|||
|
|||
|
|
© by Stephan Mertens
URL: http://wase.urz.uni-magdeburg.de/mertens/publications/
updated on Wednesday, February 27th 2013, 10:13:57 CET;