{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:47Z","timestamp":1725663767898},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:24:10Z","timestamp":1330262650000},"page":"179-191","source":"Crossref","is-referenced-by-count":1,"title":["On set equality-testing"],"prefix":"10.1007","author":[{"given":"Tak Wah","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ka Hing","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"15_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Ex 2.12, 71\u201371."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"W. Pugh and T. Teitelbaum, Incremental Computation via Function Caching, Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, 1989, 315\u2013328.","DOI":"10.1145\/75277.75305"},{"key":"15_CR3","unstructured":"J.T. Schwartz, On Programming: An Interim Report on the SETL Project, Installments I and II, CIMS New York University, 1974."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(76)90075-2","volume":"5","author":"M. Sassa","year":"1976","unstructured":"M. Sassa and E. Goto, A Hashing Method for Set Operations, Information Processing Letters, 5, 1976, 265\u2013279.","journal-title":"Information Processing Letters"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"R. Sundar and R.E. Tarjan, Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences, Proceedings of the Twentysecond Annual ACM Symposium on Theory of Computing, 1990, 18\u201325.","DOI":"10.1145\/100216.100219"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M.N. Wegman and J.L. Carter, New Hash Functions and Their Use in Authentication and Set Equality, Journal of Computer and System Sciences, 22, 1981, 265\u2013279.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0196-6774(92)90044-D","volume":"13","author":"D. M. Yellin","year":"1992","unstructured":"D.M. Yellin, Representing Sets with Constant Time Equality Testing, Journal of Algorithms, 13, 1992, 353\u2013373; a preliminary version also appeared in the Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, 64\u201373.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:18Z","timestamp":1619572098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}