Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal parallel string algorithms

From MaRDI portal
Publication:2817630
Jump to:navigation, search

DOI10.1145/195058.195202zbMath1345.68301OpenAlexW2088124861MaRDI QIDQ2817630

Torben Hagerup

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195202



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)


Related Items (3)

On demand string sorting over unbounded alphabets ⋮ Engineering parallel string sorting ⋮ Sorting in linear time?







This page was built for publication: Optimal parallel string algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2817630&oldid=15735146"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 18:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki