Imagen de Portada

Tight Bounds for Sampling q-Colorings via Coupling from the Past

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ding, Tianxing, Liu, Hongyang, Yin, Yitong, Zhou, Can
Formato:	Preprint
Publicado:	2025
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

Parallelize Single-Site Dynamics up to Dobrushin Criterion
por: Liu, Hongyang, et al.
Publicado: (2021)

Efficient Parallel Ising Samplers via Localization Schemes
por: Chen, Xiaoyu, et al.
Publicado: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
por: Harris, David G., et al.
Publicado: (2026)

Local Gibbs sampling beyond local uniformity
por: Liu, Hongyang, et al.
Publicado: (2025)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Work-Efficient Parallel Counting via Sampling
por: Liu, Hongyang, et al.
Publicado: (2024)

Tight Bounds for Classical Open Addressing
por: Bender, Michael A., et al.
Publicado: (2024)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
por: Kuszmaul, William, et al.
Publicado: (2024)

A Sampling Lovász Local Lemma for Large Domain Sizes
por: Wang, Chunyang, et al.
Publicado: (2023)

Nearly Tight Bounds for the Online Sorting Problem
por: Azar, Yossi, et al.
Publicado: (2025)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Tight Bounds for Sorting Under Partial Information
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Perfect Simulation of Las Vegas Algorithms via Local Computation
por: Fu, Xinyu, et al.
Publicado: (2023)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
por: Kosolobov, Dmitry
Publicado: (2024)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

Tight Lower Bounds for Central String Queries in Compressed Space
por: Kempa, Dominik, et al.
Publicado: (2025)

A Tight Lower Bound for Cycle Detection in Grid Graphs
por: Au, Andrew
Publicado: (2026)

Tight Static Lower Bounds for Non-Adaptive Data Structures
por: Persiano, Giuseppe, et al.
Publicado: (2020)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
por: Wlodarczyk, Michal
Publicado: (2023)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
por: Das, Syamantak, et al.
Publicado: (2024)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
por: Räcke, Harald, et al.
Publicado: (2024)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
por: Azarmehr, Amir, et al.
Publicado: (2025)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
por: Geng, Yutong, et al.
Publicado: (2025)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
por: Feng, Shiyuan, et al.
Publicado: (2025)

Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds
por: Mahpud, Bar, et al.
Publicado: (2025)

Tight Bounds for Gaussian Mean Estimation under Personalized Differential Privacy
por: Dong, Wei, et al.
Publicado: (2026)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
por: Cheng, Yu, et al.
Publicado: (2024)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes
por: Green-Maimon, Naomi, et al.
Publicado: (2025)

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

Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
por: Chua, Lynn, et al.
Publicado: (2026)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
por: Cohen, Edith, et al.
Publicado: (2024)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
por: Bringmann, Karl, et al.
Publicado: (2026)

Nearly Tight Bounds on Testing of Metric Properties
por: Bao, Yiqiao, et al.
Publicado: (2024)

Nearly-Tight Bounds for Zonotope Containment and Beyond
por: Eisenbrand, Friedrich, et al.
Publicado: (2026)

Tight Bounds for Learning Polyhedra with a Margin
por: Patel, Shyamal, et al.
Publicado: (2026)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
por: Rapoport, Emma, et al.
Publicado: (2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
por: Biniaz, Ahmad, et al.
Publicado: (2025)