scientific article; zbMATH DE number 7561588

DOI10.4230/LIPIcs.ICALP.2019.95MaRDI QIDQ5091256

Mikkel Thorup, Uri Zwick, Or Zamir

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsword RAMorder queries

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Sorting in linear time?
• Surpassing the information theoretic bound with fusion trees
• Optimal bounds for the predecessor problem and related problems
• Soft Heaps Simplified
• Time-space trade-offs for predecessor search
• Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)
• Dynamic ordered sets with exponential search trees
• Equivalence between priority queues and sorting
• The soft heap
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Deterministic sorting in O(nloglogn) time and linear space

This page was built for publication: