Fun-Sort—or the chaos of unordered binary search-Reference-Cited by-同舟云学术

Fun-Sort—or the chaos of unordered binary search

Published:2004-12 Issue:3 Volume:144 Page:231-236
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Biedl Therese,Chan Timothy,Demaine Erik D.,Fleischer Rudolf,Golin Mordecai,King James A.,Munro J.Ian

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference8 articles.

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. Sorting by means of swapping;DeBruijn;Discrete Math,1974

3. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd Edition, Addison-Wesley, Reading, MA, 1998.

4. Sorting on defective VLSI-arrays;Krammer;INTEGRATION, VLSI J,1991

5. Periodification scheme;Kutyłowski;J. ACM,2000

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative method of construction for almost smooth rhythms;Journal of Mathematics and Music;2023-06-04

2. Iterative method of construction for smooth rhythms;Journal of Mathematics and Music;2021-06-06

3. Brownian Motus and Clustered Binary Insertion Sort methods: An efficient progress over traditional methods;Future Generation Computer Systems;2018-09

4. Robust and Adaptive Search;LEIBNIZ INT PR INFOR;2017

5. Near-optimal online multiselection in internal and external memory;Journal of Discrete Algorithms;2016-01