:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Walther, Paul, Mansour, Wejdene, Zollner, Johann Maximilian, Werner, Martin
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2502.02193
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Blocked Bloom Filters with Choices
par: Schmitz, Johanna Elena, et autres
Publié: (2025)

Daisy Bloom Filters
par: Bercea, Ioana O., et autres
Publié: (2022)

Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
par: Sato, Atsuki, et autres
Publié: (2024)

Adversary Resilient Learned Bloom Filters
par: Almashaqbeh, Ghada, et autres
Publié: (2024)

Technical Report: Modeling Average False Positive Rates of Recycling Bloom Filters
par: Dozier, Kahlil, et autres
Publié: (2024)

Learned LSM-trees: Two Approaches Using Learned Bloom Filters
par: Fidalgo, Nicholas, et autres
Publié: (2025)

A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
par: Shishir, Fairuz Shadmani, et autres
Publié: (2024)

Knapsack on Graphs with Relaxed Neighborhood Constraints
par: Dey, Palash, et autres
Publié: (2025)

Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
par: Sato, Atsuki, et autres
Publié: (2025)

The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing
par: Paschmanns, Paul, et autres
Publié: (2026)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
par: Jaberi, Raed, et autres
Publié: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
par: Song, Siwoo, et autres
Publié: (2025)

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
par: Dolev, Shlomi
Publié: (2025)

Adaptive Quotient Filters
par: Wen, Richard, et autres
Publié: (2024)

Invertible Bloom Lookup Tables with Less Memory and Randomness
par: Fleischhacker, Nils, et autres
Publié: (2023)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, et autres
Publié: (2024)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
par: Desikan, Hayagriv
Publié: (2026)

A Strong Linear Programming Relaxation for Weighted Tree Augmentation
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Time To Replace Your Filter: How Maplets Simplify System Design
par: Bender, Michael A., et autres
Publié: (2025)

Fingerprint Filters Are Optimal
par: Kuszmaul, William, et autres
Publié: (2025)

On Differentially Private Linear Algebra
par: Kaplan, Haim, et autres
Publié: (2024)

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements
par: Gomes, Pedro Silva, et autres
Publié: (2025)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
par: Atalig, Sunny, et autres
Publié: (2024)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
par: Brinkop, Hauke, et autres
Publié: (2025)

Improved Extended Regular Expression Matching
par: Bille, Philip, et autres
Publié: (2025)

Anytime Sorting Algorithms (Extended Version)
par: Caizergues, Emma, et autres
Publié: (2024)

Optimizing Quotient Filters using Graveyard Hashing
par: Quaye, Isabelle, et autres
Publié: (2025)

A Tour of Locality Sensitive Filtering on the Sphere
par: Becchetti, Luca, et autres
Publié: (2026)

Constraint Satisfaction Problems with Advice
par: Ghoshal, Suprovat, et autres
Publié: (2024)

The Peculiarities of Extending Queue Layouts
par: Depian, Thomas, et autres
Publié: (2025)

Max-Cut with Multiple Cardinality Constraints
par: Makarychev, Yury, et autres
Publié: (2025)

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
par: Karathanasis, Konstantinos, et autres
Publié: (2025)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

On the Bidirected Cut Relaxation for Steiner Forest
par: Byrka, Jarosław, et autres
Publié: (2024)

Width Parameters for Minimum Flow Decomposition
par: Grigorjew, Andreas, et autres
Publié: (2024)

Fixed-Parameter Tractability of Hedge Cut
par: Fomin, Fedor V., et autres
Publié: (2024)

Approximation Algorithms for Digraph Width Parameters
par: Kintali, Shiva, et autres
Publié: (2011)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
par: Suga, Tatsuhiro, et autres
Publié: (2025)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
par: Osterkamp, Eric M., et autres
Publié: (2024)