Keyword

expander graphs

Description: Sparse graphs with strong connectivity properties, studied in combinatorics, graph theory, and related areas of mathematics.
Wikidata ID: wiki/Q776602
OpenAlex ID: keywords/expander-graphs
1996 · Fan Chung · Regional conference series in mathematics · 6,669
2009 · Sanjeev Arora, Boaz Barak · 2,370
2009 · Jure Leskovec, Kevin J. Lang, et al. · Internet Mathematics · 1,913
2006 · Shlomo Hoory, Nathan Linial, et al. · Bulletin of the American Mathematical Society · 1,730
1986 · Noga Alon · COMBINATORICA · 1,126
1991 · Bojan Mohar · 1,090
1988 · A. Lubotzky, R. Phillips, et al. · COMBINATORICA · 1,086
1995 · Nathan Linial, Eran London, et al. · COMBINATORICA · 948
1996 · M. Sipser, D.A. Spielman · IEEE Transactions on Information Theory · 939
1985 · N Alon, V.D Milman · Journal of Combinatorial Theory Series B · 833
1994 · Alexander Lubotzky · Birkhäuser Basel eBooks · 668
2006 · Irit Dinur · Journal of the ACM · 562
2004 · C. Gkantsidis, M. Mihail, et al. · IEEE Conference on Computer Communications (INFOCOM) · 526
1987 · Alasdair Urquhart · Journal of the ACM · 475
1982 · Peter Buser · Annales Scientifiques de l École Normale Supérieure · 470
2002 · Omer Reingold, Salil Vadhan, et al. · Annals of Mathematics · 408
1981 · Ofer Gabber, Zvi Galil · Journal of Computer and System Sciences · 399
2011 · Stasys Jukna · Texts in theoretical computer science · 396
2007 · Denis X. Charles, Kristin E. Lauter, et al. · Journal of Cryptology · 395
1989 · A. K. Chandra, P. Raghavan, et al. · ACM Symposium on Theory of Computing (STOC) · 389
2008 · Joel Friedman · Memoirs of the American Mathematical Society · 362
2012 · Salil P. Vadhan · Foundations and Trends® in Theoretical Computer Science · 358
2003 · David J.C. MacKay, Michael S. Postol · Electronic Notes in Theoretical Computer Science · 341
2002 · Goldreich, Ron · Algorithmica · 332
1996 · Ashok K. Chandra, Prabhakar Raghavan, et al. · Computational Complexity · 330
Works count: 2,123
Citation count: 56,510
Year
Topic
Type