Pages that link to "Item:Q4337636"
From MaRDI portal
The following pages link to Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds (Q4337636):
Displayed 50 items.
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Set families with a forbidden pattern (Q518191) (← links)
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- On approximating the stationary distribution of time-reversible Markov chains (Q1987513) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- A structure theorem for almost low-degree functions on the slice (Q2218715) (← links)
- On negative dependence properties of Latin hypercube samples and scrambled nets (Q2238851) (← links)
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples (Q2240873) (← links)
- A constructive proof of a concentration bound for real-valued random variables (Q2308463) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Distributed edge coloration for bipartite networks (Q2377126) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Discrepancy of high-dimensional permutations (Q2826225) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- On Approximating the Stationary Distribution of Time-reversible Markov Chains (Q3304112) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
- Perfect matchings and Hamiltonian cycles in the preferential attachment model (Q4633318) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- (Q5075787) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
- Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures (Q5414152) (← links)
- Online Ramsey games for more than two colors (Q5739100) (← links)
- (Q5743510) (← links)
- (Q5875456) (← links)
- A simple approach for adapting continuous load balancing processes to discrete settings (Q5890706) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- Sublinear Algorithms for Local Graph-Centrality Estimation (Q6093189) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Better security-efficiency trade-offs in permutation-based two-party computation (Q6157519) (← links)
- Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs (Q6179417) (← links)