Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Yuankai Wang
Omrani, R.
Chugg, K.M.
and
Kumar, P.V.
2004.
Low-density parity-check space-time codes: performance analysis and code construction.
p.
156.
Levitskaya, A. A.
2005.
Systems of Random Equations over Finite Algebraic Structures.
Cybernetics and Systems Analysis,
Vol. 41,
Issue. 1,
p.
67.
Charles, Denis
and
Chellapilla, Kumar
2008.
Algorithms - ESA 2008.
Vol. 5193,
Issue. ,
p.
259.
Dietzfelbinger, Martin
and
Pagh, Rasmus
2008.
Automata, Languages and Programming.
Vol. 5125,
Issue. ,
p.
385.
Aumüller, Martin
Dietzfelbinger, Martin
and
Rink, Michael
2009.
Algorithms - ESA 2009.
Vol. 5757,
Issue. ,
p.
742.
Dietzfelbinger, Martin
and
Rink, Michael
2009.
Automata, Languages and Programming.
Vol. 5555,
Issue. ,
p.
354.
Hreinsson, Jóhannes B.
Krøyer, Morten
and
Pagh, Rasmus
2009.
Algorithms - ESA 2009.
Vol. 5757,
Issue. ,
p.
730.
Dietzfelbinger, Martin
Goerdt, Andreas
Mitzenmacher, Michael
Montanari, Andrea
Pagh, Rasmus
and
Rink, Michael
2010.
Automata, Languages and Programming.
Vol. 6198,
Issue. ,
p.
213.
Fan, Yun
and
Shen, Jing
2011.
On the phase transitions of random k-constraint satisfaction problems.
Artificial Intelligence,
Vol. 175,
Issue. 3-4,
p.
914.
Croot, Ernie
Granville, Andrew
Pemantle, Robin
and
Tetali, Prasad
2012.
On sharp transitions in making squares.
Annals of Mathematics,
Vol. 175,
Issue. 3,
p.
1507.
Aumüller, Martin
Dietzfelbinger, Martin
and
Woelfel, Philipp
2012.
Algorithms – ESA 2012.
Vol. 7501,
Issue. ,
p.
108.
Mazumdar, Arya
Wornell, Gregory W.
and
Chandar, Venkat
2012.
Update efficient codes for error correction.
p.
1558.
Mazumdar, Arya
Chandar, Venkat
and
Wornell, Gregory W.
2014.
Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes.
IEEE Journal on Selected Areas in Communications,
Vol. 32,
Issue. 5,
p.
976.
Darling, Richard
Penrose, Mathew
Wade, Andrew
and
Zabell, Sandy
2014.
Rank deficiency in sparse random GF$[2]$ matrices.
Electronic Journal of Probability,
Vol. 19,
Issue. none,
Bazzi, Louay
and
Audah, Hani
2015.
Impact of Redundant Checks on the LP Decoding Thresholds of LDPC Codes.
IEEE Transactions on Information Theory,
Vol. 61,
Issue. 5,
p.
2240.
Bazzi, Louay
and
Audah, Hani
2015.
Impact of redundant checks on the LP decoding thresholds of LDPC codes.
p.
411.
Neuen, Daniel
and
Schweitzer, Pascal
2018.
An exponential lower bound for individualization-refinement algorithms for graph isomorphism.
p.
138.
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.
Shmuel, Ori
Cohen, Asaf
and
Gurewitz, Omer
2021.
Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling.
IEEE Transactions on Information Theory,
Vol. 67,
Issue. 9,
p.
6243.
Blass, Erik-Oliver
and
Noubir, Guevara
2024.
Forward Security with Crash Recovery for Secure Logs.
ACM Transactions on Privacy and Security,
Vol. 27,
Issue. 1,
p.
1.