乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:13Z","timestamp":1725564973981},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_5","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"23-32","source":"Crossref","is-referenced-by-count":1,"title":["A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Woelfel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-68697-5_2","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Atici","year":"1996","unstructured":"Atici, M., Stinson, D.R.: Universal hashing and multiple authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 16\u201330. Springer, Heidelberg (1996)"},{"key":"5_CR2","volume-title":"Design Theory","author":"T. Beth","year":"1999","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn., vol.\u00a01. Cambridge University Press, Cambridge (1999)","edition":"2"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008226810363","volume":"11","author":"J. Bierbrauer","year":"1997","unstructured":"Bierbrauer, J.: Universal hashing and geometric codes. Designs, Codes and Cryptography\u00a011, 207\u2013221 (1997)","journal-title":"Designs, Codes and Cryptography"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR5","volume-title":"The CRC Handbook of Combinatorial Designs","year":"1996","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): The CRC Handbook of Combinatorial Designs, 1st edn. CRC Press, Boca Raton (1996)","edition":"1"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M. Dietzfelbinger","year":"1997","unstructured":"Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. Journal of Algorithms\u00a025, 19\u201351 (1997)","journal-title":"Journal of Algorithms"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer, F.: Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing\u00a023, 738\u2013761 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery\u00a031, 538\u2013544 (1984)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<163::AID-RSA10>3.0.CO;2-P","volume":"9","author":"T. Hofmeister","year":"1996","unstructured":"Hofmeister, T., Lefmann, H.: A combinatorial design approach to MAXCUT. Random Structures and Algorithms\u00a09, 163\u2013173 (1996)","journal-title":"Random Structures and Algorithms"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Holland, M., Gibson, G.: Parity declustering for continuous operation in redundant disk arrays. In: Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 23\u201335 (1992)","DOI":"10.1145\/143365.143383"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y. Mansour","year":"1993","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. Theoretical Computer Science\u00a0107, 121\u2013133 (1993)","journal-title":"Theoretical Computer Science"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1017\/S0963548300000596","volume":"2","author":"V. Nguyen","year":"1993","unstructured":"Nguyen, V., Tuza, Z.: Linear-time approximation algorithms for the max cut problem. Combinatorics, Probability and Computing\u00a02, 201\u2013210 (1993)","journal-title":"Combinatorics, Probability and Computing"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(80)90122-2","volume":"10","author":"D.V. Sarwate","year":"1980","unstructured":"Sarwate, D.V.: A note on universal classes of hash functions. Information Processing Letters\u00a010, 41\u201345 (1980)","journal-title":"Information Processing Letters"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s002240000132","volume":"32","author":"E.J. Schwabe","year":"1999","unstructured":"Schwabe, E.J., Sutherland, I.M.: Flexible usage of redundancy in disk arrays. Theory of Computing Systems\u00a032, 561\u2013587 (1999)","journal-title":"Theory of Computing Systems"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0022-0000(05)80007-8","volume":"48","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Combinatorial techniques for universal hashing. Journal of Computer. Journal of Computer and System Sciences\u00a048, 337\u2013346 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. Designs, Codes and Cryptography\u00a04, 369\u2013380 (1994)","journal-title":"Designs, Codes and Cryptography"},{"key":"5_CR17","first-page":"7","volume":"114","author":"D.R. Stinson","year":"1996","unstructured":"Stinson, D.R.: On the connections between universal hashing, combinatorial designs and error-correcting codes. Congressus Numerantium\u00a0114, 7\u201327 (1996)","journal-title":"Congressus Numerantium"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:42Z","timestamp":1620012402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}