Randomized Shellsort: A simple oblivious sorting algorithm

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1262-1277

  Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY;

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

SORTING;

EID: 77951692170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.101     Document Type: Conference Paper

References (46)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in clog n parallel steps. Combinatorica, 3:1-19, 1983.
2. S. Arora, T. Leighton, and B. Maggs. On-line algorithms for path selection in a nonblocking network. In STOC '90: Proceedings of the 22nd ACM Symposium on Theory of computing, pages 149-158, New York, NY, USA, 1990. ACM.
3. M. J. Atallah, G. N. Frederickson, and S. R. Kosaraju. Sorting with efficient use of special-purpose sorters. Inf. Process. Lett., 27(1):13-15, 1988.
4. R. Beigel and J. Gill. Sorting n objects with a κ-sorter. IEEE Transactions on Computers, 39:714-716, 1990.
5. A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP: A system for secure multi-party computation. In CCS '08: Proceedings of the 15th ACM conference on Computer and communications security, pages 257-266, New York, NY, USA, 2008. ACM.
6. D. T. Blackston and A. Ranade. Snakesort: A family of simple optimal randomized sorting algorithms. In ICPP '93: Proceedings of the 1993 International Conference on Parallel Processing, pages 201-204, Washington, DC, USA, 1993. IEEE Computer Society.
7. B. Brejová. Analyzing variants of Shellsort. Information Processing Letters, 79(5):223-227, 2001.
8. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 494-503, New York, NY, USA, 2002. ACM.
9. R. Cole. Parallel merge sort. SIAM J. Comput., 17(4):770-785, 1988.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.
11. R. Cypher. A lower bound on the size of Shellsort sorting networks. SIAM J. Comput., 22(1):62-71, 1993.
12. W. Dobosiewicz. An efficient variation of bubble sort. Inf. Process. Lett., 11(1):5-6, 1980.
13. W. Du and M. J. Atallah. Secure multi-party computation problems and their applications: a review and open problems. In NSPW '01: Proceedings of the 2001 workshop on New security paradigms, pages 13-22, New York, NY, USA, 2001. ACM.
14. W. Du and Z. Zhan. A practical approach to solve secure multi-party computation problems. In NSPW '02: Proceedings of the 2002 workshop on New security paradigms, pages 127-135, New York, NY, USA, 2002. ACM.
15. D. Dubhashi and S. Sen. Concentration of measure for randomized algorithms: Techniques and analysis. In P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, editors, Handbook of Randomized Computing, pages 35-100. Kluwer Academic Publishers, 2001.
16. G. Franceschini, S. Muthukrishnan, and M. Pǎtraşcu. Radix sorting with no extra space. In European Symposium on Algorithms (ESA), pages 194-205, 2007.
17. M. T. Goodrich. The mastermind attack on genomic data. In IEEE Symposium on Security and Privacy, pages 204-218. IEEE Press, 2009.
18. M. T. Goodrich and S. R. Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM, 43(2):331-361, 1996.
19. M. T. Goodrich and R. Tamassia. Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, New York, NY, 2002.
20. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301): 13-30, Mar. 1963.
21. J. Incerpi and R. Sedgewick. Improved upper bounds on Shellsort. J. Comput. Syst. Sci., 31(2):210-224, 1985.
22. J. Incerpi and R. Sedgewick. Practical variations of Shellsort. Inf. Process. Lett., 26(1):37-43, 1987.
23. T. Jiang, M. Li, and P. Vitányi. A lower bound on the average-case complexity of Shellsort. J. ACM, 47(5):905-911, 2000.
24. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
25. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan-Kaufmann, San Mateo, CA, 1992.
26. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput., 34(4):344-354, 1985.
27. T. Leighton and C. G. Plaxton. Hypercubic sorting networks. SIAM J. Comput., 27(1):1-47, 1998.
28. B. M. Maggs and B. Vöcking. Improved routing and sorting on multibutterflies. Algorithmica, 28(4):438-1437, 2000.
29. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In SSYM'04: Proceedings of the 13th conference on USENIX Security Symposium, pages 20-20, Berkeley, CA, USA, 2004. USENIX Association.
30. U. Maurer. Secure multi-party computation made simple. Discrete Appl. Math., 154(2):370-381, 2006.
31. C. McGeoch, P. Sanders, R. Fleischer, P. R. Cohen, and D. Precup. Using finite experiments to study asymptotic performance. In Experimental algorithmics: from algorithm design to robust and efficient software, pages 93-126, New York, NY, USA, 2002. Springer-Verlag New York, Inc.
32. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York, NY, USA, 2005.
33. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
34. M. Paterson. Improved sorting networks with O(log N) depth. Algorithmica, 5(1):75-92, 1990.
35. C. G. Plaxton and T. Suel. Lower bounds for Shellsort. J. Algorithms, 23(2):221-240, 1997.
36. V. R. Pratt. Shellsort and sorting networks. PhD thesis, Stanford University, Stanford, CA, USA, 1972.
37. S. Rajasekaran and S. Sen. PDM sorting algorithms that take a small number of passes. In IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers, page 10, Washington, DC, USA, 2005. IEEE Computer Society.
38. J. H. Reif. An optimal parallel algorithm for integer sorting. In SFCS '85: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 496-504, Washington, DC, USA, 1985. IEEE Computer Society.
39. P. Sanders and R. Fleischer. Asymptotic complexity from experiments? A case study for randomized algorithms. In WAE '00: Proceedings of the 4th International Workshop on Algorithm Engineering, pages 135-146, London, UK, 2001. Springer-Verlag.
40. I. D. Scherson and S. Sen. Parallel sorting in two-dimensional VLSI models of computation. IEEE Trans. Comput., 38(2):238-249, 1989.
41. R. Sedgewick. Algorithms in C++. Addison-Wesley, Reading, MA, 1992.
42. R. Sedgewick. Analysis of Shellsort and related algorithms. In ESA '96: Proceedings of the Fourth Annual European Symposium on Algorithms, pages 1-11, London, UK, 1996. Springer-Verlag.
43. J. Seiferas. Sorting networks of logarithmic depth, further simplified. Algorithmica, 53(3):374-384, 2009.
44. N. Shavit, E. Upfal, and A. Zemach. A wait-free sorting algorithm. In ACM Symp. on Principles of Distributed Computing (PODC), pages 121-128, 1997.
45. D. L. Shell. A high-speed sorting procedure. Commun. ACM, 2(7):30-32, 1959.
46. M. A. Weiss and R. Sedgewick. Bad cases for shaker-sort. Information Processing Letters, 28(3): 133-136, 1988.