Fetching the paper…
Reading the bibliography…
We present a new explicit construction of onesided bipartite lossless expanders of constant degree, with arbitrary constant ratio between the sizes of the two vertex sets.
Explicit constructions of expanders
Grigorii Aleksandrovich Margulis · 1973
Earlier work this paper cites.
Ramanujan graphs
A. Lubotzky, R. Phillips, and P. Sarnak · 1988
Earlier work this paper cites.
Constructing disjoint paths on expander graphs
D. Peleg and E. Upfal · 1989
Earlier work this paper cites.
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
M. Morgenstern · 1994
Earlier work this paper cites.
Eigenvalues and expansion of regular graphs
Nabil Kahale · 1995
Earlier work this paper cites.
On-Line Algorithms for Path Selection in a Nonblocking Network
Sanjeev Arora, F. T. Leighton, and Bruce M. Maggs · 1996
Earlier work this paper cites.
Expander codes
M. Sipser and D.A. Spielman · 1996
Earlier work this paper cites.
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach
Andrei Z. Broder, Alan M. Frieze, and Eli Upfal · 1999
Earlier work this paper cites.
Lower bounds for polynomial calculus: non-binomial case
M. Alekhnovich and A.A. Razborov · 2001
Earlier work this paper cites.
Short proofs are narrow—resolution made simple
Eli Ben-Sasson and Avi Wigderson · 2001
Earlier work this paper cites.
Explicit unique-neighbor expanders
N. Alon and M. Capalbo · 2002
Earlier work this paper cites.
Randomness conductors and constant-degree lossless expanders
Michael Capalbo, Omer Reingold, Salil Vadhan, and Avi Wigderson · 2002
Earlier work this paper cites.
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
Omer Reingold, Salil Vadhan, and Avi Wigderson · 2002
Earlier work this paper cites.
Pseudorandom Generators in Propositional Proof Complexity
Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, and Avi Wigderson · 2004
Earlier work this paper cites.
Explicit constructions of Ramanujan complexes of type $\tilde{A}_d$
Alexander Lubotzky, Beth Samuels, and Uzi Vishne · 2005
Earlier work this paper cites.
Ramanujan complexes of type $\tilde{A}_d$
Alexander Lubotzky, Beth Samuels, and Uzi Vishne · 2005
Cited alongside, same era.
Lossless Condensers, Unbalanced Expanders, And Extractors
Amnon Ta-Shma*, Christopher Umans†, and David Zuckerman‡ · 2007
Cited alongside, same era.
Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs
Weiyu Xu and Babak Hassibi · 2007
Cited alongside, same era.
Near-Optimal Sparse Recovery in the L1 Norm
Piotr Indyk and Milan Ruzic · 2008
Cited alongside, same era.
Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes
Venkatesan Guruswami, Christopher Umans, and Salil Vadhan · 2009
Cited alongside, same era.
Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
Sina Jafarpour, Weiyu Xu, Babak Hassibi, and Robert Calderbank · 2009
Cited alongside, same era.
Spectral gap in random bipartite biregular graphs and applications
Gerandy Brito, Ioana Dumitriu, and Kameron Decker Harris · 2022
Later among the works it cites.
lp-Spread and Restricted Isometry Properties of Sparse Random Matrices
Venkatesan Guruswami, Peter Manohar, and Jonathan Mosheiff · 2022
Later among the works it cites.
Essential coding theory
Venkatesan Guruswami, Atri Rudra, and Madhu Sudan · 2022
Later among the works it cites.
Unbalanced Expanders from Multiplicity Codes
Itay Kalev and Amnon Ta-Shma · 2022
Later among the works it cites.
$c^3$-Locally Testable Codes from Lossless Expanders, January 2022
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Later among the works it cites.
Good quantum LDPC codes with linear time decoder from lossless expanders
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hyper-regular graphs and high dimensional expanders
Ehud Friedgut and Yonatan Iluz · 2010
Cited alongside, same era.
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
Avraham Ben-Aroya and Amnon Ta-Shma · 2011
Cited alongside, same era.
Pseudorandomness
Salil P. Vadhan · 2012
Cited alongside, same era.
Restricted Isometry Property for General p-Norms
Zeyuan Allen-Zhu, Rati Gelashvili, and Ilya Razenshteyn · 2015
Cited alongside, same era.
Symmetric unique neighbor expanders and good LDPC codes
Oren Becker · 2016
Cited alongside, same era.
Construction of new local spectral high dimensional expanders
Tali Kaufman and Izhar Oppenheim · 2018
Cited alongside, same era.
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Later among the works it cites.
Quantum Tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
High-Dimensional Expanders from Chevalley Groups
Ryan O’Donnell and Kevin Pratt · 2022
Later among the works it cites.
Bipartite unique-neighbour expanders via Ramanujan graphs, January 2023
Ron Asherov and Irit Dinur · 2023
Closest in time.
HDX Condensers
Itay Cohen, Roy Roth, and Amnon Ta-Shma · 2023
Closest in time.
Good Quantum LDPC Codes with Linear Time Decoders
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2023
Closest in time.
Almost Chor-Goldreich Sources and Adversarial Random Walks
Dean Doron, Dana Moshkovitz, Justin Oh, and David Zuckerman · 2023
Closest in time.
An Efficient Decoder for a Linear Distance Quantum LDPC Code
Shouzhen Gu, Christopher A. Pattison, and Eugene Tang · 2023
Closest in time.
Explicit two-sided unique-neighbor expanders, February 2023
Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes · 2023
Closest in time.
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Anthony Leverrier and Gilles Zémor · 2023
Closest in time.