Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Linial, Nathan
and
Peled, Yuval
2016.
On the phase transition in random simplicial complexes.
Annals of Mathematics,
Vol. 184,
Issue. 3,
p.
745.
Balister, Paul
Bollobás, Béla
and
Morris, Robert
2018.
The sharp threshold for making squares.
Annals of Mathematics,
Vol. 188,
Issue. 1,
Weaver, Sean A.
Roberts, Hannah J.
and
Smith, Michael J.
2018.
Theory and Applications of Satisfiability Testing – SAT 2018.
Vol. 10929,
Issue. ,
p.
401.
Grover, Aditya
Achim, Tudor
and
Ermon, Stefano
2019.
Streamlining variational inference for constraint satisfaction problems.
Journal of Statistical Mechanics: Theory and Experiment,
Vol. 2019,
Issue. 12,
p.
124006.
Coja-Oghlan, Amin
Cooley, Oliver
Kang, Mihyun
and
Skubch, Kathrin
2019.
Core forging and local limit theorems for the k-core of random graphs.
Journal of Combinatorial Theory, Series B,
Vol. 137,
Issue. ,
p.
178.
Coja-Oghlan, Amin
Kapetanopoulos, Tobias
and
Müller, Noela
2020.
The replica symmetric phase of random constraint satisfaction problems.
Combinatorics, Probability and Computing,
Vol. 29,
Issue. 3,
p.
346.
Genuzio, Marco
Ottaviano, Giuseppe
and
Vigna, Sebastiano
2020.
Fast scalable construction of ([compressed] static | minimal perfect hash) functions.
Information and Computation,
Vol. 273,
Issue. ,
p.
104517.
Ayre, Peter
Coja-Oghlan, Amin
Gao, Pu
and
Müller, Noëla
2020.
The Satisfiability Threshold For Random Linear Equations.
Combinatorica,
Vol. 40,
Issue. 2,
p.
179.
Kim, Daesung
and
Chung, Hye Won
2021.
Binary Classification With XOR Queries: Fundamental Limits and an Efficient Algorithm.
IEEE Transactions on Information Theory,
Vol. 67,
Issue. 7,
p.
4588.
Achlioptas, Dimitris
Coja‐Oghlan, Amin
Hahn‐Klimroth, Max
Lee, Joon
Müller, Noëla
Penschuck, Manuel
and
Zhou, Guangyan
2021.
The number of satisfying assignments of random 2‐SAT formulas.
Random Structures & Algorithms,
Vol. 58,
Issue. 4,
p.
609.
Coja-Oghlan, Amin
Müller, Noela
and
Ravelomanana, Jean B.
2022.
Belief propagation on the random k-SAT model.
The Annals of Applied Probability,
Vol. 32,
Issue. 5,
Nam, Danny
Sly, Allan
and
Sohn, Youngtak
2022.
One-step replica symmetry breaking of random regular NAE-SAT.
p.
310.
Coja‐Oghlan, Amin
Ergür, Alperen A.
Gao, Pu
Hetterich, Samuel
and
Rolvien, Maurice
2023.
The rank of sparse random matrices.
Random Structures & Algorithms,
Vol. 62,
Issue. 1,
p.
68.
Monterubbiano, Andrea
Azorin, Raphael
Castellano, Gabriele
Gallo, Massimo
Pontarelli, Salvatore
and
Rossi, Dario
2023.
SPADA: A Sparse Approximate Data Structure Representation for Data Plane Per-flow Monitoring.
Proceedings of the ACM on Networking,
Vol. 1,
Issue. CoNEXT3,
p.
1.
Altschuler, Dylan J.
2023.
Critical window of the symmetric perceptron.
Electronic Journal of Probability,
Vol. 28,
Issue. none,
Sah, Ashwin
and
Sawhney, Mehtaab
2023.
Distribution of the threshold for the symmetric perceptron.
p.
2369.
Coja-Oghlan, Amin
Kang, Mihyun
Krieg, Lena
and
Rolvien, Maurice
2023.
The k-XORSAT threshold revisited.
p.
298.
Newman, Andrew
2023.
Abelian groups from random hypergraphs.
Combinatorics, Probability and Computing,
p.
1.
Ding, Rui
Yang, Shibo
Chen, Xiang
and
Huang, Qun
2023.
BitSense: Universal and Nearly Zero-Error Optimization for Sketch Counters with Compressive Sensing.
p.
220.
Monterubbiano, Andrea
Langlet, Jonatan
Walzer, Stefan
Antichi, Gianni
Reviriego, Pedro
and
Pontarelli, Salvatore
2023.
Lightweight Acquisition and Ranging of Flows in the Data Plane.
Proceedings of the ACM on Measurement and Analysis of Computing Systems,
Vol. 7,
Issue. 3,
p.
1.