Imagen de Portada

Explicit Min-wise Hash Families with Optimal Size

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Xue, Huang, Shengtang, Li, Xin
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Relationship Between Several Variants of the Linear Hashing Conjecture
por: Westover, Alek
Publicado: (2023)

Approximation Algorithms for Optimal Hopsets
por: Dinitz, Michael, et al.
Publicado: (2025)

Optimal Enumeration of Eulerian Trails in Directed Graphs
por: Bals, Ben, et al.
Publicado: (2026)

Optimal Padded Decomposition For Bounded Treewidth Graphs
por: Filtser, Arnold, et al.
Publicado: (2024)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
por: Bodini, Olivier, et al.
Publicado: (2024)

Placing Green Bridges Optimally for Robust Habitat Reconnection
por: Ellmies, Gero, et al.
Publicado: (2026)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
por: Efthymiou, Charilaos, et al.
Publicado: (2023)

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
por: Chen, Yu, et al.
Publicado: (2023)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
por: Baswana, Surender, et al.
Publicado: (2023)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
por: Dutta, Kunal, et al.
Publicado: (2026)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
por: Paschalidis, Phevos, et al.
Publicado: (2023)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
por: Carlson, Charlie, et al.
Publicado: (2024)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
por: Hsieh, Jun-Ting, et al.
Publicado: (2026)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
por: Nuti, Pranav, et al.
Publicado: (2022)

An Alternate Proof of Near-Optimal Light Spanners
por: Bodwin, Greg
Publicado: (2023)

Improved Streaming Algorithm for Fair $k$-Center Clustering
por: Guo, Longkun, et al.
Publicado: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

Approximation algorithms for non-sequential star packing problems
por: Hu, Mengyuan, et al.
Publicado: (2024)

Approximately covering vertices by order-$5$ or longer paths
por: Gong, Mingyang, et al.
Publicado: (2024)

Deterministic counting from coupling independence
por: Chen, Xiaoyu, et al.
Publicado: (2024)

Counting random $k$-SAT near the satisfiability threshold
por: Chen, Zongchen, et al.
Publicado: (2024)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

String Matching with a Dynamic Pattern
por: Monteiro, Bruno, et al.
Publicado: (2025)

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
por: Jordon, Addie, et al.
Publicado: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
por: Akmal, Shyan, et al.
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

Approximating Submodular Matroid-Constrained Partitioning
por: Bérczi, Kristóf, 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)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
por: Veldt, Nate
Publicado: (2025)

(Approximate) Matrix Multiplication via Convolutions
por: Uffenheimer, Yahel, et al.
Publicado: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
por: Arhire, Andrei, et al.
Publicado: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Source-Oblivious Broadcast
por: Fraigniaud, Pierre, et al.
Publicado: (2025)