:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Akram, Matthew, Maas, Nikolai, Sanders, Peter, Schreiber, Dominik
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2405.15371
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
por: Gottesbüren, Lars, et al.
Publicado: (2025)

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval
por: Becht, Matthias, et al.
Publicado: (2024)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
por: Lehmann, Hans-Peter, et al.
Publicado: (2023)

Scheduling Jobs with Work-Inefficient Parallel Solutions
por: Kuszmaul, William, et al.
Publicado: (2024)

Engineering Minimal k-Perfect Hash Functions
por: Hermann, Stefan, et al.
Publicado: (2025)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
por: Chen, Chi-Yeh
Publicado: (2025)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
por: Chen, Tianqi, et al.
Publicado: (2025)

Engineering Select Support for Hybrid Bitvectors
por: Chiu, Eric, et al.
Publicado: (2025)

Parallel Best Arm Identification in Heterogeneous Environments
por: Karpov, Nikolai, et al.
Publicado: (2022)

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing
por: Maas, Nikolai
Publicado: (2026)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2025)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
por: Kempa, Dominik, et al.
Publicado: (2023)

Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
por: De, Rajat, et al.
Publicado: (2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
por: Chen, Daoyuan, et al.
Publicado: (2024)

Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text
por: Adudodla, Ankith Reddy, et al.
Publicado: (2025)

Parallel Derandomization for Coloring
por: Coy, Sam, et al.
Publicado: (2023)

NP-Completeness for the Space-Optimality of Double-Array Tries
por: Bannai, Hideo, et al.
Publicado: (2024)

Theory Meets Practice for Bit Vectors Supporting Rank and Select
por: Kurpicz, Florian, et al.
Publicado: (2025)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Sorted Range Reporting and Range Minima Queries
por: Akram, Waseem, et al.
Publicado: (2021)

Near-Optimal Parallel Approximate Counting via Sampling
por: Harris, David G., et al.
Publicado: (2026)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
por: Williams, Marvin, et al.
Publicado: (2025)

Scalable Distributed String Sorting
por: Kurpicz, Florian, et al.
Publicado: (2024)

Fast and Lightweight Distributed Suffix Array Construction -- First Results
por: Haag, Manuel, et al.
Publicado: (2024)

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

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
por: Haeupler, Bernhard, et al.
Publicado: (2025)

PHast -- Perfect Hashing made fast
por: Beling, Piotr, et al.
Publicado: (2025)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
por: Hermann, Stefan, et al.
Publicado: (2024)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
por: Mendoza-Cadena, Mirabel, et al.
Publicado: (2026)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
por: Funke, Daniel, et al.
Publicado: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
por: Karpov, Nikolai, et al.
Publicado: (2025)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
por: Goranci, Gramoz, et al.
Publicado: (2025)

Optimal Parallel Basis Finding in Graphic and Related Matroids
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
por: Hsieh, Yi-Ting, et al.
Publicado: (2025)

Parallel PLL on DAGs
por: Steil, Patrick
Publicado: (2025)

Collision-Free Robot Scheduling
por: Adamson, Duncan, et al.
Publicado: (2024)

Fixed Order Scheduling with Deadlines
por: Berger, Andre, et al.
Publicado: (2024)

Substring Compression Variations and LZ78-Derivates
por: Köppl, Dominik
Publicado: (2024)

Modern Minimal Perfect Hashing: A Survey
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Scheduling on a Stochastic Number of Machines
por: Buchem, Moritz, et al.
Publicado: (2024)