{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:51:38Z","timestamp":1743094298697,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_22","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"289-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Skyline Computation with Noisy Comparisons"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Groz","sequence":"first","affiliation":[]},{"given":"Frederik","family":"Mallmann-Trenn","sequence":"additional","affiliation":[]},{"given":"Claire","family":"Mathieu","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Verdugo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Afrati, F.N., Koutris, P., Suciu, D., Ullman, J.D.: Parallel skyline queries. In: 15th International Conference on Database Theory, ICDT 2012, Berlin, Germany, 26\u201329 March 2012, pp. 274\u2013284 (2012). https:\/\/doi.org\/10.1145\/2274576.2274605","DOI":"10.1145\/2274576.2274605"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Afshani, P.: Fast computation of output-sensitive maxima in a word RAM. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 1414\u20131423. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.104","DOI":"10.1137\/1.9781611973402.104"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Afshani, P., Agarwal, P.K., Arge, L., Larsen, K.G., Phillips, J.M.: (approximate) uncertain skylines. In: Proceedings of the 14th International Conference on Database Theory, ICDT 2011, pp. 186\u2013196. ACM (2011). https:\/\/doi.org\/10.1145\/1938551.1938576","DOI":"10.1145\/1938551.1938576"},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/3046673","volume":"64","author":"P Afshani","year":"2017","unstructured":"Afshani, P., Barbay, J., Chan, T.M.: Instance-optimal geometric algorithms. J. ACM 64(1), 3:1\u20133:38 (2017)","journal-title":"J. ACM"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Asudeh, A., Zhang, G., Hassan, N., Li, C., Zaruba, G.V.: Crowdsourcing pareto-optimal object finding by pairwise comparisons. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pp. 753\u2013762. ACM (2015)","DOI":"10.1145\/2806416.2806451"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/1111020","volume":"11","author":"O Barndorff-Nielsen","year":"1966","unstructured":"Barndorff-Nielsen, O., Sobel, M.: On the distribution of the number of admissible points in a vector random sample. Theory Prob. Appl. 11(2), 249\u2013269 (1966). http:\/\/search.proquest.com\/docview\/915869827?accountid=15867","journal-title":"Theory Prob. Appl."},{"key":"22_CR7","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. IEEE Computer Society (2001). http:\/\/dl.acm.org\/citation.cfm?id=645484.656550"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Braverman, M., Mao, J., Weinberg, S.M.: Parallel algorithms for select and partition with noisy comparisons. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 851\u2013862 (2016)","DOI":"10.1145\/2897518.2897642"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16(4), 361\u2013368 (1996). https:\/\/doi.org\/10.1007\/BF02712873","journal-title":"Discrete Comput. Geom."},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the ram, revisited. In: Hurtado, F., van Kreveld, M.J. (eds.) Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, 13\u201315 June 2011, pp. 1\u201310. ACM (2011). https:\/\/doi.org\/10.1145\/1998196.1998198","DOI":"10.1145\/1998196.1998198"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00454-015-9677-y","volume":"53","author":"TM Chan","year":"2015","unstructured":"Chan, T.M., Lee, P.: On constant factors in comparison-based geometric algorithms and data structures. Discrete Comput. Geom. 53(3), 489\u2013513 (2015). https:\/\/doi.org\/10.1007\/s00454-015-9677-y","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2536669.2536671","volume":"42","author":"J Chomicki","year":"2013","unstructured":"Chomicki, J., Ciaccia, P., Meneghetti, N.: Skyline queries, front and back. SIGMOD Rec. 42(3), 6\u201318 (2013). https:\/\/doi.org\/10.1145\/2536669.2536671","journal-title":"SIGMOD Rec."},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Clarkson, K.L.: More output-sensitive geometric algorithms (extended abstract). In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20\u201322 November 1994, pp. 695\u2013702 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365723","DOI":"10.1109\/SFCS.1994.365723"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1145\/2684066","volume":"39","author":"SB Davidson","year":"2014","unstructured":"Davidson, S.B., Khanna, S., Milo, T., Roy, S.: Top-k and clustering with noisy comparisons. ACM Trans. Database Syst. 39(4), 35:1\u201335:39 (2014). https:\/\/doi.org\/10.1145\/2684066","journal-title":"ACM Trans. Database Syst."},{"issue":"5","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001\u20131018 (1994). https:\/\/doi.org\/10.1137\/S0097539791195877","journal-title":"SIAM J. Comput."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00778-006-0029-7","volume":"16","author":"P Godfrey","year":"2007","unstructured":"Godfrey, P., Shipley, R., Gryz, J.: Algorithms and analyses for maximal vector computation. VLDB J. 16(1), 5\u201328 (2007). https:\/\/doi.org\/10.1007\/s00778-006-0029-7","journal-title":"VLDB J."},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.4086\/toc.2010.v006a006","volume":"6","author":"N Goyal","year":"2010","unstructured":"Goyal, N., Saks, M.: Rounds vs. queries tradeoff in noisy computation. Theory of Computing 6(1), 113\u2013134 (2010)","journal-title":"Theory of Computing"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Groz, B., Milo, T.: Skyline queries with noisy comparisons. In: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 15, pp. 185\u2013198. ACM (2015). https:\/\/doi.org\/10.1145\/2745754.2745775","DOI":"10.1145\/2745754.2745775"},{"key":"22_CR19","unstructured":"Kalyvas, C., Tzouramanis, T.: A survey of skyline query processing (2017). CoRR abs\/1704.01788, http:\/\/arxiv.org\/abs\/1704.01788"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Kirkpatrick, D.G., Seidel, R.: Output-size sensitive algorithms for finding maximal vectors. In: Proceedings of the First Annual Symposium on Computational Geometry, SCG 1985, pp. 89\u201396. ACM (1985). https:\/\/doi.org\/10.1145\/323233.323246","DOI":"10.1145\/323233.323246"},{"key":"22_CR21","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, VLDB 2002, VLDB Endowment, pp. 275\u2013286 (2002). http:\/\/dl.acm.org\/citation.cfm?id=1287369.1287394","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469\u2013476 (1975). https:\/\/doi.org\/10.1145\/321906.321910","journal-title":"J. ACM"},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Li, G., Wang, J., Zheng, Y., Franklin, M.J.: Crowdsourced data management: a survey. In: 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, CA, USA, 19\u201322 April 2017, pp. 39\u201340. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICDE.2017.26","DOI":"10.1109\/ICDE.2017.26"},{"key":"22_CR24","unstructured":"Mallmann-Trenn, F., Mathieu, C., Verdugo, V.: Skyline computation with noisy comparisons (2017). CoRR abs\/1710.02058, http:\/\/arxiv.org\/abs\/1710.02058"},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2047485.2047487","volume":"5","author":"A Marcus","year":"2011","unstructured":"Marcus, A., Wu, E., Karger, D., Madden, S., Miller, R.: Human-powered sorts and joins. Proc. VLDB Endow. 5(1), 13\u201324 (2011). https:\/\/doi.org\/10.14778\/2047485.2047487","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1002\/rsa.20240","volume":"34","author":"I Newman","year":"2009","unstructured":"Newman, I.: Computing in fault tolerant broadcast networks and noisy decision trees. Rand. Struct. Algorithms 34(4), 478\u2013501 (2009)","journal-title":"Rand. Struct. Algorithms"},{"key":"22_CR27","unstructured":"Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB 2007, VLDB Endowment, pp. 15\u201326 (2007). http:\/\/dl.acm.org\/citation.cfm?id=1325851.1325858"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:16:46Z","timestamp":1710256606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}