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

Efficient multiway radix search trees

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

DOI10.1016/S0020-0190(96)00151-2zbMath0875.68315OpenAlexW2111128664MaRDI QIDQ1350102

Úlfar Erlingsson, T. V. Raman, Mukkai S. Krishnamoorthy

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00151-2


zbMATH Keywords

AlgorithmsCompilersCode optimizationCode generationSwitch statements


Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25)



Uses Software

  • PATRICIA


Cites Work

  • Efficient randomized pattern-matching algorithms
  • Optimizing two-state case statements in Pascal
  • Compilation of the Pascal case statement
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Efficient multiway radix search trees

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