Image de couverture de livre

Set Parameterized Matching via Multi-Layer Hashing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lewenstein, Moshe, Porat, Ely
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms 68 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

PtrHash: Minimal Perfect Hashing at RAM Throughput
par: Koerkamp, Ragnar Groot
Publié: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
par: Bell, Tolson, et autres
Publié: (2024)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

Structural Parameterization of Steiner Tree Packing
par: Hastrich, Niko, et autres
Publié: (2025)

Steiner Tree Parameterized by Multiway Cut and Even Less
par: Jansen, Bart M. P., et autres
Publié: (2024)

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

Maximizing Diversity in (near-)Median String Selection
par: Chakraborty, Diptarka, et autres
Publié: (2026)

Simple minimally unsatisfiable subsets of 2-CNFs
par: Kullmann, Oliver, et autres
Publié: (2026)

String 2-Covers with No Length Restrictions
par: Boneh, Itai, et autres
Publié: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

Hairpin Completion Distance Lower Bound
par: Boneh, Itai, et autres
Publié: (2024)

Overlapping Biclustering
par: Bentert, Matthias, et autres
Publié: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

Testing forbidden order-pattern properties on hypergrids
par: Chandramouleeswaran, Harish, et autres
Publié: (2025)

PPSZ is better than you think
par: Scheder, Dominik
Publié: (2022)

Tree Containment Parameterized by Scanwidth
par: van Iersel, Leo, et autres
Publié: (2026)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
par: Emmerich, Michael
Publié: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

On the Online Weighted Non-Crossing Matching Problem
par: Boyar, Joan, et autres
Publié: (2026)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Approximation Algorithms for Action-Reward Query-Commit Matching
par: Derakhshan, Mahsa, et autres
Publié: (2026)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
par: Shigemizu, Mika, et autres
Publié: (2018)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
par: Krithika, R., et autres
Publié: (2023)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
par: Dvořák, Pavel, et autres
Publié: (2017)

Large cliques and large independent sets: can they coexist?
par: Feige, Uriel, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
par: Jansson, Jesper, et autres
Publié: (2024)

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)

On Solving Simple Curved Nonograms
par: Löffler, Maarten, et autres
Publié: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
par: Jansen, Klaus, et autres
Publié: (2024)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Maintaining Routing Structures under Deletions via Self-Pruning
par: Haeupler, Bernhard, et autres
Publié: (2025)