Image de couverture de livre

Singing a MIS

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Irani, Sandy, Luby, Michael
Format:	Preprint
Publié:	2025
Sujets:	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

Cycle Basis Algorithms for Reducing Maximum Edge Participation
par: Wang, Fan, et autres
Publié: (2025)

Quantum Metropolis Sampling via Weak Measurement
par: Jiang, Jiaqing, et autres
Publié: (2024)

Memory Hierarchy Design for Caching Middleware in the Age of NVM
par: Ghandeharizadeh, Shahram, et autres
Publié: (2025)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
par: Ghandeharizadeh, Shahram, et autres
Publié: (2024)

Graph Reconstruction via MIS Queries
par: Konrad, Christian, et autres
Publié: (2024)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
par: Dalirrooyfard, Mina, et autres
Publié: (2026)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
par: Hertrich, Christoph, et autres
Publié: (2020)

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

Breaking Barriers for Distributed MIS by Faster Degree Reduction
par: Khoury, Seri, et autres
Publié: (2025)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
par: Gila, Ofek, et autres
Publié: (2026)

Combinatorics of Palindromes
par: Itzhaki, Michael
Publié: (2025)

Asymptotically Optimal Representation of Palindromic Structure
par: Itzhaki, Michael
Publié: (2024)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
par: Arndt, Stephen, et autres
Publié: (2025)

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
par: Heeger, Klaus, et autres
Publié: (2024)

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

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds
par: Kapralov, Michael, et autres
Publié: (2022)

Spanning and Metric Tree Covers Parameterized by Treewidth
par: Elkin, Michael, et autres
Publié: (2025)

Controlling tail risk in two-slope ski rental
par: Cui, Qiming, et autres
Publié: (2025)

Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
par: Amir, Amihood, et autres
Publié: (2024)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
par: Goldenfeld, Michael Elkin Tanya
Publié: (2026)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
par: Elkin, Michael, et autres
Publié: (2023)

Almost Linear Size Edit Distance Sketch
par: Koucký, Michal, et autres
Publié: (2024)

Tree Search With Predictions
par: Dinitz, Michael, et autres
Publié: (2026)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
par: Elkin, Michael, et autres
Publié: (2024)

Faster optimal univariate microgaggregation
par: Stamm, Felix I., et autres
Publié: (2024)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
par: Neuwohner, Meike, et autres
Publié: (2025)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
par: Elberfeld, Michael, et autres
Publié: (2025)

Approximating optimization problems in graphs with locational uncertainty
par: Bougeret, Marin, et autres
Publié: (2022)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
par: Kapralov, Michael, et autres
Publié: (2024)

Approximating Prize-Collecting Variants of TSP
par: Alimi, Morteza, et autres
Publié: (2024)

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
par: Charikar, Moses, et autres
Publié: (2024)

GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
par: Jananthan, Hayden, et autres
Publié: (2025)

Nearly Optimal List Labeling
par: Bender, Michael A., et autres
Publié: (2024)

Optimal Non-Oblivious Open Addressing
par: Bender, Michael A., et autres
Publié: (2025)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
par: Dinitz, Michael, et autres
Publié: (2025)

Spectral Clustering in Birthday Paradox Time
par: Kapralov, Michael, et autres
Publié: (2026)