The satisfiability threshold for random linear equations P Ayre, A Coja-Oghlan, P Gao, N Müller Combinatorica 40 (2), 179-235, 2020 | 31 | 2020 |
The replica symmetric phase of random constraint satisfaction problems A Coja-Oghlan, T Kapetanopoulos, N Müller Combinatorics, Probability and Computing 29 (3), 346-422, 2020 | 19 | 2020 |
The number of satisfying assignments of random 2‐SAT formulas D Achlioptas, A Coja‐Oghlan, M Hahn‐Klimroth, J Lee, N Müller, ... Random structures & algorithms 58 (4), 609-647, 2021 | 15 | 2021 |
Near optimal efficient decoding from pooled data M Hahn-Klimroth, N Müller Conference on Learning Theory, 3395-3409, 2022 | 12 | 2022 |
Inference and mutual information on random factor graphs A Coja-Oghlan, M Hahn-Klimroth, P Loick, N Müller, K Panagiotou, ... arXiv preprint arXiv:2007.07494, 2020 | 9 | 2020 |
The hitting time of clique factors A Heckel, M Kaufmann, N Müller, M Pasch arXiv preprint: arXiv:2302.08340, 2023 | 6 | 2023 |
Belief propagation on the random k-SAT model A Coja-Oghlan, N Müller, JB Ravelomanana The Annals of Applied Probability 32 (5), 3718-3796, 2022 | 6 | 2022 |
Belief Propagation on the random -SAT model A Coja-Oghlan, N Müller, JB Ravelomanana arXiv preprint arXiv:2011.02303, 2020 | 6 | 2020 |
The CLT analogue for cyclic urns NS Müller, R Neininger 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and …, 2016 | 6 | 2016 |
Der gesprungene Ring: wie man die Seele gewinnt und verliert KE Müller, N Müller Lembeck, 1997 | 6 | 1997 |
The full rank condition for sparse random matrices A Coja-Oghlan, P Gao, M Hahn-Klimroth, J Lee, N Müller, M Rolvien arXiv preprint arXiv:2112.14090, 2021 | 5 | 2021 |
Refined asymptotics for the composition of cyclic urns N Müller, R Neininger | 5 | 2018 |
The rank of sparse symmetric matrices over arbitrary fields R van der Hofstad, N Müller, H Zhu Random Structures & Algorithms, 2024 | 3 | 2024 |
On a Near-Optimal\& Efficient Algorithm for the Sparse Pooled Data Problem M Hahn-Klimroth, R van der Hofstad, N Müller, C Riddlesden arXiv preprint arXiv:2312.14588, 2023 | 3 | 2023 |
Near optimal efficient decoding from pooled data M Hahn-Klimroth, N Müller arXiv preprint arXiv:2108.04342, 2021 | 3 | 2021 |
The random 2-SAT partition function D Achlioptas, A Coja-Oghlan, M Hahn-Klimroth, J Lee, N Müller, ... arXiv preprint arXiv:2002.03690, 2020 | 3 | 2020 |
Refined asymptotics for the number of leaves of random point quadtrees M Fuchs, NS Müller, H Sulzbach 29th International Conference on Probabilistic, Combinatorial and Asymptotic …, 2018 | 3 | 2018 |
The number of random 2-SAT solutions is asymptotically log-normal A Chatterjee, A Coja-Oghlan, N Müller, C Riddlesden, M Rolvien, ... arXiv preprint arXiv:2405.03302, 2024 | 2 | 2024 |
Sharp Thresholds for Factors in Random Graphs F Burghart, A Heckel, M Kaufmann, N Müller, M Pasch arXiv preprint arXiv:2411.14138, 2024 | | 2024 |
The hitting time of nice factors F Burghart, M Kaufmann, N Müller, M Pasch arXiv preprint arXiv:2409.17764, 2024 | | 2024 |