Imagen de Portada

ZOR filters: fast and smaller than fuse filters

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Limasset, Antoine
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

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
por: Ingels, Florian, et al.
Publicado: (2026)

A divide and conquer strategy for multinomial particle filter resampling
por: Popov, Andrey A.
Publicado: (2026)

Survey of Results on the ModPath and ModCycle Problems
por: Amarilli, Antoine
Publicado: (2024)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
por: Xu, Yuexuan, et al.
Publicado: (2024)

A fast and slightly robust covariance estimator
por: Duchi, John, et al.
Publicado: (2025)

Adaptive encodings for small and fast compressed suffix arrays
por: Díaz-Domínguez, Diego, et al.
Publicado: (2026)

New simple and fast quicksort algorithm for equal keys
por: Afereidoon, Parviz
Publicado: (2025)

The S-Hamiltonian Cycle Problem
por: Amarilli, Antoine, et al.
Publicado: (2026)

Edge-Minimum Walk of Modular Length in Polynomial Time
por: Amarilli, Antoine, et al.
Publicado: (2024)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
por: El-Hayek, Antoine, et al.
Publicado: (2024)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
por: El-Hayek, Antoine, et al.
Publicado: (2023)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
por: El-Hayek, Antoine, et al.
Publicado: (2025)

Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
por: Amarilli, Antoine, et al.
Publicado: (2025)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
por: Armbruster, Alexander, et al.
Publicado: (2026)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
por: Aggarwal, Divesh, et al.
Publicado: (2024)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
por: Ferragina, Paolo, et al.
Publicado: (2024)

Listing Even Cycles Faster than the Submodular-Width Barrier
por: Nakos, Vasileios, et al.
Publicado: (2026)

Interior point methods are not worse than Simplex
por: Allamigeon, Xavier, et al.
Publicado: (2022)

Path Contraction Faster than $2^n$
por: Agrawal, Akanksha, et al.
Publicado: (2025)

The Canadian Traveller Problem on outerplanar graphs
por: Beaudou, Laurent, et al.
Publicado: (2024)

MAX BISECTION might be harder to approximate than MAX CUT
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Approximating Queries on Probabilistic Graphs
por: Amarilli, Antoine, et al.
Publicado: (2023)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
por: Chandrasekaran, Gautam, et al.
Publicado: (2025)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
por: Joux, Antoine, et al.
Publicado: (2024)

Cutwidth Bounds via Vertex Partitions
por: Amarilli, Antoine, et al.
Publicado: (2025)

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

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
por: Byrka, Jarosław, et al.
Publicado: (2024)

How fast can you find a good hypothesis?
por: Aamand, Anders, et al.
Publicado: (2025)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks
por: Jing, Zeyu, et al.
Publicado: (2023)

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
por: Lecroq, Thierry
Publicado: (2024)

Gray Codes With Constant Delay and Constant Auxiliary Space
por: Amarilli, Antoine, et al.
Publicado: (2026)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
por: Bencs, Ferenc, et al.
Publicado: (2024)

Is nasty noise actually harder than malicious noise?
por: Blanc, Guy, et al.
Publicado: (2025)

Improved Algorithms for Clustering with Noisy Distance Oracles
por: Pradhan, Pinki, et al.
Publicado: (2026)

Faster Pseudo-Deterministic Minimum Cut
por: Kenneth-Mordoch, Yotam
Publicado: (2026)

Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
por: Jeang, John, et al.
Publicado: (2026)

High Probability Work Efficient Parallel Algorithms
por: Hutton, Chase, et al.
Publicado: (2026)

Approximating Tensor Network Contraction with Sketches
por: Heddes, Mike, et al.
Publicado: (2026)