乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:25:31Z","timestamp":1725791131458},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,19]]},"DOI":"10.1145\/2384616.2384690","type":"proceedings-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:07:05Z","timestamp":1350893225000},"page":"1017-1034","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Finding reusable data structures"],"prefix":"10.1145","author":[{"given":"Guoqing","family":"Xu","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,10,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1542476.1542503"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/93542.93576"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1869459.1869519"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1449764.1449776"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/s00453-004-1146-6"},{"key":"e_1_3_2_1_6_1","first-page":"408","volume-title":"Reuse, recycle to de-bloat software. In phEuropean Conference on Object-Oriented Programming (ECOOP)","author":"Bhattacharya S.","year":"2011","unstructured":"S. Bhattacharya , M. Nanda , K. Gopinath , and M. Gupta . Reuse, recycle to de-bloat software. In phEuropean Conference on Object-Oriented Programming (ECOOP) , pages 408 -- 432 , 2011 . S. Bhattacharya, M. Nanda, K. Gopinath, and M. Gupta. Reuse, recycle to de-bloat software. In phEuropean Conference on Object-Oriented Programming (ECOOP), pages 408--432, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1375581.1375586"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1167473.1167488"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/320384.320387"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1168857.1168866"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1297027.1297035"},{"key":"e_1_3_2_1_12_1","first-page":"259","volume-title":"Value profiling. In phInternational Symposium on Microarchitecture (MICRO)","author":"Calder B.","year":"1997","unstructured":"B. Calder , P. Feller , and A. Eustace . Value profiling. In phInternational Symposium on Microarchitecture (MICRO) , pages 259 -- 269 , 1997 . B. Calder, P. Feller, and A. Eustace. Value profiling. In phInternational Symposium on Microarchitecture (MICRO), pages 259--269, 1997."},{"key":"e_1_3_2_1_13_1","first-page":"383","volume-title":"Patterns of memory inefficiency. In phEuropean Conference on Object-Oriented Programming (ECOOP)","author":"Chis A. E.","year":"2011","unstructured":"A. E. Chis , N. Mitchell , E. Schonberg , G. Sevitsky , P. O'Sullivan , T. Parsons , and J. Murphy . Patterns of memory inefficiency. In phEuropean Conference on Object-Oriented Programming (ECOOP) , pages 383 -- 407 , 2011 . A. E. Chis, N. Mitchell, E. Schonberg, G. Sevitsky, P. O'Sullivan, T. Parsons, and J. Murphy. Patterns of memory inefficiency. In phEuropean Conference on Object-Oriented Programming (ECOOP), pages 383--407, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/320384.320386"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1453101.1453111"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/647476.727631"},{"key":"e_1_3_2_1_17_1","first-page":"1","volume-title":"Succinct ordinal trees with level-ancestor queries. In phACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Geary R. F.","year":"2004","unstructured":"R. F. Geary , R. Raman , and V. Raman . Succinct ordinal trees with level-ancestor queries. In phACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1 -- 10 , 2004 . R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In phACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1--10, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/604131.604154"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1133651.1133654"},{"key":"e_1_3_2_1_20_1","first-page":"575","volume-title":"Ultra-succinct representation of ordered trees. In phACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Jansson J.","year":"2007","unstructured":"J. Jansson , K. Sadakane , and W.-K. Sung . Ultra-succinct representation of ordered trees. In phACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 575 -- 584 , 2007 . J. Jansson, K. Sadakane, and W.-K. Sung. Ultra-succinct representation of ordered trees. In phACM-SIAM Symposium on Discrete Algorithms (SODA), pages 575--584, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1375634.1375652"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1190216.1190224"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/949305.949333"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/11785477_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1297027.1297046"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/11785477_25"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/978-3-642-03013-0_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/MS.2010.7"},{"key":"e_1_3_2_1_29_1","first-page":"118","volume-title":"Succinct representation of balanced parentheses, static trees and planar graphs. In phIEEE Symposium on Foundations of Computer Science (FOCS)","author":"Munro J.","year":"1997","unstructured":"J. Munro and V. Raman . Succinct representation of balanced parentheses, static trees and planar graphs. In phIEEE Symposium on Foundations of Computer Science (FOCS) , pages 118 -- 126 , 1997 . J. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In phIEEE Symposium on Foundations of Computer Science (FOCS), pages 118--126, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1137\/S0097539799364092"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/1869459.1869482"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/73560.73585"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/1375634.1375651"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/1806596.1806649"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/1542476.1542522"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/1449764.1449775"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/1806651.1806658"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/320384.320400"},{"unstructured":"G. Xu. phAnalyzing Large-Scale Object-Oriented Software to Find and Remove Runtime Bloat. PhD thesis The Ohio State University 2011. G. Xu. phAnalyzing Large-Scale Object-Oriented Software to Find and Remove Runtime Bloat. PhD thesis The Ohio State University 2011.","key":"e_1_3_2_1_39_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1145\/1368088.1368110"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/1806596.1806616"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/1542476.1542523"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/1806596.1806617"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/1882362.1882448"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1145\/1993498.1993530"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1007\/978-3-642-31057-7_32"},{"key":"e_1_3_2_1_47_1","first-page":"134","volume-title":"Uncovering performance problems in Java applications with reference propagation profiling. In phInternational Conference on Software Engineering (ICSE)","author":"Yan D.","year":"2012","unstructured":"D. Yan , G. Xu , and A. Rountev . Uncovering performance problems in Java applications with reference propagation profiling. In phInternational Conference on Software Engineering (ICSE) , pages 134 -- 144 , 2012 . D. Yan, G. Xu, and A. Rountev. Uncovering performance problems in Java applications with reference propagation profiling. In phInternational Conference on Software Engineering (ICSE), pages 134--144, 2012."},{"unstructured":"X. Zhang. phFault Localization via Precise Dynamic Slicing. PhD thesis University of Arizona 2006. X. Zhang. phFault Localization via Precise Dynamic Slicing. PhD thesis University of Arizona 2006.","key":"e_1_3_2_1_48_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1145\/996841.996855"},{"key":"e_1_3_2_1_50_1","first-page":"319","volume-title":"Precise dynamic slicing algorithms. In phInternational Conference on Software Engineering (ICSE)","author":"Zhang X.","year":"2003","unstructured":"X. Zhang , R. Gupta , and Y. Zhang . Precise dynamic slicing algorithms. In phInternational Conference on Software Engineering (ICSE) , pages 319 -- 329 , 2003 . X. Zhang, R. Gupta, and Y. Zhang. Precise dynamic slicing algorithms. In phInternational Conference on Software Engineering (ICSE), pages 319--329, 2003."}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"acronym":"SPLASH '12","name":"SPLASH '12: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Tucson Arizona USA"},"container-title":["Proceedings of the ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2384616.2384690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T13:35:58Z","timestamp":1693834558000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2384616.2384690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,19]]},"references-count":50,"alternative-id":["10.1145\/2384616.2384690","10.1145\/2384616"],"URL":"https:\/\/doi.org\/10.1145\/2384616.2384690","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2398857.2384690","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,10,19]]},"assertion":[{"value":"2012-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}