{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:26:13Z","timestamp":1725517573497},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333491"},{"type":"electronic","value":"9783642333507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33350-7_6","type":"book-chapter","created":{"date-parts":[[2012,9,20]],"date-time":"2012-09-20T08:36:18Z","timestamp":1348130178000},"page":"52-62","source":"Crossref","is-referenced-by-count":1,"title":["Generating Expander Graphs Using Cellular Automata"],"prefix":"10.1007","author":[{"given":"Debdeep","family":"Mukhopadhyay","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Goldreich, O.: Candidate One-Way Functions Based on Expander Graphs. Cryptology ePrint Archive, Report 2000\/063 (2000)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Charles, D.X., Lauter, K.E., Goren, E.Z.: Cryptographic Hash Functions from Expander Graphs. Journal of Cryptology (2007)","DOI":"10.1007\/s00145-007-9002-x"},{"key":"6_CR3","unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and its Application, vol.\u00a01. IEEE Computer Society Press (1997)"},{"key":"6_CR4","unstructured":"Linial, N., Wigderson, A.: Expander graphs and their applications, (2003), \n                    \n                      http:\/\/www.math.ias.edu\/boaz\/ExpanderCourse\/"},{"issue":"3","key":"6_CR5","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"},{"issue":"4","key":"6_CR6","first-page":"71","volume":"9","author":"G.A. Margulis","year":"1973","unstructured":"Margulis, G.A.: Explicit constructions of expanders. Problemy Pereda\u010di Informacii\u00a09(4), 71\u201380 (1973)","journal-title":"Problemy Pereda\u010di Informacii"},{"issue":"1","key":"6_CR7","first-page":"51","volume":"24","author":"G.A. Margulis","year":"1988","unstructured":"Margulis, G.A.: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii\u00a024(1), 51\u201360 (1988)","journal-title":"Problemy Peredachi Informatsii"},{"key":"6_CR8","unstructured":"Panjwani, S.K.: An Experimental Evaluation of Goldreich\u2019s One-Way Function, Cryptology ePrint Archive, Report 2000\/063 (2001)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02579382","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigen Values, Geometric Expanders, Sorting in Rounds and Ramsey Theorem. Combinatorica\u00a06, 207\u2013219 (1986)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33350-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:29Z","timestamp":1620129929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33350-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333491","9783642333507"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33350-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}