{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:57Z","timestamp":1725543477526},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_34","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"363-374","source":"Crossref","is-referenced-by-count":7,"title":["In-Place Algorithms for Computing (Layers of) Maxima"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Blunck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Vahrenhold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01188711","volume":"9","author":"J.L. Bentley","year":"1993","unstructured":"Bentley, J.L., Clarkson, K.L., Levine, D.B.: Fast linear expected-time algorithms for computing maxima and convex hulls. Algorithmica\u00a09(2), 168\u2013183 (1993)","journal-title":"Algorithmica"},{"key":"34_CR3","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421\u2013430 (2001)"},{"key":"34_CR4","unstructured":"Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide-and-conquer algorithms. Computational Geometry: Theory & Applications (to appear, 2006) (accepted, November 2004)"},{"issue":"2","key":"34_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.comgeo.2005.11.005","volume":"34","author":"H. Br\u00f6nnimann","year":"2006","unstructured":"Br\u00f6nnimann, H., Chan, T.M.-Y.: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Computational Geometry: Theory & Applications\u00a034(2), 75\u201382 (2006)","journal-title":"Computational Geometry: Theory & Applications"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Chan, T.M.-Y., Chen, E.Y.: Towards in-place geometric algorithms. In: Proceedings of the 20th Annual Symposium on Computational Geometry, pp. 239\u2013246 (2004)","DOI":"10.1145\/997817.997854"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2003.05.004","volume":"321","author":"H. Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.T.: Space-efficient planar convex hull algorithms. Theoretical Computer Science\u00a0321(1), 25\u201340 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1082-5","volume":"39","author":"A.L. Buchsbaum","year":"2004","unstructured":"Buchsbaum, A.L., Goodrich, M.T.: Three-dimensional layers of maxima. Algorithmica\u00a039(4), 275\u2013286 (2004)","journal-title":"Algorithmica"},{"key":"34_CR9","unstructured":"Chen, E.Y., Chan, T.M.-Y.: A space-efficient algorithm for line segment intersection. In: Proceedings of the 15th Canadian Conference on Computational Geometry, pp. 68\u201371 (2003)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-24698-5_22","volume-title":"LATIN 2004: Theoretical Informatics","author":"H.K. Dai","year":"2004","unstructured":"Dai, H.K., Zhang, X.W.: Improved linear expected-time algorithms for computing maxima. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 181\u2013192. Springer, Heidelberg (2004)"},{"issue":"12","key":"34_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W.: Algorithm 245: Treesort. Communications of the ACM\u00a07(12), 701 (1964)","journal-title":"Communications of the ACM"},{"issue":"1\u20132","key":"34_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00162-5","volume":"237","author":"V. Geffert","year":"2000","unstructured":"Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theoretical Computer Science\u00a0237(1\u20132), 159\u2013181 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1137\/S0097539798348365","volume":"29","author":"S. Kapoor","year":"2000","unstructured":"Kapoor, S.: Dynamic maintenance of maxima of 2-D point sets. SIAM Journal on Computing\u00a029(6), 1858\u20131877 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01994842","volume":"32","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Pasanen, T.: Stable minimum space partitioning in linear time. BIT\u00a032, 580\u2013585 (1992)","journal-title":"BIT"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 275\u2013286 (2002)","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H.T. Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. Journal of the ACM\u00a022(4), 469\u2013476 (1975)","journal-title":"Journal of the ACM"},{"issue":"5","key":"34_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(91)90071-O","volume":"38","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Computing dominances in E n . Information Processing Letters\u00a038(5), 277\u2013278 (1991)","journal-title":"Information Processing Letters"},{"issue":"1","key":"34_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. Journal of Computer and System Sciences\u00a033(1), 66\u201374 (1986)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Transactions on Database Systems\u00a030(1), 41\u201382 (2005)","journal-title":"ACM Transactions on Database Systems"},{"key":"34_CR20","volume-title":"Computational Geometry. An Introduction","author":"F.P. Preparata","year":"1988","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. An Introduction. Springer, Heidelberg (1988)"},{"issue":"3","key":"34_CR21","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0020-0190(87)90202-X","volume":"25","author":"J.S. Salowe","year":"1987","unstructured":"Salowe, J.S., Steiger, W.L.: Stable unmerging in linear time and constant space. Information Processing Letters\u00a025(3), 285\u2013294 (1987)","journal-title":"Information Processing Letters"},{"key":"34_CR22","unstructured":"Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 301\u2013310 (2001)"},{"key":"34_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11534273_14","volume-title":"Algorithms and Data Structures","author":"J. Vahrenhold","year":"2005","unstructured":"Vahrenhold, J.: Line-segment intersection made in-place. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 146\u2013157. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:24Z","timestamp":1619507964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11785293_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}