Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
131
click to vote
ACSC
2003
IEEE
118
views
Theoretical Computer Science
»
more
ACSC 2003
»
Efficient Trie-Based Sorting of Large Sets of Strings
15 years 6 months ago
Download
goanna.cs.rmit.edu.au
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
claim paper
Read More »