Randomized shellsort: A simple data-oblivious sorting algorithm

Journal of the ACM

Volumn 58, Issue 6, 2011, Pages

  Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

Chernoff bounds; Data oblivious algorithms; Sorting

Indexed keywords

CHERNOFF BOUNDS; HIGH PROBABILITY; LAS VEGAS; MONTE CARLO ALGORITHMS; PRIVACY PRESERVING; RUNNING TIME; SECURE MULTI-PARTY COMPUTATION; SORTING ALGORITHM;

ALGORITHMS;

SORTING;

EID: 84855243919     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2049697.2049701     Document Type: Conference Paper

References (48)

1. AJTAI, M., KOMLÓS, J., AND SZEMERÉDI, E. 1983. Sorting in c log n parallel steps. Combinatorica 3, 1-19.
2. ARORA, S., LEIGHTON, T., AND MAGGS, B. 1990. On-line algorithms for path selection in a nonblocking network. In Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC'90). ACM, New York, 149-158. (Pubitemid 20729119)
3. ASSAF, S. AND UPFAL, E. 1991. Fault tolerant sorting networks. SIAM J. Disc. Math. 4, 4, 472-480.
4. ATALLAH, M. J., FREDERICKSON, G. N., AND KOSARAJU, S. R. 1988. Sorting with efficient use of specialpurpose sorters. Inf. Process. Lett. 27, 1, 13-15. (Pubitemid 18577283)
5. BEIGEL, R. AND GILL, J. 1990. Sorting n objects with a k-sorter. IEEE Trans. Comput. 39, 714-716. (Pubitemid 20713176)
6. BEN-DAVID, A., NISAN, N., AND PINKAS, B. 2008. FairplayMP: A system for secure multi-party computation. In Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS'08). ACM, New York, 257-266.
7. BLACKSTON, D. T. AND RANADE, A. 1993. Snakesort: A family of simple optimal randomized sorting algorithms. In Proceedings of the International Conference on Parallel Processing (ICPP'93). IEEE Computer Society, Los Alamitos, CA, 201-204.
8. BRAVERMAN, M. AND MOSSEL, E. 2008. Noisy sorting without resampling. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA'08). SIAM, Philadelphia, PA, 268-276.
9. BREJOVÁ , B. 2001. Analyzing variants of Shellsort. Inf. Proc. Lett. 79, 5, 223-227. (Pubitemid 32715956)
10. CANETTI, R., LINDELL, Y., OSTROVSKY, R., AND SAHAI, A. 2002. Universally composable two-party and multi-party secure computation. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC'02). ACM, New York, 494-503. (Pubitemid 35009410)
11. COLE, R. 1988. Parallel merge sort. SIAM J. Comput. 17, 4, 770-785.
12. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms 2nd Ed. MIT Press, Cambridge, MA.
13. CYPHER, R. 1993. A lower bound on the size of Shellsort sorting networks. SIAM J. Comput. 22, 1, 62-71.
14. DOBOSIEWICZ, W. 1980. An efficient variation of bubble sort. Inf. Process. Lett. 11, 1, 5-6.
15. DU, W. AND ATALLAH, M. J. 2001. Secure multi-party computation problems and their applications: A review and open problems. In Proceedings of the Workshop on New Security Paradigms (NSPW'01). ACM, New York, 13-22.
16. DU, W. AND ZHAN, Z. 2002. A practical approach to solve secure multi-party computation problems. In Proceedings of the Workshop on New Security Paradigms (NSPW'02). ACM, New York, 127-135.
17. FEIGE, U., RAGHAVAN, P., PELEG, D., AND UPFAL, E. 1994. Computing with noisy information. SIAM J. Comput. 23, 5, 1001-1018.
18. FRANCESCHINI, G.,MUTHUKRISHNAN, S., AND PATRASÇU, M. 2007. Radix sorting with no extra space. In Proceedings of the European Symposium on Algorithms (ESA). 194-205.
19. GOODRICH, M. T. 2009. The mastermind attack on genomic data. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE, 204-218.
20. GOODRICH, M. T. AND KOSARAJU, S. R. 1996. Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM 43, 2, 331-361. (Pubitemid 126628037)
21. GOODRICH, M. T. AND TAMASSIA, R. 2002. Algorithm Design: Foundations, Analysis, and Internet Examples. Wiley, New York.
22. HOEFFDING, W. 1963. Probability inequalities for sums of bounded random variables. J. AMS Statistical Association 58, 301, 13-30.
23. INCERPI, J. AND SEDGEWICK, R. 1985. Improved upper bounds on Shellsort. J. Comput. Syst. Sci. 31, 2, 210-224.
24. INCERPI, J. AND SEDGEWICK, R. 1987. Practical variations of Shellsort. Inf. Process. Lett. 26, 1, 37-43.
25. JIANG, T., LI, M., AND VITÁNYI, P. 2000. A lower bound on the average-case complexity of Shellsort. J. ACM 47, 5, 905-911.
26. KNUTH, D. E. 1973. Sorting and Searching. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading, MA.
27. LEIGHTON, F. T. 1992. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan-Kaufmann, San Francisco, CA.
28. LEIGHTON, T. 1985. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput. 34, 4, 344-354. (Pubitemid 15488477)
29. LEIGHTON, T. AND PLAXTON, C. G. 1998. Hypercubic sorting networks. SIAM J. Comput. 27, 1, 1-47. (Pubitemid 128596818)
30. MAGGS, B. M. AND VÖCKING, B. 2000. Improved routing and sorting on multibutterflies. Algorithmica 28, 4, 438-437.
31. MALKHI, D., NISAN, N., PINKAS, B., AND SELLA, Y. 2004. Fairplay-A secure two-party computation system. In Proceedings of the 13th Conference on USENIX Security Symposium (SSYM'04). USENIX Association, Berkeley, CA, 20-20.
32. MAURER, U. 2006. Secure multi-party computation made simple. Disc. Appl. Math. 154, 2, 370-381. (Pubitemid 41827525)
33. MCGEOCH, C., SANDERS, P., FLEISCHER, R., COHEN, P. R., AND PRECUP, D. 2002. Using finite experiments to study asymptotic performance. In Experimental algorithmics: From Algorithm Design to Robust and Efficient Software. Springer-Verlag, Berlin, Germany, 93-126. (Pubitemid 36136924)
34. MITZENMACHER, M. AND UPFAL, E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge, UK.
35. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, UK.
36. PATERSON, M. 1990. Improved sorting networks with O(log N) depth. Algorithmica 5, 1, 75-92. (Pubitemid 20622714)
37. PLAXTON, C. G. AND SUEL, T. 1997. Lower bounds for Shellsort. J. Algorithms 23, 2, 221-240. (Pubitemid 127450886)
38. PRATT, V. R. 1972. Shellsort and sorting networks. Ph.D. thesis, Stanford University, Palo Alto, CA.
39. RAJASEKARAN, S. AND SEN, S. 2005. PDM sorting algorithms that take a small number of passes. In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) (Papers). IEEE Computer Society, Los Alamitos, CA, 10. (Pubitemid 41733184)
40. REIF, J. H. 1985. An optimal parallel algorithm for integer sorting. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science (SFCS'85). IEEE Computer Society, Los Alamitos, CA, 496-504.
41. SANDERS, P. AND FLEISCHER, R. 2001. Asymptotic complexity from experiments? A case study for randomized algorithms. In Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00). Springer-Verlag, Berlin, Germany, 135-146. (Pubitemid 33322468)
42. SCHERSON, I. D. AND SEN, S. 1989. Parallel sorting in two-dimensional VLSI models of computation. IEEE Trans. Comput. 38, 2, 238-249.
43. SEDGEWICK, R. 1992. Algorithms in C++. Addison-Wesley, Reading, MA.
44. SEDGEWICK, R. 1996. Analysis of Shellsort and related algorithms. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA'96). Springer-Verlag, Berlin, Germany, 1-11. (Pubitemid 126128849)
45. SEIFERAS, J. 2009. Sorting networks of logarithmic depth, further simplified. Algorithmica 53, 3, 374-384.
46. SHAVIT, N., UPFAL, E., AND ZEMACH, A. 1997. A wait-free sorting algorithm. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). ACM, 121-128.
47. SHELL, D. L. 1959. A high-speed sorting procedure. Comm. ACM 2, 7, 30-32.
48. WEISS, M. A. AND SEDGEWICK, R. 1988. Bad cases for shaker-sort. Inf. Proc. Lett. 28, 3, 133-136