:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Gavoille, Cyril, Hanusse, Nicolas, Bouder, Gabriel Le, Marcé, Taïssir
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2503.22521
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Freeze-Tag in $L_1$ has Wake-up Time Five
por: Bonichon, Nicolas, et al.
Publicado: (2024)

Isometric-Universal Graphs for Trees
por: Baucher, Edgar, et al.
Publicado: (2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

Meta-Theorems for Cuttable Distributed Problems
por: Bonamy, Marthe, et al.
Publicado: (2026)

Tag arrays
por: Gagie, Travis
Publicado: (2024)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
por: Gerlach, Raphael, et al.
Publicado: (2024)

Multi-Slot Tag Assignment Problem in Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
por: Bousquet, Nicolas, et al.
Publicado: (2025)

Influential Slot and Tag Selection in Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms
por: Nicaud, Cyril, et al.
Publicado: (2025)

Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
por: Ciaperoni, Martino, et al.
Publicado: (2025)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
por: Kia, Solmaz S.
Publicado: (2025)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
por: Fekete, Sándor P., et al.
Publicado: (2022)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
por: de Berg, Mark, et al.
Publicado: (2025)

An Effective Tag Assignment Approach for Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

No Price Tags? No Problem: Query Strategies for Unpriced Information
por: Nadimpalli, Shivam, et al.
Publicado: (2025)

The Quantum Message Complexity of Distributed Wake-Up with Advice
por: Robinson, Peter, et al.
Publicado: (2026)

Revisiting RFID Missing Tag Identification
por: Liu, Kanghuai, et al.
Publicado: (2025)

Data-Driven Solution Portfolios
por: Drygala, Marina, et al.
Publicado: (2024)

A Textbook Solution for Dynamic Strings
por: Lipták, Zsuzsanna, et al.
Publicado: (2024)

On Thin Perfect Matchings up to Polylogarithmic Factors
por: Haqi, Alireza, et al.
Publicado: (2026)

Max Cut with Small-Dimensional SDP Solutions
por: Chang, Hsien-Chih, et al.
Publicado: (2026)

Approximately Counting Knapsack Solutions in Subquadratic Time
por: Feng, Weiming, et al.
Publicado: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
por: Kuszmaul, William, et al.
Publicado: (2024)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
por: Chen, Xi, et al.
Publicado: (2024)

Settling Weighted Token Swapping up to Algorithmic Barriers
por: Wein, Nicole, et al.
Publicado: (2025)

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

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

Near-real-time Solutions for Online String Problems
por: Köppl, Dominik, et al.
Publicado: (2026)

Matroid-Based TSP Rounding for Half-Integral Solutions
por: Gupta, Anupam, et al.
Publicado: (2021)

Rapid mixing of the down-up walk on matchings of a fixed size
por: Jain, Vishesh, et al.
Publicado: (2024)

Collision-Free Robot Scheduling
por: Adamson, Duncan, et al.
Publicado: (2024)

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
por: Domingues, Gabriel Marques
Publicado: (2026)

A Separator for Minor-Free Graphs Beyond the Flow Barrier
por: Le, Hung
Publicado: (2026)

Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
por: Horowicz, Noam, et al.
Publicado: (2025)

With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
por: Canonne, Clément L., et al.
Publicado: (2025)

Depth first representations of $k^2$-trees
por: Carmona, Gabriel, et al.
Publicado: (2025)

A $(1+ε)$-Approximation for Ultrametric Embedding in Subquadratic Time
por: Bathie, Gabriel, et al.
Publicado: (2025)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
por: Menand, Nicolas, et al.
Publicado: (2025)