乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T20:10:25Z","timestamp":1741983025589,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_19","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"170-179","source":"Crossref","is-referenced-by-count":4,"title":["A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time"],"prefix":"10.1007","author":[{"given":"Yakov","family":"Nekrich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-39658-1_4","volume-title":"Algorithms - ESA 2003","author":"P.K. Agarwal","year":"2003","unstructured":"Agarwal, P.K., Arge, L., Yang, J., Yi, K.: I\/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 7\u201318. Springer, Heidelberg (2003)"},{"unstructured":"Agarwal, P.K., Arge, L., Yi, K.: An Optimal Dynamic Interval Stabbing-Max Data Structure? In: Proc. SODA 2005, pp. 803\u2013812 (2005)","key":"19_CR2"},{"doi-asserted-by":"crossref","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proc. FOCS 1998, pp. 534\u2013544 (1998)","key":"19_CR3","DOI":"10.1109\/SFCS.1998.743504"},{"issue":"6","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L. Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. Comput.\u00a032(6), 1488\u20131508 (2003)","journal-title":"SIAM J. Comput."},{"unstructured":"Blelloch, G.E.: Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, and Range Reporting. In: Proc. SODA 2008, pp. 894\u2013903 (2008)","key":"19_CR5"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on Computing\u00a017, 427\u2013462 (1988)","journal-title":"SIAM J. on Computing"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207168308803364","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H.: A New Approach to Rectangle Intersections, part I. Int. J. Computer Mathematics\u00a013, 209\u2013219 (1983)","journal-title":"Int. J. Computer Mathematics"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Mathematical Systems Theory"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/3-540-45551-5_45","volume-title":"NETWORKING 2000. Broadband Communications, High Performance Networking, and Performance of Communication Networks","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., McKeown, N.: Dynamic Algorithms with Worst-Case Performance for Packet Classification. In: Pujolle, G., Perros, H.G., Fdida, S., K\u00f6rner, U., Stavrakakis, I. (eds.) NETWORKING 2000. LNCS, vol.\u00a01815, pp. 528\u2013539. Springer, Heidelberg (2000)"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/65.912717","volume":"15","author":"P. Gupta","year":"2001","unstructured":"Gupta, P., McKeown, N.: Algorithms for Packet Classification. IEEE Network\u00a015(2), 24\u201332 (2001)","journal-title":"IEEE Network"},{"doi-asserted-by":"crossref","unstructured":"Feldmann, A., Muthukrishnan, S.: Tradeoffs for Packet Classification. In: Proc. INFOCOM 2000, pp. 1193\u20131202 (2000)","key":"19_CR11","DOI":"10.1109\/INFCOM.2000.832493"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci.\u00a048(3), 533\u2013551 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(87)90024-1","volume":"8","author":"H. Imai","year":"1987","unstructured":"Imai, H., Asano, T.: Dynamic Orthogonal Segment Intersection Search. Journal of Algorithms\u00a08(1), 1\u201318 (1987)","journal-title":"Journal of Algorithms"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-10843-2_34","volume-title":"Automata, Languages and Programming","author":"A. Itai","year":"1981","unstructured":"Itai, A., Konheim, A.G., Rodeh, M.: A Sparse Table Implementation of Priority Queues. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 417\u2013431. Springer, Heidelberg (1981)"},{"doi-asserted-by":"crossref","unstructured":"Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic Rectangular Intersection with Priorities. In: Proc. STOC 2003, pp. 639\u2013648 (2003)","key":"19_CR15","DOI":"10.1145\/780542.780635"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.comgeo.2008.09.001","volume":"42","author":"Y. Nekrich","year":"2009","unstructured":"Nekrich, Y.: Orthogonal Range Searching in Linear and Almost-Linear Space. Comput. Geom.\u00a042(4), 342\u2013351 (2009)","journal-title":"Comput. Geom."},{"unstructured":"P\u01cetra\u015fcu, M., Demaine, E.D.: Tight Bounds for the Partial-Sums Problem. In: Proc. 15th SODA 2004, pp. 20\u201329 (2004)","key":"19_CR17"},{"doi-asserted-by":"crossref","unstructured":"Sahni, S., Kim, K.: O(logn) Dynamic Packet Routing. In: Proc. IEEE Symposium on Computers and Communications, pp. 443\u2013448 (2002)","key":"19_CR18","DOI":"10.1109\/ISCC.2002.1021713"},{"doi-asserted-by":"crossref","unstructured":"Sahni, S., Kim, K., Lu, H.: Data Structures for One-Dimensional Packet Classification Using Most Specific Rule Matching. In: Proc. ISPAN 2002, pp. 3\u201314 (2002)","key":"19_CR19","DOI":"10.1109\/ISPAN.2002.1004254"},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"18","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. J. Comput. Syst. Sci.\u00a018(2), 110\u2013127 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. ACM\u00a046(3), 362\u2013394 (1999)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Thorup, M.: Space Efficient Dynamic Stabbing with Fast Queries. In: Proc. STOC 2003, pp. 649\u2013658 (2003)","key":"19_CR22","DOI":"10.1145\/780542.780636"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(92)90034-D","volume":"97","author":"D.E. Willard","year":"1992","unstructured":"Willard, D.E.: A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time. Information and Computation\u00a097, 150\u2013204 (1992)","journal-title":"Information and Computation"},{"unstructured":"Yang, J., Widom, J.: Incremental Computation and Maintenance of Temporal Aggregates. In: Proc. IEEE Intl. Conf. on Data Engineering 2001, pp. 51\u201360 (2001)","key":"19_CR24"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T19:32:30Z","timestamp":1741980750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}