Fun-Sort-or the chaos of unordered binary search

Discrete Applied Mathematics

Volumn 144, Issue 3, 2004, Pages 231-236

  Biedl, Therese ^a   Chan, Timothy ^a   Demaine, Erik D ^b   Fleischer, Rudolf ^c   Golin, Mordecai ^c   King, James A ^a   Munro, J Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Binary search; Insertion sort; Oblivious sorting

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

BINARY SEARCH; RANDOM PERMUTATIONS;

CHAOS THEORY;

EID: 9644252892     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.003     Document Type: Conference Paper

References (8)

1. T. Biedl, T. Chan, E.D. Demaine, R. Fleischer, M. Golin, J.I. Munro, Fun-Sort, in: E. Lodi, L. Pagli, N. Santoro (Eds.), Proceedings of the Second International Conference on FUN with Algorithms 2, Island of Elba, Italy (FUN'01) (2001), Carleton Scientific, Proceedings in Informatics, Vol. 10, pp. 15-26.
2. N. DeBruijn, Sorting by means of swapping, Discrete Math. 9 (1974) 333-339.
3. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd Edition, Addison-Wesley, Reading, MA, 1998.
4. J.G. Krammer, E.G. Bernard, M. Sauer, J.A. Nossek, Sorting on defective VLSI-arrays, INTEGRATION, VLSI J. 12 (1991) 33-48.
5. M. Kutylowski, K. Loryś, B. Oesterdiekhoff, R. Wanka, Periodification scheme: constructing sorting networks with constant period, J. ACM 47 (5) (2000) 944-967.
6. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, England, 1995.
7. Y. Rabani, A. Sinclair, R. Wanka, Local divergence of Markov chains and the analysis of iterative load-balancing schemes, in: Proceedings of the 39th Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, November 8-11, IEEE Computer Science Society, 1998, pp. 694-705.
8. H. Schröder, Partition sorts for VLSI, in: I. Kupka (Ed.), Proceedings of the 13th GI-Jahrestagung, Informatikfachberichte 73, Springer, Heidelberg, 1983, pp. 101-116.