Maximilian Grischa Hahn-Klimroth

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Large discrete structures : statistical inference, combinatorics and limits	2021	Maximilian Grischa Hahn-Klimroth

Common Coauthors

Coauthor	Papers Together

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Tight Thresholds for Cuckoo Hashing via XORSAT	2010	Martin Dietzfelbinger Andreas Goerdt Michael Mitzenmacher Andrea Montanari Rasmus Pagh Michael Rink	1
+	Graph limits and exchangeable random graphs	2007	Persi Diaconis Svante Janson	1
+ PDF Chat	Regularity Partitions and The Topology of Graphons	2010	László Lovász Balázs Szegedy	1
+ PDF Chat	Sharp thresholds of graph properties, and the $k$-sat problem	1999	Ehud Friedgut appendix by Jean Bourgain	1
+	Regularity Lemmas for Graphs	2010	Vojtěch Rödl Mathias Schacht	1
+	Limits of compact decorated graphs	2010	László Lovász Balázs Szegedy	1
+	The Regularity Lemma and Its Applications in Graph Theory	2002	János Komlós Ali Shokoufandeh Miklós Simonovits Endre Szemerédi	1
+ PDF Chat	Extended variational principle for the Sherrington-Kirkpatrick spin-glass model	2003	Michael Aizenman Robert Sims Shannon Starr	1
+ PDF Chat	Constraint Satisfaction by Survey Propagation	2006	Alfredo Braunstein Marc Mézard Martin Weigt Riccardo Zecchina	1
+ PDF Chat	Bounds for graph regularity and removal lemmas	2012	David Conlon Jacob Fox	1
+	The Satisfiability Threshold for k-XORSAT	2012	Boris Pittel Gregory B. Sorkin	1
+	Limits of permutation sequences	2012	Carlos Hoppen Yoshiharu Kohayakawa Carlos Gustavo Moreira Balázs Ráth Rudini Sampaio	1
+	An elementary proof of the local central limit theorem	1995	Burgess Davis David McDonald	1
+ PDF Chat	Reconstruction and estimation in the planted partition model	2014	Elchanan Mossel Joseph Neeman Allan Sly	1
+ PDF Chat	Evolution of Scaling Emergence in Large-Scale Spatial Epidemic Spreading	2011	Lin Wang Xiang Li Yi-Qing Zhang Yan Zhang Kan Zhang	1
+	Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression	2010	Yihong Wu Sergio Verdú	1
+	Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region	2014	Andreas Galanis Daniel Štefankovič Eric Vigoda	1
+	Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time	2006	Alex Scott Gregory B. Sorkin	1
+	A simple construction of d-disjunct matrices with certain constant weights	1996	Anthony J. Macula	1
+ PDF Chat	The freezing threshold for k-colourings of a random graph	2012	Michael Molloy	1
+	Bypassing correlation decay for matchings with an application to XORSAT	2013	Marc Lelarge	1
+	Spanning subgraphs of random graphs	1992	Noga Alon Zoltán Füredi	1
+ PDF Chat	Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications	2011	Aurélien Decelle Florent Krząkała Cristopher Moore Lenka Zdeborová	1
+ PDF Chat	The scaling window of the 2‐SAT transition	2001	Béla Bollobás Christian Borgs Jennifer Chayes Jeong Han Kim David B. Wilson	1
+ PDF Chat	How many random edges make a dense graph hamiltonian?	2002	Tom Bohman Alan Frieze Ryan R. Martin	1
+	Hamiltonian circuits in random graphs	1976	L. Pósa	1
+	On the computational complexity of Ising spin glass models	1982	Francisco Barahona	1
+ PDF Chat	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	1
+	Representations for partially exchangeable arrays of random variables	1981	David Aldous	1
+ PDF Chat	The high temperature case for the random K-sat problem	2001	Michel Talagrand	1
+ PDF Chat	The Bethe lattice spin glass revisited	2001	Marc Mézard Giorgio Parisi	1
+ PDF Chat	Embedding Spanning Trees in Random Graphs	2010	Michael Krivelevich	1
+	Component behavior near the critical point of the random graph process	1990	Tomasz Łuczak	1
+	The Monge-Kantorovich problem: achievements, connections, and perspectives	2012	В. И. Богачев Александр Викторович Колесников	1
+	Counting good truth assignments of random k-SAT formulae	2006	Andrea Montanari Devavrat Shah	1
+	The statistics of Curie-Weiss models	1978	Richard S. Ellis Charles M. Newman	1
+	Spin glass models from the point of view of spin distributions	2013	Dmitry Panchenko	1
+ PDF Chat	The capacity of adaptive group testing	2013	Leonardo Baldassini Oliver Johnson Matthew Aldridge	1
+ PDF Chat	Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms	2011	Chun Lam Chan Pak Hou Sidharth Jaggi Venkatesh Saligrama	1
+ PDF Chat	The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs	2012	Allan Sly Nike Sun	1
+ PDF Chat	Embedding nearly-spanning bounded degree trees	2007	Noga Alon Michael Krivelevich Benny Sudakov	1
+	Quick Approximation to Matrices and Applications	1999	Alan Frieze Ravi Kannan	1
+	The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary	1967	M. R. Krom	1
+	On large matchings and cycles in sparse random graphs	1986	Alan Frieze	1
+	Message-passing algorithms for compressed sensing	2009	David L. Donoho Arian Maleki Andrea Montanari	1
+ PDF Chat	Limits of dense graph sequences	2006	László Lovász Balázs Szegedy	1
+	Limit distribution for the existence of hamiltonian cycles in a random graph	1983	János Komlós Endre Szemerédi	1
+	Spanning Subgraphs of Random Graphs	2000	Oliver Riordan	1
+	On the chromatic number of random regular graphs	2015	Amin Coja‐Oghlan Charilaos Efthymiou Samuel Hetterich	1
+	Probabilistic Symmetries and Invariance Principles	2005	Olav Kallenberg	1