Imagen de Portada

Parallel Derandomization for Coloring

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Coy, Sam, Czumaj, Artur, Davies, Peter, Mishra, Gopinath
Formato:	Preprint
Publicado:	2023
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

On Parallel $k$-Center Clustering
por: Coy, Sam, et al.
Publicado: (2023)

Optimal (degree+1)-Coloring in Congested Clique
por: Coy, Sam, et al.
Publicado: (2023)

Log Diameter Rounds MST Verification and Sensitivity in MPC
por: Coy, Sam, et al.
Publicado: (2024)

Streaming Graph Algorithms in the Massively Parallel Computation Model
por: Czumaj, Artur, et al.
Publicado: (2025)

Property Testing of Computational Networks
por: Czumaj, Artur, et al.
Publicado: (2025)

Testing Depth First Search Numbering
por: Czumaj, Artur, et al.
Publicado: (2025)

Streaming Algorithms for Geometric Steiner Forest
por: Czumaj, Artur, et al.
Publicado: (2020)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
por: Chan, Timothy M.
Publicado: (2026)

Worst-Case to Expander-Case Reductions: Derandomized and Generalized
por: Abboud, Amir, et al.
Publicado: (2024)

Cactus Representation of Minimum Cuts: Derandomize and Speed up
por: He, Zhongtian, et al.
Publicado: (2024)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
por: Bishnu, Arijit, et al.
Publicado: (2025)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
por: Yan, Shuyi
Publicado: (2025)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
por: Bishnu, Arijit, et al.
Publicado: (2024)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
por: Czumaj, Artur, et al.
Publicado: (2025)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Network Design on Undirected Series-Parallel Graphs
por: Bansal, Ishan, et al.
Publicado: (2024)

Dynamic Graph Coloring: Sequential, Parallel, and Distributed
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model
por: Chakraborty, Sourav, et al.
Publicado: (2024)

Round and Communication Efficient Graph Coloring
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
por: Bishnu, Arijit, et al.
Publicado: (2025)

Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
por: Davies-Peck, Peter
Publicado: (2026)

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval
por: Becht, Matthias, et al.
Publicado: (2024)

Derandomizing Multi-Distribution Learning
por: Larsen, Kasper Green, et al.
Publicado: (2024)

Engineering Optimal Parallel Task Scheduling
por: Akram, Matthew, et al.
Publicado: (2024)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
por: Goranci, Gramoz, et al.
Publicado: (2025)

Parallel PLL on DAGs
por: Steil, Patrick
Publicado: (2025)

Tree Coloring: Random Order and Predictions
por: Frei, Fabian, et al.
Publicado: (2024)

Chorba: A novel CRC32 implementation
por: Russell, Sam
Publicado: (2024)

An Optimal Density Bound for Discretized Point Patrolling
por: Mishra, Ahan
Publicado: (2025)

Coloring Reconfiguration under Color Swapping
por: Fuchs, Janosch, et al.
Publicado: (2025)

Deterministic Edge Coloring with few Colors in CONGEST
por: Blikstad, Joakim, et al.
Publicado: (2026)

Efficient Parallel Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2026)

Compact Parallel Hash Tables on the GPU
por: Hegeman, Steef, et al.
Publicado: (2024)

Parallel Higher-order Truss Decomposition
por: Chen, Chen, et al.
Publicado: (2024)

Coloring 3-Colorable Graphs with Low Threshold Rank
por: Hsieh, Jun-Ting
Publicado: (2025)

Provably Fast and Space-Efficient Parallel Biconnectivity
por: Dong, Xiaojun, et al.
Publicado: (2023)