{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:05:04Z","timestamp":1725674704857},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_4","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T10:19:29Z","timestamp":1334053169000},"page":"37-48","source":"Crossref","is-referenced-by-count":0,"title":["Erd\u0151s-R\u00e9nyi Sequences and Deterministic Construction of Expanding Cayley Graphs"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prajakta","family":"Nimbhorkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"81","volume":"18","author":"V. Arvind","year":"2011","unstructured":"Arvind, V., Mukhopadhyay, P., Nimbhorkar, P.: Erd\u00f6s-R\u00e9nyi Sequences and Deterministic Construction of Expanding Cayley Graphs. Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 81 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/rsa.3240050203","volume":"5","author":"N. Alon","year":"1994","unstructured":"Alon, N., Roichman, Y.: Random Cayley Graphs and Expanders. Random Struct. Algorithms\u00a05(2), 271\u2013285 (1994)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02806383","volume":"14","author":"P. Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: Probabilistic methods in group theory. Journal D\u2019analyse Mathematique\u00a014(1), 127\u2013138 (1965)","journal-title":"Journal D\u2019analyse Mathematique"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1214\/154957805100000087","volume":"2","author":"M. Hildebrand","year":"2005","unstructured":"Hildebrand, M.: A survey of results on random random walks on finite groups. Probability Surveys\u00a02, 33\u201363 (2005)","journal-title":"Probability Surveys"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. AMS\u00a043(4), 439\u2013561 (2006)","journal-title":"Bull. AMS"},{"key":"4_CR6","unstructured":"Kale, S.: Efficient algorithms using the multiplicative weights update method (thesis). Technical Report, TR-804-07 (2007)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Montenegro, R., Tetali, P.: Mathematical Aspects of Mixing Times in Markov Chains. Foundations and Trends in Theoretical Computer Science, 1(3) (2005)","DOI":"10.1561\/0400000003"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/3-540-48481-7_45","volume-title":"Algorithms - ESA\u201999","author":"I. Pak","year":"1999","unstructured":"Pak, I.: Random Cayley Graphs with O(log\u2009\u2223\u2009G\u2009\u2223\u2009) Generators Are Expanders. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 521\u2013526. Springer, Heidelberg (1999)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MCSE.2006.30","volume":"8","author":"D. Randall","year":"2006","unstructured":"Randall, D.: Rapidly Mixing Markov Chains with Applications in Computer Science and Physics. Computing in Science and Engg.\u00a08(2), 30\u201341 (2006)","journal-title":"Computing in Science and Engg."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.4086\/toc.2008.v004a003","volume":"4","author":"A. Wigderson","year":"2008","unstructured":"Wigderson, A., Xiao, D.: Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory of Computing\u00a04(1), 53\u201376 (2008)","journal-title":"Theory of Computing"},{"key":"4_CR12","unstructured":"Zouzias, A.: A matrix hyperbolic cosine algorithm and applications. CoRR, abs\/1103.2793 (2011)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:35:39Z","timestamp":1620113739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}