references.bib

https://verbosus.com/bibtex-style-examples.html
http://bib-it.sourceforge.net/help/fieldsAndEntryTypes.php

@misc{par97,
    author       = {V. Pareto},
    title        = {Cours d'\'Economie politique},
    publisher    = {Lausanne: F. Rouge},
    note         = {[In French]},
    year         = 1897
}
@article{yul25,
    author  = {G. U. Yule},
    title   = {A Mathematical Theory of Evolution},
    journal = {Philosophical Transactions of the Royal Society of London},
    volume  = 213,
    pages   = {21-87},
    year    = 1925
}
@article{lot26,
    author  = {A. J. Lotka},
    title   = {The frequency distribution of scientific productivity},
    journal = {Journal of the Washington Academy of Sciences},
    volume  = 16,
    number  = 12,
    pages   = {317-323},
    year    = 1926
}
@book{zip49,
    author    = {G. K. Zipf},
    title     = {Human Behaviour and the Principle of Least Effort},
    publisher = {Addison-Wesley, Cambridge, MA},
    year      = 1949
}
@book{gr54,
    author    = {B. Gutenberg and C. F. Richter},
    title     = {Seismicity of the Earth and Associated Phenomena},
    publisher = {Princeton University Press, Princeton, New Jersey},
    year      = 1954
}
@article{er59,
    author  = {P. Erd\H{o}s and A. R\'enyi},
    title   = {On Random Graphs {I}},
    journal = {Publicationes Mathematicae (Debrecen)},
    volume  = 6,
    pages   = {290-297},
    year    = 1959
}
@article{gil59,
    author  = {E. N. Gilbert},
    title   = {Random Graphs},
    journal = {The Annals of Mathematical Statistics},
    volume  = 30,
    number  = 4,
    pages   = {1141-1144},
    year    = 1959
}
@article{er60,
    author  = {P. Erd\H{o}s and A. R\'enyi},
    title   = {On the evolution of random graphs},
    journal = {Publications of the Mathematical Institute of the Hungarian Academy of Sciences},
    pages   = {17-61},
    year    = 1960
}
@article{hak62,
    author  = {S. Hakimi},
    title   = {On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph},
    journal = {Journal of the Society for Industrial and Applied Mathematics},
    volume  = 10,
    number  = 3,
    pages   = {496-506},
    year    = 1962
}
@article{kb67,
    author  = {A. N. Kolmogorov and Y. M. Barzdin},
    title   = {On the realization of networks in three-dimensional space},
    journal = {Problems of Cybernetics},
    volume  = 19,
    pages   = {261-268},
    note    = {[In Russian]},
    year    = 1967
}
@inproceedings{che69,
    author    = {J. Cheeger},
    title     = {A lower bound for the smallest eigenvalue of the {Laplacian}},
    booktitle = {Proc. of the Princeton conference in honor of Professor S. Bochner},
    pages     = {195-199},
    year      = 1969
}
@inproceedings{pin73,
    author    = {M. S. Pinsker},
    title     = {On the Complexity of a Concentrator},
    booktitle = {Proc. of the 7th Int. Teletraffic Conf.},
    pages     = {318/1-318/4},
    year      = 1973
}
@article{bol88,
    author  = {B. Bollob{\'{a}}s},
    title   = {The Isoperimetric Number of Random Regular Graphs},
    journal = {European Journal of Combinatorics},
    volume  = 9,
    number  = 3,
    pages   = {241-244},
    year    = 1988
}
@inproceedings{mih89,
    author    = {M. Mihail},
    title     = {Conductance and convergence of {Markov} chains --- a combinatorial treatment of expanders},
    booktitle = {Proc. of the 30th Symposium on Foundations of Computer Science},
    pages     = {526-531},
    year      = 1989
}
@article{ls93,
    author  = {N. Linial and M. Saks},
    title   = {Low diameter graph decompositions},
    journal = {Combinatorica},
    volume  = 13,
    number  = 4,
    pages   = {441-454},
    year    = 1993
}
@book{chu97,
    author    = {F. Chung},
    title     = {Spectral Graph Theory},
    publisher = {American Mathematical Society},
    series    = {Regional Conf. Series in Mathematics},
    number    = 92,
    year      = 1997
}
@article{ba99,
    author  = {A.-L. Barab{\'a}si and R. Albert},
    title   = {Emergence of Scaling in Random Networks},
    journal = {Science},
    volume  = 286,
    number  = 5439,
    pages   = {509-512},
    year    = 1999
}
@article{fff99,
    author  = {M. Faloutsos and P. Faloutsos and C. Faloutsos},
    title   = {On Power-law Relationships of the {Internet} Topology},
    journal = {ACM SIGCOMM Computer Communication Review},
    volume  = 29,
    number  = 4,
    pages   = {251-262},
    year    = 1999
}
@article{acl01,
    author  = {W. Aiello and F. Chung and L. Lu},
    title   = {A random graph model for power law graphs},
    journal = {Experimental Mathematics},
    volume  = 10,
    number  = 1,
    pages   = {53-66},
    year    = 2001
}
@article{cl01,
    author  = {F. Chung and L. Lu},
    title   = {The Diameter of Sparse Random Graphs},
    journal = {Advances in Applied Mathematics},
    volume  = 26,
    pages   = {257-279},
    year    = 2001
}
@article{bb03,
    author  = {A.-L. Barab{\'a}si and E. Bonabeau},
    title   = {Scale-Free Networks},
    journal = {Scientific American},
    volume  = 288,
    pages   = {60-69},
    year    = 2003
}
@article{gms03,
    author  = {C. Gkantsidis and M. Mihail and A. Saberi},
    title   = {Conductance and Congestion in Power Law Graphs},
    journal = {ACM SIGMETRICS Performance Evaluation Review},
    volume  = 31,
    number  = 1,
    pages   = {148-159},
    year    = 2003
}
@article{abrw04,
    author  = {M. Alekhnovich and E. Ben-Sasson and A. Razborov and A. Wigderson},
    title   = {Pseudorandom Generators in Propositional Proof Complexity},
    journal = {SIAM Journal on Computing},
    volume  = 34,
    number  = 1,
    pages   = {67-88},
    year    = 2004
}
@article{cl04,
    author  = {F. Chung and L. Lu},
    title   = {The Average Distance in a Random Graph with Given Expected Degrees},
    journal = {Internet Mathematics},
    volume  = 1,
    number  = 1,
    pages   = {91-113},
    year    = 2004
}
@inproceedings{abbimp05,
    author    = {M. Alekhnovich and A. Borodin and J. Buresh-Oppenheim and R. Impagliazzo and A. Magen and T. Pitassi},
    title     = {Toward a model for backtracking and dynamic programming},
    booktitle = {Proc. of the 20th IEEE Conf. on Computational Complexity},
    pages     = {308-322},
    year      = 2005
}
@article{ahi05,
    author  = {M. Alekhnovich and E. A. Hirsch and D. Itsykson},
    title   = {Exponential Lower Bounds for the Running Time of {DPLL} Algorithms on Satisfiable Formulas},
    journal = {Journal of Automated Reasoning},
    volume  = 35,
    number  = 1,
    pages   = {51-72},
    year    = 2005
}
@article{al06,
    author  = {A. Amit and N. Linial},
    title   = {Random Lifts of Graphs: Edge Expansion},
    journal = {Combinatorics, Probability and Computing},
    volume  = 15,
    number  = 3,
    pages   = {317-332},
    year    = 2006
}
@book{cl06,
    author    = {F. Chung and L. Lu},
    title     = {Complex Graphs and Networks},
    publisher = {American Mathematical Society},
    series    = {Regional Conf. Series in Mathematics},
    number    = 107,
    year      = 2006
}
@article{hlw06,
    author  = {S. Hoory and N. Linial and A. Wigderson},
    title   = {Expander Graphs and Their Applications},
    journal = {Bulletin of the American Mathematical Society},
    volume  = 43,
    number  = 4,
    pages   = {439-561},
    year    = 2006
}
@misc{mag06,
    author       = {A. Magen},
    title        = {{CSC 2414H} Lecture Notes: Metric Embeddings},
    publisher    = {Department of Computer Science, University of Toronto},
    howpublished = {\url{http://www.cs.toronto.edu/~avner/teaching/S6-2414/TUT2.pdf}},
    year         = 2006
}
@article{mst06,
    author  = {M. Mihail and A. Saberi and P. Tetali},
    title   = {Random Walks with Lookahead on Power Law Random Graphs},
    journal = {Internet Mathematics},
    volume  = 3,
    number  = 2,
    pages   = {147-152},
    year    = 2006
}
@inproceedings{chu07,
    author    = {F. Chung},
    title     = {Four proofs for the {Cheeger} inequality and graph partition algorithms},
    booktitle = {Proc. of the 4th Int. Congress of Chinese Mathematicians},
    volume    = 2,
    year      = 2007
}
@article{din07,
    author  = {I. Dinur},
    title   = {The {PCP} Theorem by Gap Amplification},
    journal = {Journal of the ACM},
    volume  = 54,
    number  = 3,
    year    = 2007
}
@article{fog08,
    author  = {A. Fog},
    title   = {Calculation Methods for {Wallenius'} Noncentral Hypergeometric Distribution},
    journal = {Communications in Statistics, Simulation and Computation},
    volume  = 37,
    number  = 2,
    pages   = {258-273},
    year    = 2008
}
@misc{hop08,
    author       = {J. Hopcroft},
    title        = {{CS} 683 Lecture Notes: Advanced Design \& Analysis of Algorithms},
    publisher    = {Department of Computer Science, Cornell University},
    howpublished = {\\
                    \href{http://www.cs.cornell.edu/courses/cs683/2008sp/lecture%20notes/Lecture27.pdf}
                    {\nolinkurl{http://www.cs.cornell.edu/courses/cs683/2008sp/}
                    \\
                    \nolinkurl{lecture\%20notes/Lecture27.pdf}}},
    year         = 2008
}
@inproceedings{abl09,
    author    = {C. Ansotegui and M. L. Bonet and J. Levy},
    title     = {Towards Industrial-Like Random {SAT} Instances},
    booktitle = {Proc. of the 21st Int. Joint Conf. on Artificial Intelligence},
    pages     = {387-392},
    year      = 2009
}
@inproceedings{abl09practical,
    author    = {C. Ansotegui and M. L. Bonet and J. Levy},
    title     = {On the Structure of Industrial {SAT} Instances},
    booktitle = {Proc. of the 15th Int. Conf. on Principles and Practice of Constraint Programming},
    pages     = {127-141},
    year      = 2009
}
@misc{mah09,
    author       = {M. Mahoney},
    title        = {{CS369M} Lecture Notes: Algorithms for Modern Massive Data Set Analysis},
    publisher    = {Department of Computer Science, Stanford University},
    howpublished = {\url{https://cs.stanford.edu/people/mmahoney/cs369m/Lectures/lecture11.pdf}},
    year         = 2009
}
@misc{rao12,
    author       = {A. Rao},
    title        = {{CSE531} Lecture Notes: Computational Complexity Theory},
    publisher    = {Department of Computer Science and Engineering, Univerity of Washington},
    howpublished = {\\
                    \href{https://homes.cs.washington.edu/~anuprao/pubs/CSE531Winter12/lecture11.pdf}
                    {\nolinkurl{https://homes.cs.washington.edu/~anuprao/pubs/CSE531Winter12/}
                    \\
                    \nolinkurl{lecture11.pdf}}},
    year         = 2012
}
@book{vad12,
    author    = {S. Vadhan},
    title     = {Pseudorandomness},
    publisher = {Now Foundations and Trends},
    edition   = 1,
    year      = 2012
}
@article{fgrv14,
    author  = {A. Frieze and N. Goyal and L. Rademacher and S. Vempala},
    title   = {Expanders via Random Spanning Trees},
    journal = {SIAM Journal on Computing},
    volume  = 43,
    number  = 2,
    pages   = {497-513},
    year    = 2014
}
@misc{pud15,
    author       = {D. Puder},
    title        = {Expansion of Random Graphs: New Proofs, New Results},
    howpublished = {\url{https://arxiv.org/abs/1212.5216}},
    year         = 2015
}
@inproceedings{ablmo16,
    author    = {Z. {Allen Zhu} and A. Bhaskara and S. Lattanzi and V. Mirrokni and L. Orecchia},
    title     = {Expanders via Local Edge Flips},
    booktitle = {Proc. of the 27th ACM-SIAM Symposium on Discrete Algorithms},
    pages     = {259-269},
    year      = 2016
}
@inproceedings{prst16,
    author    = {T. Pitassi and B. Rossman and R. A. Servedio and L. Tan},
    title     = {Poly-logarithmic {Frege} Depth Lower Bounds via an Expander Switching Lemma},
    booktitle = {Proc. of the 48th ACM Symposium on Theory of Computing},
    pages     = {644-657},
    year      = 2016
}
@article{kri17,
    author  = {M. Krivelevich},
    title   = {Finding and Using Expanders in Locally Sparse Graphs},
    journal = {SIAM Journal on Discrete Mathematics},
    volume  = 32,
    number  = 1,
    pages   = {611-623},
    year    = 2018
}
@article{ms17,
    author  = {G. Moshkovitz and A. Shapira},
    title   = {Decomposing a graph into expanding subgraphs},
    journal = {Random Structures \& Algorithms},
    volume  = 52,
    number  = 1,
    pages   = {158-178},
    year    = 2017
}