default search action
Stephan Mertens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i10]Stephan Mertens, Cristopher Moore:
Percolation is Odd. CoRR abs/1909.01484 (2019) - 2017
- [j8]Sebastian Luther, Stephan Mertens:
The Perimeter of Proper Polycubes. J. Integer Seq. 20(9): 17.9.5 (2017) - 2014
- [i9]Stephan Mertens:
Stable Roommates Problem with Random Preferences. CoRR abs/1401.5269 (2014) - 2013
- [j7]Stephan Mertens
, Cristopher Moore:
The Complexity of the Fermionant and Immanants of Constant Width [Note]. Theory Comput. 9: 273-282 (2013) - 2012
- [i8]Stephan Mertens, Cristopher Moore:
Continuum Percolation Thresholds in Two Dimensions. CoRR abs/1209.4936 (2012) - 2011
- [b1]Cristopher Moore, Stephan Mertens:
The Nature of Computation. Oxford University Press 2011, ISBN 978-0-19-923321-2, pp. I-XVII, 1-985 - [i7]Jon Machta, Simon DeDeo, Stephan Mertens, Cristopher Moore:
Parallel Complexity of Random Boolean Circuits. CoRR abs/1102.3310 (2011) - [i6]Stephan Mertens, Cristopher Moore:
The complexity of the fermionant, and immanants of constant width. CoRR abs/1110.1821 (2011)
2000 – 2009
- 2009
- [j6]Christian Borgs
Proof of the local REM conjecture for number partitioning. I: Constant energy scales. Random Struct. Algorithms 34(2): 217-240 (2009) - [j5]Christian Borgs
Proof of the local REM conjecture for number partitioning. II. Growing energy scales. Random Struct. Algorithms 34(2): 241-284 (2009) - 2008
- [i5]Stefan Boettcher, Stephan Mertens:
Analysis of the Karmarkar-Karp Differencing Algorithm. CoRR abs/0802.4040 (2008) - 2006
- [j4]Stephan Mertens, Marc Mézard, Riccardo Zecchina
Threshold values of random K-SAT from the cavity method. Random Struct. Algorithms 28(3): 340-373 (2006) - [p1]Stephan Mertens:
The Easiest Hard Problem: Number Partitioning. Computational Complexity and Statistical Physics 2006: 125-140 - [i4]Heiko Bauke, Stephan Mertens:
Random numbers for large scale distributed Monte Carlo simulations. CoRR abs/cond-mat/0609584 (2006) - 2004
- [j3]Christian Borgs
Phase diagram for the constrained integer partitioning problem. Random Struct. Algorithms 24(3): 315-380 (2004) - [c1]Christian Borgs
Constrained Integer Partitions. LATIN 2004: 59-68 - 2003
- [i3]Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel:
Phase Diagram for the Constrained Integer Partitioning Problem. CoRR cond-mat/0302536 (2003) - [i2]Stephan Mertens, Marc Mézard, Riccardo Zecchina:
Threshold values of Random K-SAT from the cavity method. CoRR cs.CC/0309020 (2003) - 2002
- [j2]Stephan Mertens:
Computational complexity for physicists. Comput. Sci. Eng. 4(3): 31-47 (2002) - 2001
- [j1]Stephan Mertens:
A physicist's approach to number partitioning. Theor. Comput. Sci. 265(1-2): 79-108 (2001)
1990 – 1999
- 1999
- [i1]Stephan Mertens:
A complete anytime algorithm for balanced number partitioning. CoRR cs.DS/9903011 (1999)
Coauthor Index
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 2024-10-07 21:24 CEST 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: