Bounds on algorithms for string generation

DOI10.1007/BF00289511zbMath0234.68009OpenAlexW2083986422MaRDI QIDQ2551691

Yanyan Li

Publication date: 1972

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on algorithms for string generation