Imagen de Portada

Partition-based Simple Heaps

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brodal, Gerth Stølting, Iacono, John, Rysgaard, Casper Moldrup, Wild, Sebastian
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Buffered Partially-Persistent External-Memory Search Trees
por: Brodal, Gerth Stølting, et al.
Publicado: (2025)

Deterministic Cache-Oblivious Funnelselect
por: Brodal, Gerth Stølting, et al.
Publicado: (2024)

Towards Lazy B-Trees
por: Rysgaard, Casper Moldrup, et al.
Publicado: (2025)

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

Dynamic Convex Hulls for Simple Paths
por: Brewer, Bruce, et al.
Publicado: (2024)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
por: Afshani, Peyman, et al.
Publicado: (2026)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Amortized Analysis of Leftist Heaps
por: Schoenmakers, Berry
Publicado: (2024)

SimdQuickHeap: The QuickHeap Reconsidered
por: Breitling, Johannes, et al.
Publicado: (2026)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
por: Iacono, John, et al.
Publicado: (2025)

A General Technique for Searching in Implicit Sets via Function Inversion
por: Aronov, Boris, et al.
Publicado: (2023)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
por: Rutschmann, Daniel
Publicado: (2026)

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

Efficiency of Self-Adjusting Heaps
por: Sinnamon, Corwin, et al.
Publicado: (2023)

Capacitated Partition Vertex Cover and Partition Edge Cover
por: Dabas, Rajni, et al.
Publicado: (2025)

Virtual-Memory Powersort
por: Moltmann, Finn, et al.
Publicado: (2026)

Compression with wildcards: All induced metric subgraphs
por: Wild, Marcel
Publicado: (2024)

Enumerating all minimal hitting sets in polynomial total time
por: Wild, Marcel
Publicado: (2023)

Parameterizing Path Partitions
por: Fernau, Henning, et al.
Publicado: (2022)

Algorithmic Problems in Categories of Partitions
por: Faroß, Nicolas, et al.
Publicado: (2025)

Monotone Submodular Multiway Partition
por: Bi, Richard, et al.
Publicado: (2024)

Graph Partitioning With Limited Moves
por: Behbahani, Majid, et al.
Publicado: (2024)

Path Partitions of Phylogenetic Networks
por: Lafond, Manuel, et al.
Publicado: (2024)

Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)

Faster Edge Coloring by Partition Sieving
por: Akmal, Shyan, et al.
Publicado: (2025)

A Note on Deterministic FPTAS for Partition
por: Chen, Lin, et al.
Publicado: (2025)

Approximating Partition in Near-Linear Time
por: Chen, Lin, et al.
Publicado: (2024)

Weighted Partition Vertex and Edge Cover
por: Dabas, Rajni, et al.
Publicado: (2025)

Learning Partitions using Rank Queries
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

Tera-Scale Multilevel Graph Partitioning
por: Salwasser, Daniel, et al.
Publicado: (2024)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

Partitioning Trillion Edge Graphs on Edge Devices
por: Chhabra, Adil, et al.
Publicado: (2024)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Sum-of-Max Chain Partition of a Tree
por: Luo, Ruixi, et al.
Publicado: (2025)

Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2025)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
por: Chen, Wenjing, et al.
Publicado: (2026)

Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication
por: Ahrens, Willow
Publicado: (2020)

String Partition for Building Long Burrows-Wheeler Transforms
por: Adler, Enno, et al.
Publicado: (2024)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)