Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Expander graph
OpenAlex ID:
C154547637
Expander graphs and their applications
2006
·
Shlomo Hoory
, Nathan Linial
, et al.
·
Bulletin of the American Mathematical Society
·
2,225
Efficient erasure correcting codes
2001
·
M.G. Luby
, M. Mitzenmacher
, et al.
·
IEEE Transactions on Information Theory
·
1,317
Expander codes
1996
·
M. Sipser
, D.A. Spielman
·
IEEE Transactions on Information Theory
·
1,139
Expander flows, geometric embeddings and graph partitioning
2009
·
Sanjeev Arora
, Satish Rao
, et al.
·
Journal of the ACM
·
615
Random walks in peer-to-peer networks
2004
·
C. Gkantsidis
, M. Mihail
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
567
Cryptographic Hash Functions from Expander Graphs
2007
·
Denis X. Charles
, Kristin E. Lauter
, et al.
·
Journal of Cryptology
·
486
PDF
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
2009
·
Venkatesan Guruswami
, Christopher Umans
, et al.
·
Journal of the ACM
·
400
Expander flows, geometric embeddings and graph partitioning
2004
·
Sanjeev Arora
, Satish Rao
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
372
Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check Codes
2003
·
David J.C. MacKay
, Michael S. Postol
·
Electronic Notes in Theoretical Computer Science
·
372
PDF
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
1992
·
N. Alon
, J. Bruck
, et al.
·
IEEE Transactions on Information Theory
·
300
PDF
Random Cayley graphs and expanders
1994
·
Noga Alon
, Yuval Roichman
·
Random Structures and Algorithms
·
295
An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
2018
·
Christian Borgs
, Jennifer Chayes
, et al.
·
Transactions of the American Mathematical Society
·
293
PDF
Randomness conductors and constant-degree lossless expanders
2002
·
Michael Capalbo
, Omer Reingold
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
288
Expander graphs in pure and applied mathematics
2011
·
Alexander Lubotzky
·
Bulletin of the American Mathematical Society
·
266
PDF
Elementary Number Theory, Group Theory and Ramanujan Graphs
2001
·
Giuliana Davidoff
, Peter Sarnak
, et al.
·
Cambridge University Press eBooks
·
264
Random walks in peer-to-peer networks: Algorithms and evaluation
2005
·
Christos Gkantsidis
, Milena Mihail
, et al.
·
Performance Evaluation
·
257
Twice-ramanujan sparsifiers
2009
·
Joshua D. Batson
, Daniel A. Spielman
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
218
Novel architectures for P2P applications: the continuous-discrete approach
2003
·
Moni Naor
, Udi Wieder
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
215
Non-backtracking Random Walks Mix Faster
2007
·
NOGA ALON
, ITAI BENJAMINI
, et al.
·
Communications in Contemporary Mathematics
·
213
PDF
Gradient Coding From Cyclic MDS Codes and Expander Graphs
2020
·
Netanel Raviv
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
200
PDF
Candidate One-Way Functions Based on Expander Graphs
2011
·
Oded Goldreich
·
Lecture notes in computer science
·
193
Graph Partitioning via Adaptive Spectral Techniques
2009
·
AMIN COJA-OGHLAN
·
Combinatorics Probability Computing
·
186
Quantum Expander Codes
2015
·
Anthony Leverrier
, Jean-Pierre Tillich
, et al.
·
Annual Symposium on Foundations of Computer Science
·
182
PDF
Distributed construction of random expander networks
2004
·
C. Law
, K.-Y. Siu
·
IEEE Conference on Computer Communications (INFOCOM)
·
182
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
2003
·
Eli Ben-Sasson
, Madhu Sudan
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
174
PDF
Show more works
View as search
Works count:
1,207
Citation count:
26,000
Year
Topic
Type