:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Sonntag, Benoît, Colnet, Dominique
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2306.06942
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Layered List Labeling
by: Bender, Michael A., et al.
Published: (2024)

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

Nearly Optimal List Labeling
by: Bender, Michael A., et al.
Published: (2024)

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

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

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

Transposition is Nearly Optimal for IID List Update
by: Coester, Christian
Published: (2026)

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

Sampling List Packings
by: Camrud, Evan, et al.
Published: (2024)

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

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

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

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

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

Private List Learnability vs. Online List Learnability
by: Hanneke, Steve, et al.
Published: (2025)

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

Methodology of Algorithm Engineering
by: Mendling, Jan, et al.
Published: (2023)

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

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

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

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

A Characterization of List Regression
by: Pabbaraju, Chirag, et al.
Published: (2024)

Cutwidth Bounds via Vertex Partitions
by: Amarilli, Antoine, et al.
Published: (2025)

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

Reconfiguration of List Colourings
by: Cambie, Stijn, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
by: Barth, Dominique, et al.
Published: (2018)

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