Image de couverture de livre

Buffered Partially-Persistent External-Memory Search Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brodal, Gerth Stølting, Rysgaard, Casper Moldrup, Svenning, Rolf
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
par: Brodal, Gerth Stølting
Publié: (2024)

Partition-based Simple Heaps
par: Brodal, Gerth Stølting, et autres
Publié: (2026)

Deterministic Cache-Oblivious Funnelselect
par: Brodal, Gerth Stølting, et autres
Publié: (2024)

Towards Lazy B-Trees
par: Rysgaard, Casper Moldrup, et autres
Publié: (2025)

Dynamic Convex Hulls for Simple Paths
par: Brewer, Bruce, et autres
Publié: (2024)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
par: Afshani, Peyman, et autres
Publié: (2026)

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
par: Bouchard, Sébastien, et autres
Publié: (2025)

Fast and Simple Sorting Using Partial Information
par: Haeupler, Bernhard, et autres
Publié: (2024)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Constant time enumeration of perfect bipartite matchings
par: Fink, Jiří
Publié: (2025)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
par: Assadi, Sepehr, et autres
Publié: (2022)

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
par: Künnemann, Marvin, et autres
Publié: (2024)

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
par: Blin, Lélia, et autres
Publié: (2024)

On the Parameterized Complexity of Diverse SAT
par: Misra, Neeldhara, et autres
Publié: (2024)

On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
par: Clark, Emily, et autres
Publié: (2024)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
par: Chauhan, Archit, et autres
Publié: (2025)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
par: Hušek, Radek, et autres
Publié: (2020)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
par: Brankovic, Milutin, et autres
Publié: (2021)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
par: Gudmundsson, Joachim, et autres
Publié: (2021)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
par: Emmerich, Michael
Publié: (2025)

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
par: Duan, Ran, et autres
Publié: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

Fast Order Statistics with Group Inequality Testing
par: Liyanage, Adiesha, et autres
Publié: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
par: Koerkamp, Ragnar Groot
Publié: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
par: Chuzhoy, Julia, et autres
Publié: (2025)

New Sorting Algorithm Wave Sort (W-Sort)
par: Wei, Jia Xu
Publié: (2025)