Search results for "shellsort"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
114	Mark Allen Weiss, Robert Sedgewick	Tight Lower Bounds for Shellsort.	SWAT	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.	J. ACM	2000	DBLP DOI BibTeX RDF	shellsort, computational complexity, sorting, Kolmogorov complexity, average-case complexity
92	Robert Sedgewick	Analysis of Shellsort and Related Algorithms.	ESA	1996	DBLP DOI BibTeX RDF
71	Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi	Average-Case Complexity of Shellsort.	ICALP	1999	DBLP DOI BibTeX RDF
60	C. Greg Plaxton, Bjorn Poonen, Torsten Suel	Improved Lower Bounds for Shellsort	FOCS	1992	DBLP DOI BibTeX RDF	nonmonotone increment sequences, Shellsort, proof idea, lower bounds
49	Marcin Ciura	Best Increments for the Average Case of Shellsort.	FCT	2001	DBLP DOI BibTeX RDF
27	Oscar Skean, Richard Ehrenborg, Jerzy W. Jaromczyk	Optimization Perspectives on Shellsort.	CoRR	2023	DBLP DOI BibTeX RDF
27	Ying Wai Lee	Optimal Gap Sequences in Shellsort for n≤6 Elements.	CoRR	2021	DBLP BibTeX RDF
27	Ying Wai Lee	Empirically Improved Tokuda Gap Sequence in Shellsort.	CoRR	2021	DBLP BibTeX RDF
27	Paul M. B. Vitányi	On the average-case complexity of Shellsort.	Random Struct. Algorithms	2018	DBLP DOI BibTeX RDF
27	Paul M. B. Vitányi	On The Average-Case Complexity of Shellsort.	CoRR	2015	DBLP BibTeX RDF
27	Chun-Yuan Lin, Wei Sheng Lee, Chuan Yi Tang	Parallel Shellsort Algorithm for Many-Core GPUs with CUDA.	Int. J. Grid High Perform. Comput.	2012	DBLP DOI BibTeX RDF
27	Michael T. Goodrich	Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm.	J. ACM	2011	DBLP DOI BibTeX RDF
27	Michael T. Goodrich	Randomized Shellsort: A Simple Oblivious Sorting Algorithm.	SODA	2010	DBLP DOI BibTeX RDF
27	Michael T. Goodrich	Randomized Shellsort: A Simple Oblivious Sorting Algorithm	CoRR	2009	DBLP BibTeX RDF
27	Robert S. Roos, Tiffany Bennett, Jennifer Hannon, Elizabeth Zehner	A Genetic Algorithm For Improved Shellsort Sequences.	GECCO	2002	DBLP BibTeX RDF
27	Brona Brejová	Analyzing variants of Shellsort.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
27	Ranette H. Halverson, Richard P. Simpson, Tao Wang	Using Parallel Evolving Methods to Discover New Shellsort Sequences.	PDCS	2001	DBLP BibTeX RDF
27	Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi	Average-Case Complexity of Shellsort (Preliminary version)	CoRR	1999	DBLP BibTeX RDF
27	Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi	Average-Case Complexity of Shellsort	CoRR	1999	DBLP BibTeX RDF
27	Richard Simpson, Shashidhar Yachavaram	Faster shellsort sequences: A genetic algorithm application.	CATA	1999	DBLP BibTeX RDF
27	Renren Liu	An Improved Shellsort Algorithm.	Theor. Comput. Sci.	1997	DBLP DOI BibTeX RDF
27	Svante Janson, Donald E. Knuth	Shellsort with three increments.	Random Struct. Algorithms	1997	DBLP DOI BibTeX RDF
27	C. Greg Plaxton, Torsten Suel	Lower Bounds for Shellsort.	J. Algorithms	1997	DBLP DOI BibTeX RDF
27	Mark Allen Weiss	Shellsort with a Constant Number of Increments.	Algorithmica	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.	Comput. Lang.	1994	DBLP DOI BibTeX RDF
27	Bjorn Poonen	The Worst Case in Shellsort and Related Algorithms.	J. Algorithms	1993	DBLP DOI BibTeX RDF
27	Robert Cypher	A Lower Bound on the Size of Shellsort Sorting Networks.	SIAM J. Comput.	1993	DBLP DOI BibTeX RDF
27	Naoyuki Tokuda	An Improved Shellsort.	IFIP Congress (1)	1992	DBLP BibTeX RDF
27	Mark Allen Weiss	Empirical Study of the Expected Running Time of Shellsort.	Comput. J.	1991	DBLP DOI BibTeX RDF
27	Mark Allen Weiss, Robert Sedgewick	More on Shellsort Increment Sequences.	Inf. Process. Lett.	1990	DBLP DOI BibTeX RDF
27	Mark Allen Weiss, Robert Sedgewick	Tight Lower Bounds for Shellsort.	J. Algorithms	1990	DBLP DOI BibTeX RDF
27	Ernst S. Selmer	On Shellsort and the Frobenius Problem.	BIT	1989	DBLP DOI BibTeX RDF
27	Robert Cypher	A Lower Bound on the Size of Shellsort Networks.	SPAA	1989	DBLP DOI BibTeX RDF
27	Janet Incerpi, Robert Sedgewick	Practical Variations of Shellsort.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
27	Robert Sedgewick	A New Upper Bound for Shellsort.	J. Algorithms	1986	DBLP DOI BibTeX RDF
27	Janet Incerpi, Robert Sedgewick	Improved Upper Bounds on Shellsort.	J. Comput. Syst. Sci.	1985	DBLP DOI BibTeX RDF
27	Janet Incerpi, Robert Sedgewick	Improved Upper Bounds on Shellsort	FOCS	1983	DBLP DOI BibTeX RDF
27	Hannu Erkiö	A Heuristic Approximation of the Worst Case of Shellsort.	BIT	1980	DBLP DOI BibTeX RDF
27	Andrew Chi-Chih Yao	An Analysis of (h, k, 1)-Shellsort.	J. Algorithms	1980	DBLP DOI BibTeX RDF
27	Vaughan R. Pratt	Shellsort and Sorting Networks		1972	RDF
27	J. P. Chandler, W. C. Harrison	Remark on algorithm 201 [M1]: shellsort.	Commun. ACM	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.	ACM J. Exp. Algorithmics	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.	WAE	2000	DBLP DOI BibTeX RDF
22	Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi	The Incompressibility Method.	SOFSEM	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.	IWCC	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.	ICCAL	1992	DBLP DOI BibTeX RDF
22	S. O'Daniel, G. Clark, K. Cooper	Determination of order of an algorithm.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
22	Ernst-Erich Doberkat	Continuous models that are equivalent to randomness for the analysis of many sorting algorithms.	Computing	1983	DBLP DOI BibTeX RDF	sorting, Analysis of algorithms