{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:35:05Z","timestamp":1774949705200,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MI 1794\/1-1"],"award-info":[{"award-number":["MI 1794\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,18]]},"DOI":"10.1145\/2588555.2610510","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"1507-1518","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Tracking set correlations at large scale"],"prefix":"10.1145","author":[{"given":"Foteini","family":"Alvanaki","sequence":"first","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Sebastian","family":"Michel","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484702.2484705"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247636"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Third Edition. The MIT Press , 3 rd edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39940-9_87"},{"key":"e_1_3_2_1_6_1","volume-title":"Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices. IBM Technical Disclosure Bulletin, 15(3)","author":"Donath W.","year":"1972","unstructured":"W. Donath and A. Hoffman . Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices. IBM Technical Disclosure Bulletin, 15(3) , 1972 . W. Donath and A. Hoffman. Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices. IBM Technical Disclosure Bulletin, 15(3), 1972."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488330"},{"key":"e_1_3_2_1_8_1","volume-title":"Algorithms and Theory of Computation","author":"Eppstein D.","year":"1999","unstructured":"D. Eppstein , Z. Galil , and G. F. Italiano . Dynamic graph algorithms . Algorithms and Theory of Computation , 1999 . D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. Algorithms and Theory of Computation, 1999."},{"key":"e_1_3_2_1_9_1","volume-title":"Publication of the Mathematical Institute of the Hungarian Academy of Sciences","author":"Erdos P.","year":"1960","unstructured":"P. Erdos and A. R\u00e9nyi . On the evolution of random graphs . In Publication of the Mathematical Institute of the Hungarian Academy of Sciences , 1960 . P. Erdos and A. R\u00e9nyi. On the evolution of random graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 1960."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0106-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224228"},{"key":"e_1_3_2_1_12_1","volume-title":"An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, 49(2)","author":"Kernighan B.","year":"1970","unstructured":"B. Kernighan and S. Lin . An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, 49(2) , 1970 . B. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, 49(2), 1970."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508857.1508861"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807306"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963246"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339704"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835643"},{"key":"e_1_3_2_1_19_1","unstructured":"Storm: Distributed and fault-tolerant realtime computation. http:\/\/storm-project.net\/.  Storm: Distributed and fault-tolerant realtime computation. http:\/\/storm-project.net\/."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2064014"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2389686.2389704"}],"event":{"name":"SIGMOD\/PODS'14: International Conference on Management of Data","location":"Snowbird Utah USA","acronym":"SIGMOD\/PODS'14","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2610510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2588555.2610510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:49Z","timestamp":1750230049000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2610510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":21,"alternative-id":["10.1145\/2588555.2610510","10.1145\/2588555"],"URL":"https:\/\/doi.org\/10.1145\/2588555.2610510","relation":{},"subject":[],"published":{"date-parts":[[2014,6,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}