Image de couverture de livre

RIP Linked List

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sonntag, Benoît, Colnet, Dominique
Format:	Preprint
Publié:	2023
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

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
par: Meel, Kuldeep S., et autres
Publié: (2025)

#CFG and #DNNF admit FPRAS
par: Meel, Kuldeep S., et autres
Publié: (2024)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
par: Meel, Kuldeep S., et autres
Publié: (2024)

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

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
par: Dalirrooyfard, Mina, et autres
Publié: (2023)

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

List Update with Delays or Time Windows
par: Azar, Yossi, et autres
Publié: (2023)

Listing 6-Cycles in Sparse Graphs
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

The Compilability Thresholds of 2-CNF to OBDD
par: de Colnet, Alexis, et autres
Publié: (2026)

Transposition is Nearly Optimal for IID List Update
par: Coester, Christian
Publié: (2026)

Online List Labeling with Near-Logarithmic Writes
par: Seybold, Martin P.
Publié: (2024)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
par: Bringmann, Karl, et autres
Publié: (2026)

Sampling List Packings
par: Camrud, Evan, et autres
Publié: (2024)

Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
par: Matsui, Tomomi, et autres
Publié: (2016)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
par: Chen, Xi, et autres
Publié: (2024)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
par: Bishnu, Arijit, et autres
Publié: (2024)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
par: Bringmann, Karl, et autres
Publié: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
par: Basiak, Mateusz, et autres
Publié: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
par: Amarilli, Antoine, et autres
Publié: (2024)

Methodology of Algorithm Engineering
par: Mendling, Jan, et autres
Publié: (2023)

Private List Learnability vs. Online List Learnability
par: Hanneke, Steve, et autres
Publié: (2025)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
par: Wang, Kaixin, et autres
Publié: (2023)

Listing Even Cycles Faster than the Submodular-Width Barrier
par: Nakos, Vasileios, et autres
Publié: (2026)

A Characterization of List Regression
par: Pabbaraju, Chirag, et autres
Publié: (2024)

High-Accuracy List-Decodable Mean Estimation
par: Chen, Ziyun, et autres
Publié: (2025)

List Locally Surjective Homomorphisms in Hereditary Graph Classes
par: Dvořák, Pavel, et autres
Publié: (2022)

Cutwidth Bounds via Vertex Partitions
par: Amarilli, Antoine, et autres
Publié: (2025)

Reconfiguration of List Colourings
par: Cambie, Stijn, et autres
Publié: (2025)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
par: Ashvinkumar, Vikrant, et autres
Publié: (2025)

Solving the List Coloring Problem through a Branch-and-Price algorithm
par: Lucci, Mauro, et autres
Publié: (2023)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
par: Peikert, Chris, et autres
Publié: (2025)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
par: Nanta, Jiratchaphat, et autres
Publié: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
par: Ly, Hoang, et autres
Publié: (2025)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
par: Esmer, Barış Can, et autres
Publié: (2022)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
par: de Colnet, Alexis, et autres
Publié: (2026)

From Tensor Networks to Tractable Circuits, and back
par: Quist, Arend-Jan, et autres
Publié: (2026)

Can You Link Up With Treewidth?
par: Curticapean, Radu, et autres
Publié: (2024)

Log-Sobolev inequality for near critical Ising models
par: Bauerschmidt, Roland, et autres
Publié: (2022)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)