Image de couverture de livre

Global certification via perfect hashing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bousquet, Nicolas, Feuilloley, Laurent, Zeitoun, Sébastien
Format:	Preprint
Publié:	2024
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Complexity landscape for local certification
par: Bousquet, Nicolas, et autres
Publié: (2025)

Renaming in distributed certification
par: Bousquet, Nicolas, et autres
Publié: (2024)

Local certification of forbidden subgraphs
par: Bousquet, Nicolas, et autres
Publié: (2024)

A subquadratic certification scheme for P5-free graphs
par: Bousquet, Nicolas, et autres
Publié: (2024)

Reductions in local certification
par: Esperet, Louis, et autres
Publié: (2025)

Optimal local certification on graphs of bounded pathwidth
par: Baterisna, Dan Alden, et autres
Publié: (2025)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

A Distributed Conductance Tester Without Global Information Collection
par: Batu, Tugkan, et autres
Publié: (2023)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
par: Lechowicz, Adam, et autres
Publié: (2023)

Min-Max Correlation Clustering via Neighborhood Similarity
par: Cao, Nairen, et autres
Publié: (2025)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
par: Bourreau, Yann, et autres
Publié: (2025)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
par: Bourreau, Yann, et autres
Publié: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
par: Chang, Yi-Jun, et autres
Publié: (2022)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
par: Censor-Hillel, Keren, et autres
Publié: (2023)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
par: Yang, Mingqi
Publié: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., et autres
Publié: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
par: Prokopenko, Andrey, et autres
Publié: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
par: Pourdamghani, Arash, et autres
Publié: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Parallel Integer Sort: Theory and Practice
par: Dong, Xiaojun, et autres
Publié: (2024)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
par: Akker, Erik van den, et autres
Publié: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
par: Chang, Yi-Jun, et autres
Publié: (2024)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
par: Polyanskii, Nikita, et autres
Publié: (2024)

Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
par: Ngo, Vinh Quang, et autres
Publié: (2024)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

Massively Parallel Ruling Set Made Deterministic
par: Giliberti, Jeff, et autres
Publié: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
par: Almeida, Paulo Sérgio, et autres
Publié: (2024)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
par: Sanders, Peter, et autres
Publié: (2024)

Efficient Enumeration of Large Maximal k-Plexes
par: Cheng, Qihao, et autres
Publié: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

Deterministic Expander Routing: Faster and More Versatile
par: Chang, Yi-Jun, et autres
Publié: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
par: Halldórsson, Magnús M., et autres
Publié: (2024)