scientific article; zbMATH DE number 2119642
From MaRDI portal
Publication:4828913
zbMath1093.68574MaRDI QIDQ4828913
Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time ⋮ Canonical density control ⋮ Tight Lower Bounds for the Online Labeling Problem ⋮ Fault Tolerant External Memory Algorithms ⋮ Array Layouts for Comparison-Based Searching ⋮ The cost of cache-oblivious searching ⋮ Designing reliable algorithms in unreliable memories ⋮ I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions ⋮ Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions ⋮ A general approach for cache-oblivious range reporting and approximate range counting ⋮ Resilient Dictionaries for Randomly Unreliable Memory ⋮ Cache-oblivious R-trees ⋮ On Online Labeling with Large Label Set ⋮ The Online House Numbering Problem: Min-Max Online List Labeling
Uses Software
This page was built for publication:
