Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
114 | Mark Allen Weiss, Robert Sedgewick |
Tight Lower Bounds for Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 255-262, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
103 | Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi |
A lower bound on the average-case complexity of shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(5), pp. 905-911, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
shellsort, computational complexity, sorting, Kolmogorov complexity, average-case complexity |
92 | Robert Sedgewick |
Analysis of Shellsort and Related Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 1-11, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
71 | Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi |
Average-Case Complexity of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 453-462, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
60 | C. Greg Plaxton, Bjorn Poonen, Torsten Suel |
Improved Lower Bounds for Shellsort ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 226-235, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
nonmonotone increment sequences, Shellsort, proof idea, lower bounds |
49 | Marcin Ciura |
Best Increments for the Average Case of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 106-117, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Oscar Skean, Richard Ehrenborg, Jerzy W. Jaromczyk |
Optimization Perspectives on Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.00316, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Ying Wai Lee |
Optimal Gap Sequences in Shellsort for n≤6 Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.11127, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Ying Wai Lee |
Empirically Improved Tokuda Gap Sequence in Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.11112, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Paul M. B. Vitányi |
On the average-case complexity of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 52(2), pp. 354-363, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
27 | Paul M. B. Vitányi |
On The Average-Case Complexity of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1501.06461, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
27 | Chun-Yuan Lin, Wei Sheng Lee, Chuan Yi Tang |
Parallel Shellsort Algorithm for Many-Core GPUs with CUDA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Grid High Perform. Comput. ![In: Int. J. Grid High Perform. Comput. 4(2), pp. 1-16, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Michael T. Goodrich |
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 58(6), pp. 27:1-27:26, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Michael T. Goodrich |
Randomized Shellsort: A Simple Oblivious Sorting Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 1262-1277, 2010, SIAM, 978-0-89871-701-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Michael T. Goodrich |
Randomized Shellsort: A Simple Oblivious Sorting Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0909.1037, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
27 | Robert S. Roos, Tiffany Bennett, Jennifer Hannon, Elizabeth Zehner |
A Genetic Algorithm For Improved Shellsort Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, 9-13 July 2002, pp. 694, 2002, Morgan Kaufmann, 1-55860-878-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
27 | Brona Brejová |
Analyzing variants of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 79(5), pp. 223-227, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Ranette H. Halverson, Richard P. Simpson, Tao Wang |
Using Parallel Evolving Methods to Discover New Shellsort Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCS ![In: Proceedings of the ISCA 14th International Conference on Parallel and Distributed Computing Systems, August 8-10, 2001, Richardson, Texas, USA, pp. 472-477, 2001, ISCA, 1-880843-39-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
27 | Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi |
Average-Case Complexity of Shellsort (Preliminary version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/9906008, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
27 | Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi |
Average-Case Complexity of Shellsort ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.DS/9901010, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
27 | Richard Simpson, Shashidhar Yachavaram |
Faster shellsort sequences: A genetic algorithm application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATA ![In: Computers and Their Applications (CATA-99), Proceedings of the ISCA 14th International Conference, Cancun, Mexico, April 7-9, 1999, pp. 384-387, 1999, ISCA, 1-880843-27-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
27 | Renren Liu |
An Improved Shellsort Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 188(1-2), pp. 241-247, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Svante Janson, Donald E. Knuth |
Shellsort with three increments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 10(1-2), pp. 125-142, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | C. Greg Plaxton, Torsten Suel |
Lower Bounds for Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 23(2), pp. 221-240, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Mark Allen Weiss |
Shellsort with a Constant Number of Increments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 16(6), pp. 649-654, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
27 | S. Mansoor Sarwar, Mansour H. A. Jaragh, Mike Wind |
An Empirical Study of the Run-Time Behavior of Quicksort, Shellsort and Mergesort for Medium to Large Size Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Lang. ![In: Comput. Lang. 20(2), pp. 127-134, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
27 | Bjorn Poonen |
The Worst Case in Shellsort and Related Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 15(1), pp. 101-124, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Robert Cypher |
A Lower Bound on the Size of Shellsort Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 22(1), pp. 62-71, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Naoyuki Tokuda |
An Improved Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP Congress (1) ![In: Algorithms, Software, Architecture - Information Processing '92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992, pp. 449-457, 1992, North-Holland, 0-444-89747-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
27 | Mark Allen Weiss |
Empirical Study of the Expected Running Time of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 34(1), pp. 88-91, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
27 | Mark Allen Weiss, Robert Sedgewick |
More on Shellsort Increment Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 34(5), pp. 267-270, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Mark Allen Weiss, Robert Sedgewick |
Tight Lower Bounds for Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 11(2), pp. 242-251, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Ernst S. Selmer |
On Shellsort and the Frobenius Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 29(1), pp. 37-40, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
27 | Robert Cypher |
A Lower Bound on the Size of Shellsort Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, SPAA '89, Santa Fe, New Mexico, USA, June 18-21, 1989, pp. 58-63, 1989, ACM, 0-89791-323-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
27 | Janet Incerpi, Robert Sedgewick |
Practical Variations of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 26(1), pp. 37-43, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
27 | Robert Sedgewick |
A New Upper Bound for Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 7(2), pp. 159-173, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
27 | Janet Incerpi, Robert Sedgewick |
Improved Upper Bounds on Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 31(2), pp. 210-224, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
27 | Janet Incerpi, Robert Sedgewick |
Improved Upper Bounds on Shellsort ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983, pp. 48-55, 1983, IEEE Computer Society, 0-8186-0508-1. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
27 | Hannu Erkiö |
A Heuristic Approximation of the Worst Case of Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 20(2), pp. 130-136, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Andrew Chi-Chih Yao |
An Analysis of (h, k, 1)-Shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 1(1), pp. 14-50, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Vaughan R. Pratt |
Shellsort and Sorting Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1972 |
RDF |
|
27 | J. P. Chandler, W. C. Harrison |
Remark on algorithm 201 [M1]: shellsort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 13(6), pp. 373-374, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
digital computer sorting, minimal storage sorting, sorting |
22 | Paul Biggar, Nicholas Nash, Kevin Williams 0001, David Gregg |
An experimental study of sorting and branch prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 1.8:1-1.8:39, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
caching, Sorting, branch prediction, pipeline architectures |
22 | Peter Sanders 0001, Rudolf Fleischer |
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 135-146, 2000, Springer, 3-540-42512-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi |
The Incompressibility Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25 - December 2, 2000, Proceedings, pp. 36-53, 2000, Springer, 3-540-41348-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Christophe Cérin, Jean-Luc Gaudiot |
Algorithms for Stable Sorting to Minimize Communications in Networks of Workstations and Their Implementations in BSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCC ![In: International Workshop on Cluster Computing (IWCC '99), 2-3 December 1999, Melbourne, Australia, pp. 112-120, 1999, IEEE Computer Society, 0-7695-0343-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
foundations of parallel languages, bulk synchronous parallel model and broadcasting with selective reduction model. algorithms for solving problems on clusters, job and resource management, parallel programming |
22 | Albert N. Badre, Margaret Beranek, J. Morgan Morris, John T. Stasko |
Assessing Program Visualization Systems as Instructional Aids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAL ![In: Computer Assisted Learning, 4th International Conference, ICCAL '92, Wolfville, Nova Scotia, Canada, June 17-20, 1992, Proceedings, pp. 87-99, 1992, Springer, 3-540-55578-1. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
22 | S. O'Daniel, G. Clark, K. Cooper |
Determination of order of an algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the Sixteenth ACM Annual Conference on Computer Science, Atlanta, Georgia, USA, February 23-25, 1988, pp. 691, 1988, ACM, 0-89791-260-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
22 | Ernst-Erich Doberkat |
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 31(1), pp. 11-31, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
sorting, Analysis of algorithms |