F. N. Afrati, P. Koutris, D. Suciu, and J. D. Ullman, Parallel skyline queries, ICDT, pp.274-284, 2012.
DOI : 10.1145/2274576.2274605
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.4561

P. Afshani, Fast Computation of Output-Sensitive Maxima in a Word RAM, SODA, pp.1414-1423, 2014.
DOI : 10.1137/1.9781611973402.104

P. Afshani, P. K. Agarwal, L. Arge, K. G. Larsen, and J. M. Phillips, (Approximate) Uncertain Skylines, Theory of Computing Systems, vol.14, issue.1, pp.342-366, 2013.
DOI : 10.1007/s00224-012-9382-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7652

P. Afshani, J. Barbay, and T. M. Chan, Instance-optimal geometric algorithms, FOCS, pp.129-138, 2009.
DOI : 10.1109/focs.2009.34
URL : http://arxiv.org/abs/1505.00184

M. Ajtai, J. Komlós, and E. Szemerédi, Sorting inc logn parallel steps, Combinatorica, vol.3, issue.1, pp.1-19, 1983.
DOI : 10.1007/BF02579338

J. L. Bentley, K. L. Clarkson, and D. B. Levine, Fast linear expected-time algorithms for computing maxima and convex hulls, Algorithmica, vol.20, issue.2, pp.168-183, 1993.
DOI : 10.1007/BF01188711

S. Börzsönyi, D. Kossmann, and K. Stocker, The Skyline operator, Proceedings 17th International Conference on Data Engineering, pp.421-430, 2001.
DOI : 10.1109/ICDE.2001.914855

M. Braverman and E. Mossel, Noisy sorting without resampling, SODA, pp.268-276, 2008.

T. M. Chan, Optimal output-sensitive convex hull algorithms in two and three dimensions, Discrete & Computational Geometry, vol.6, issue.4, pp.361-368, 1996.
DOI : 10.1007/BF02712873

T. M. Chan, K. G. Larsen, and M. Patrascu, Orthogonal range searching on the RAM, revisited, Proceedings of the 27th annual ACM symposium on Computational geometry, SoCG '11, pp.1-10, 2011.
DOI : 10.1145/1998196.1998198

T. M. Chan and P. Lee, On constant factors in comparison-based geometric algorithms and data structures, 30th Annual Symposium on Computational Geometry, p.40, 2014.

J. Chomicki, P. Ciaccia, and N. Meneghetti, Skyline queries, front and back, ACM SIGMOD Record, vol.42, issue.3, pp.6-18, 2013.
DOI : 10.1145/2536669.2536671

R. Cole, Parallel Merge Sort, SIAM Journal on Computing, vol.17, issue.4, pp.770-785, 1988.
DOI : 10.1137/0217049

R. Cole, Correction: Parallel Merge Sort, SIAM Journal on Computing, vol.22, issue.6, p.1349, 1993.
DOI : 10.1137/0222081

S. B. Davidson, S. Khanna, T. Milo, and S. Roy, Using the crowd for top-k and group-by queries, Proceedings of the 16th International Conference on Database Theory, ICDT '13, pp.225-236, 2013.
DOI : 10.1145/2448496.2448524

U. Feige, P. Raghavan, D. Peleg, and E. Upfal, Computing with Noisy Information, SIAM Journal on Computing, vol.23, issue.5, pp.1001-1018, 1994.
DOI : 10.1137/S0097539791195877
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.1468

P. Godfrey, R. Shipley, and J. Gryz, Algorithms and analyses for maximal vector computation, The VLDB Journal, vol.30, issue.1, pp.5-28, 2007.
DOI : 10.1007/s00778-006-0029-7

S. Guo, A. G. Parameswaran, and H. Garcia-molina, So who won?, Proceedings of the 2012 international conference on Management of Data, SIGMOD '12, pp.385-396, 2012.
DOI : 10.1145/2213836.2213880

A. Gupta and A. Kumar, Sorting and selection with structured costs, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.416-425, 2001.
DOI : 10.1109/SFCS.2001.959916

A. Gupta and A. Kumar, Where???s the Winner? Max-Finding and Sorting with Metric Costs, APPROX-RANDOM, pp.74-85, 2005.
DOI : 10.1007/11538462_7

E. Hemaspaandra, L. A. Hemaspaandra, and J. Rothe, Hybrid elections broaden complexity-theoretic resistance to control. CoRR, abs, p.608057, 2006.

E. Hemaspaandra, H. Spakowski, and J. Vogel, The complexity of Kemeny elections, Theoretical Computer Science, vol.349, issue.3, pp.382-391, 2005.
DOI : 10.1016/j.tcs.2005.08.031

X. Hu, C. Sheng, Y. Tao, Y. Yang, and S. Zhou, Output-sensitive Skyline Algorithms in External Memory, SODA, pp.887-900, 2013.
DOI : 10.1137/1.9781611973105.64

Z. Huang, S. Kannan, and S. Khanna, Algorithms for the Generalized Sorting Problem, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.738-747, 2011.
DOI : 10.1109/FOCS.2011.54

C. Kenyon and V. King, On boolean decision trees with faulty nodes, Random Structures and Algorithms, vol.20, issue.3, pp.453-464, 1994.
DOI : 10.1002/rsa.3240050306
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4569

M. E. Khalefa, M. F. Mokbel, and J. J. Levandoski, Skyline Query Processing for Incomplete Data, 2008 IEEE 24th International Conference on Data Engineering, pp.556-565, 2008.
DOI : 10.1109/ICDE.2008.4497464
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.5501

D. G. Kirkpatrick and R. Seidel, Output-size sensitive algorithms for finding maximal vectors, Proceedings of the first annual symposium on Computational geometry , SCG '85, pp.89-96, 1985.
DOI : 10.1145/323233.323246

V. Koltun and C. H. Papadimitriou, Approximately dominating representatives, Theoretical Computer Science, vol.371, issue.3, pp.148-154, 2007.
DOI : 10.1016/j.tcs.2006.11.003

D. Kossmann, F. Ramsak, and S. Rost, Shooting Stars in the Sky, VLDB, pp.275-286, 2002.
DOI : 10.1016/B978-155860869-6/50032-9

H. T. Kung, F. Luccio, and F. P. Preparata, On Finding the Maxima of a Set of Vectors, Journal of the ACM, vol.22, issue.4, pp.469-476, 1975.
DOI : 10.1145/321906.321910

F. T. Leighton, Y. Ma, and C. G. Plaxton, Breaking the??(nlog2n) Barrier for Sorting with Faults, Journal of Computer and System Sciences, vol.54, issue.2, pp.265-304, 1997.
DOI : 10.1006/jcss.1997.1470

C. Lofi, K. E. Maarry, and W. Balke, Skyline queries in crowd-enabled databases, Proceedings of the 16th International Conference on Extending Database Technology, EDBT '13, pp.465-476, 2013.
DOI : 10.1145/2452376.2452431

A. Marcus, E. Wu, D. R. Karger, S. Madden, and R. C. Miller, Human-powered sorts and joins, Proceedings of the VLDB Endowment, vol.5, issue.1, pp.13-24, 2011.
DOI : 10.14778/2047485.2047487
URL : http://arxiv.org/abs/1109.6881

J. Matousek, Computing dominances in En, Information Processing Letters, vol.38, issue.5, pp.277-278, 1991.
DOI : 10.1016/0020-0190(91)90071-O

I. Newman, Computing in fault tolerant broadcast networks and noisy decision trees. Random Struct, Algorithms, vol.34, issue.4, pp.478-501, 2009.

D. Papadias, Y. Tao, G. Fu, and B. Seeger, Progressive skyline computation in database systems, ACM Transactions on Database Systems, vol.30, issue.1, pp.41-82, 2005.
DOI : 10.1145/1061318.1061320

C. H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of Web sources, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.86-92, 2000.
DOI : 10.1109/SFCS.2000.892068

M. Paterson, Improved sorting networks with o(log n) depth. Algorithmica, pp.65-92, 1990.
DOI : 10.1007/bf01840378

J. Pei, B. Jiang, X. Lin, and Y. Yuan, Probabilistic skylines on uncertain data, VLDB, pp.15-26, 2007.

A. Pelc, Searching games with errors???fifty years of coping with liars, Theoretical Computer Science, vol.270, issue.1-2, pp.71-109, 2002.
DOI : 10.1016/S0304-3975(01)00303-6

J. I. Seiferas, Sorting??Networks??of??Logarithmic Depth, Further??Simplified, Algorithmica, vol.5, issue.1, pp.374-384, 2009.
DOI : 10.1007/s00453-007-9025-6

C. Sheng and Y. Tao, Worst-Case I/O-Efficient Skyline Algorithms, ACM Transactions on Database Systems, vol.37, issue.4, p.26, 2012.
DOI : 10.1145/2389241.2389245

S. Vassilvitskii and M. Yannakakis, Efficiently computing succinct trade-off curves, Theoretical Computer Science, vol.348, issue.2-3, pp.334-356, 2005.
DOI : 10.1016/j.tcs.2005.09.022

F. F. Yao, On finding the maximal elements in a set of plane vectors, 1974.

H. P. Young, Condorcet's Theory of Voting, The American Political Science Review, vol.82, issue.4, pp.1231-1244, 1988.
DOI : 10.2307/1961757

R. Yuster, Efficient algorithms on sets of permutations, dominance, and real-weighted APSP, SODA, pp.950-957, 2009.
DOI : 10.1137/1.9781611973068.103