scientific article; zbMATH DE number 2079401

MaRDI QIDQ4471360zbMATH OpenFDO

Authors Mikkel Thorup

Publication date 28 July 2004

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fusion trees can be implemented with AC^0 instructions only
• scientific article; zbMATH DE number 1263219
• Sorting and searching revisted
• Sorting in linear time?
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds

Cited in

(8)

• Fusion trees can be implemented with AC^0 instructions only
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
• Minimal indices for predecessor search
• A correction to Andersson's fusion tree construction
• The saga of minimum spanning trees
• Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
• Integer priority queues with decrease key in constant time and the single source shortest paths problem
• Directed shortest paths via approximate cost balancing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471360)