Imagen de Portada

RIP Linked List

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sonntag, Benoît, Colnet, Dominique
Formato:	Preprint
Publicado:	2023
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

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
por: Meel, Kuldeep S., et al.
Publicado: (2025)

#CFG and #DNNF admit FPRAS
por: Meel, Kuldeep S., et al.
Publicado: (2024)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
por: Meel, Kuldeep S., et al.
Publicado: (2024)

Layered List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
por: Dalirrooyfard, Mina, et al.
Publicado: (2023)

Nearly Optimal List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

List Update with Delays or Time Windows
por: Azar, Yossi, et al.
Publicado: (2023)

Listing 6-Cycles in Sparse Graphs
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

The Compilability Thresholds of 2-CNF to OBDD
por: de Colnet, Alexis, et al.
Publicado: (2026)

Transposition is Nearly Optimal for IID List Update
por: Coester, Christian
Publicado: (2026)

Online List Labeling with Near-Logarithmic Writes
por: Seybold, Martin P.
Publicado: (2024)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
por: Bringmann, Karl, et al.
Publicado: (2026)

Sampling List Packings
por: Camrud, Evan, et al.
Publicado: (2024)

Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
por: Matsui, Tomomi, et al.
Publicado: (2016)

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

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
por: Bishnu, Arijit, et al.
Publicado: (2024)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
por: Bringmann, Karl, et al.
Publicado: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
por: Basiak, Mateusz, et al.
Publicado: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
por: Amarilli, Antoine, et al.
Publicado: (2024)

Methodology of Algorithm Engineering
por: Mendling, Jan, et al.
Publicado: (2023)

Private List Learnability vs. Online List Learnability
por: Hanneke, Steve, et al.
Publicado: (2025)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
por: Wang, Kaixin, et al.
Publicado: (2023)

Listing Even Cycles Faster than the Submodular-Width Barrier
por: Nakos, Vasileios, et al.
Publicado: (2026)

A Characterization of List Regression
por: Pabbaraju, Chirag, et al.
Publicado: (2024)

High-Accuracy List-Decodable Mean Estimation
por: Chen, Ziyun, et al.
Publicado: (2025)

List Locally Surjective Homomorphisms in Hereditary Graph Classes
por: Dvořák, Pavel, et al.
Publicado: (2022)

Cutwidth Bounds via Vertex Partitions
por: Amarilli, Antoine, et al.
Publicado: (2025)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
por: Ashvinkumar, Vikrant, et al.
Publicado: (2025)

Solving the List Coloring Problem through a Branch-and-Price algorithm
por: Lucci, Mauro, et al.
Publicado: (2023)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
por: Peikert, Chris, et al.
Publicado: (2025)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
por: Nanta, Jiratchaphat, et al.
Publicado: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
por: Ly, Hoang, et al.
Publicado: (2025)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
por: Esmer, Barış Can, et al.
Publicado: (2022)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
por: de Colnet, Alexis, et al.
Publicado: (2026)

From Tensor Networks to Tractable Circuits, and back
por: Quist, Arend-Jan, et al.
Publicado: (2026)

Can You Link Up With Treewidth?
por: Curticapean, Radu, et al.
Publicado: (2024)

Log-Sobolev inequality for near critical Ising models
por: Bauerschmidt, Roland, et al.
Publicado: (2022)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)