{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:28Z","timestamp":1725558808038},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_5","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T15:03:26Z","timestamp":1278255806000},"page":"66-85","source":"Crossref","is-referenced-by-count":6,"title":["Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[]},{"given":"Asaf","family":"Nussboim","sequence":"additional","affiliation":[]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.2307\/2006975","volume":"117","author":"L.M. Adleman","year":"1983","unstructured":"Adleman, L.M., Pomerance, C., Rumely, R.S.: On Distinguishing Prime Numbers from Composite Numbers. Annals of Mathematics\u00a0117(1), 173\u2013206 (1983)","journal-title":"Annals of Mathematics"},{"key":"5_CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley and Sons, Chichester (1992)"},{"key":"5_CR3","unstructured":"Babai, L.: Character Sums, Weil\u2019s Estimates, and Paradoxical Tournaments, lecture notes, http:\/\/people.cs.uchicago.edu\/~laci\/reu02.dir\/paley.pdf"},{"key":"5_CR4","volume-title":"Random Graphs","author":"B. Bollob\u00b4as","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, London (1985)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: Cliques in Random Graphs. Cambridge Philosophical Society Mathematical Proc.\u00a080, 419\u2013427 (1976)","journal-title":"Cambridge Philosophical Society Mathematical Proc."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F.R.K. Chung","year":"1989","unstructured":"Chung, F.R.K., Graham, R.L., Wilson, R.M.: Quasi-random graphs. Combinatorica\u00a09, 345\u2013362 (1989)","journal-title":"Combinatorica"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"Ehrenfeucht, A.: An Application of Games to the Completeness Problem for Formalized Theories. Fundamenta Mathematicae\u00a049, 129\u2013141 (1961)","journal-title":"Fundamenta Mathematicae"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.4064\/aa-58-4-363-385","volume":"58","author":"P. Erd\u00f6s","year":"1991","unstructured":"Erd\u00f6s, P., Pomerance, C., Schmutz, E.: Carmichael\u2019s Lambda Function. Acta Arithmetica\u00a058, 363\u2013385 (1991)","journal-title":"Acta Arithmetica"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1017\/S0022481200051756","volume":"41","author":"R. Fagin","year":"1969","unstructured":"Fagin, R.: Probabilities in Finite Models. Journal of Symbolic Logic\u00a041, 50\u201358 (1969)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-642-60539-0_27","volume-title":"Foundations of Computational Mathematics","author":"S. Gao","year":"1997","unstructured":"Gao, S., Panario, D.: Tests and Constructions of Irreducible Polynomials Over Finite Fields. In: Cucker, F., Shub, M. (eds.) Foundations of Computational Mathematics, pp. 346\u2013361. Springer, Heidelberg (1997)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01071084","volume":"5","author":"Y.V. Glebskii","year":"1976","unstructured":"Glebskii, Y.V., Kogan, D.I., Liagonkii, M.I., Talanov, V.A.: Range and Degree of Realizability of Formulas in the Restricted Predicate Calculus. Cybernetics\u00a05, 142\u2013154 (1976)","journal-title":"Cybernetics"},{"issue":"4","key":"5_CR12","first-page":"276","volume":"33","author":"O. Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM\u00a033(4), 276\u2013288 (1985)","journal-title":"Journal of the ACM"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Nussboim, A.: On the Implementation of Huge Random Objects. In: Proc. 44th IEEE Symposium on Foundations of Computer Science, pp. 68\u201379 (2003)","DOI":"10.1109\/SFCS.2003.1238182"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","volume":"14","author":"R.L. Graham","year":"1971","unstructured":"Graham, R.L., Spencer, J.H.: A Constructive Solution to a Tournament Problem. Canadian Math Bulletin\u00a014, 45\u201348 (1971)","journal-title":"Canadian Math Bulletin"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudo-Random Generator from any One-Way Function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-random Graphs. (preprint), http:\/\/www.math.princeton.edu\/~bsudakov\/papers.html"},{"key":"5_CR17","unstructured":"Nussboim, A.: Huge Pseudo-Random Graphs that Preserve Global Properties of Random Graphs, M.Sc. Thesis, Advisor: S. Goldwasser, Weizmann Institute of Science (2003), http:\/\/www.wisdom.weizmann.ac.il\/~asafn\/psdgraphs.ps"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An Improved Algorithm for Computing Logarithms Over GF(p) and Its Cryptographic Significance. IEEE Transactions on Information Theory\u00a0IT-24, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04538-1","volume-title":"The Strange Logic of Random Graphs","author":"J.H. Spencer","year":"2001","unstructured":"Spencer, J.H.: The Strange Logic of Random Graphs. Springer, Heidelberg (2001)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1090\/S0025-5718-1990-0993933-0","volume":"54","author":"V. Shoup","year":"1990","unstructured":"Shoup, V.: New Algorithms for Finding Irreducible Polynomials over Finite Fields. Mathematics of Computation\u00a054, 435\u2013447 (1990)","journal-title":"Mathematics of Computation"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1090\/S0025-5718-1992-1106981-9","volume":"58","author":"V. Shoup","year":"1992","unstructured":"Shoup, V.: Searching for primitive roots in finite fields. Mathematics of Computation\u00a058, 369\u2013380 (1992)","journal-title":"Mathematics of Computation"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1090\/S0894-0347-1988-0924703-8","volume":"1","author":"J.H. Spencer","year":"1988","unstructured":"Spencer, J.H., Shelah, S.: Zero-One Laws for Sparse Random Graphs. Journal of the American Mathematical Society\u00a01, 97\u2013115 (1988)","journal-title":"Journal of the American Mathematical Society"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Thomason, A.: Pseudo-random graphs. In: Proceedings of Random Graphs, Annals of Discrete Mathematics, vol.\u00a033, pp. 307\u2013331 (1987)","DOI":"10.1016\/S0304-0208(08)73063-9"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:56Z","timestamp":1605741836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}