• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Expander Graphs and their Applications (2003)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.huji.ac.il]
  • [www.math.ias.edu]
  • [www.distcomp.ethz.ch]
  • [disco.ethz.ch]
  • [dcg.ethz.ch]
  • [dcg.ethz.ch]
  • [disco.ethz.ch]
  • [distcomp.ethz.ch]
  • [distcomp.ethz.ch]
  • [www.distcomp.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.cs.huji.ac.il]
  • [www.math.u-bordeaux1.fr]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Nati Linial , Avi Wigderson
Citations:113 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Linial03expandergraphs,
    author = {Nati Linial and Avi Wigderson},
    title = {Expander Graphs and their Applications},
    year = {2003}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Contents 1 The Magical Mystery Tour 7 1.1 Some Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.1 Hardness results for linear transformation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.2 Error Correcting Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.1.3 De-randomizing Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.2 Magical Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.2.1 A Super Concentrator with O(n) edges . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 1.2.2 Error Correcting Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 1.2.3 De-randomizing Random Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 1.3 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Citations

7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
4404 The Mathematical Theory of Communication - Shannon, Weaver - 1963
1950 Computational complexity - Papadimitriou - 1994
1605 The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
1577 An Introduction to Probability Theory and Its Applications Volume I. 3rd edition - Feller - 1968
1567 Randomized Algorithms - Motwani, Raghavan - 1995
1346 Renyi A: On the evolution of random graphs - Erdos - 1960
1051 and Functional analysis - Real - 1993
969 Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
605 Proof Verification and the Hardness of Approximation Problems - Arora, Lund, et al. - 1998
600 Random graphs - Janson, Luczak, et al. - 2000
514 Graph Theory - Diestel - 2000
445 An algorithm for the machine calculation of complex fourier series - Cooley, Tukey - 1965
413 Introduction to the Theory of Computation - Sipser - 1997
376 The geometry of graphs and some of its algorithmic applications - Linial, London, et al. - 1995
358 Reducibility among combinatorial problems, in Complexity of computer computations - Karp - 1972
319 Probabilistic checking of proofs: a new characterization of NP - Arora, Safra - 1998
304 Linear Representations of Finite Groups - Serre - 1977
291 Extensions of Lipschitz mapping into Hilbert space - Johnson, Lindenstrauss - 1984
289 Eigenvalues and expanders - Alon - 1986
284 A recursive approach to low complexity codes - Tanner - 1981
279 Low density parity check codes - Gallager
275 Error detecting and error correcting codes - Hamming - 1950
271 A Course in Combinatorics - Lint, Wilson - 1992
270 Design of capacity-approaching irregular low-density parity-check codes - Richardson, Shokrollahi, et al. - 2001
264 Ramanujan graphs - Lubotzky, Phillips, et al. - 1988
253 A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries - Jerrum, Sinclair, et al.
243 On Lipschitz embedding of finite metric spaces in Hilbert space - Bourgain - 1985
234 Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms - Leighton, Rao
231 Combinatorial Problems and Exercises - Lovász - 1993
221 The capacity of low-density parity-check codes under message-passing decoding - Richardson, Urbanke - 2001
221 Expander codes - Sipser, Spielman - 1710
216 Approximate counting, uniform generation and rapidly mixing Markov chains - Sinclair, Jerrum - 1989
203 The Markov chain Monte Carlo method: An approach to approximate counting and integration - Jerrum, Sinclair - 1996
197 Randomness is linear in space - Nisan, Zuckerman - 1996
190 The influence of variables on Boolean functions - Kahn, Kalai, et al. - 1988
185 Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators - Margulis - 1988
179 An O(n log n) sorting network - Ajtai, Koml'os, et al. - 1983
175 Expander flows, geometric embeddings and graph partitioning - Arora, Rao, et al. - 2004
175 Approximating clique is almost NP-complete - Feige, Goldwasser, et al. - 1991
167 The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization - Alon, Spencer - 2008
163 Probabilistic algorithm for testing primality - Rabin - 1980
159 lower bound for the smallest eigenvalue of the Laplacian - Cheeger, “A - 1970
156 Filling Riemannian manifolds - Gromov - 1983
154 Approximate graph coloring by semidefinite programming - Karger, Motwani, et al. - 1994
148 Random walks, universal traversal sequences, and the complexity of maze problems - Aleliunas, Karp, et al. - 1979
146 Discrete groups, expanding graphs and invariant measures, with an appendix by Jonathan D. Rogawski. Reprint of the 1994 edition. Modern Birkhäuser Classics. Birkhäuser Verlag - Lubotzky - 2010
137 λ1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
137 Generating random regular graphs - Wormald - 1984
134 Clique is hard to approximate within n 1−ɛ - H˚astad - 1999
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University