Shellsort with a constant number of increments
type: Item
instance of: scholarly article
title: Shellsort with a constant number of increments
zbMATH Open document ID: 0860.68036
DOI: 10.1007/BF01944355
author: Yanyan Li
published in: Algorithmica
publication date: 1996-12-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 951883
zbMATH Keywords: sorting
zbMATH Keywords: Shellsort
MaRDI profile type: Publication
cites work: On a Problem of Partitions
cites work: Improved upper bounds on Shellsort
cites work: Q4230344
cites work: The Worst Case in Shellsort and Related Algorithms
cites work: A new upper bound for Shellsort
cites work: On the linear diophantine problem of Frobenius.
cites work: More on shellsort increment sequences
cites work: Tight lower bounds for Shellsort
full work available at URL: https://doi.org/10.1007/bf01944355
OpenAlex ID: W2063540827
description: scientific article; zbMATH DE number 951883