On shellsort and the Frobenius problem

DOI10.1007/BF01932703zbMath0684.68082OpenAlexW1972272347WikidataQ56113006 ScholiaQ56113006MaRDI QIDQ1825677

Ernst S. Selmer

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932703

zbMATH Keywords

Frobenius problemshellsort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

More on shellsort increment sequences ⋮ The Frobenius Problem and Its Generalizations

Cites Work

• Improved upper bounds on Shellsort
• A new upper bound for Shellsort
• Two remarks on linear forms in non-negative integers.
• On the linear diophantine problem of Frobenius.
• On a Problem of Partitions II
• On a Problem of Partitions

This page was built for publication: On shellsort and the Frobenius problem