Imagen de Portada

Gray Codes With Constant Delay and Constant Auxiliary Space

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Amarilli, Antoine, David, Claire, Francis, Nadime, Marsault, Victor, Monet, Mikaël, Strozecki, Yann
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

From Amortized to Worst Case Delay in Enumeration Algorithms
por: Capelli, Florent, et al.
Publicado: (2021)

Enumerating models of DNF faster: breaking the dependency on the formula size
por: Capelli, Florent, et al.
Publicado: (2018)

Complexity of Finding and Enumerating Interconnection Trees
por: Demange, Noé, et al.
Publicado: (2026)

The S-Hamiltonian Cycle Problem
por: Amarilli, Antoine, et al.
Publicado: (2026)

Distinct Shortest Walk Enumeration for RPQs
por: David, Claire, et al.
Publicado: (2023)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
por: Kumar, Mrinal, et al.
Publicado: (2024)

Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
por: Amarilli, Antoine, et al.
Publicado: (2025)

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
por: Grandjean, Étienne, et al.
Publicado: (2025)

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
por: Tale, Prafullkumar
Publicado: (2025)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
por: Amarilli, Antoine, et al.
Publicado: (2023)

Constant congestion linkages in polynomially strong digraphs in polynomial time
por: Lopes, Raul, et al.
Publicado: (2024)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
por: Gall, François Le
Publicado: (2024)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
por: Yu, Xifan, et al.
Publicado: (2024)

On the Constant-Depth Circuit Complexity of Generating Quasigroups
por: Collins, Nathaniel A., et al.
Publicado: (2024)

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

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
por: Bodlaender, Hans L., et al.
Publicado: (2026)

On the Space Complexity of Online Convolution
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

The Structure of In-Place Space-Bounded Computation
por: Cook, James, et al.
Publicado: (2025)

Improved Space Bounds for Subset Sum
por: Belova, Tatiana, et al.
Publicado: (2024)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
por: Amarilli, Antoine, et al.
Publicado: (2026)

3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
por: Chia, Nai-Hui, et al.
Publicado: (2025)

Near-Optimal Space Lower Bounds for Streaming CSPs
por: Fei, Yumou, et al.
Publicado: (2026)

Linear Space Streaming Lower Bounds for Approximating CSPs
por: Chou, Chi-Ning, et al.
Publicado: (2021)

A Space-space Trade-off for Directed st-Connectivity
por: Edenhofer, Roman
Publicado: (2026)

Frontier Space-Time Algorithms Using Only Full Memory
por: Chmel, Petr, et al.
Publicado: (2026)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
por: Shih, Yu-Sheng, et al.
Publicado: (2026)

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space
por: Sajith, Thejas Radhika
Publicado: (2025)

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
por: Grossman, Ofer, et al.
Publicado: (2023)

Survey of Results on the ModPath and ModCycle Problems
por: Amarilli, Antoine
Publicado: (2024)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
por: Asadi, Vahid R., et al.
Publicado: (2026)

Encoding Co-Lex Orders of Finite-State Automata in Linear Space
por: Becker, Ruben, et al.
Publicado: (2025)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
por: Baril, Ambroise, et al.
Publicado: (2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
por: Bhattacharya, Sudatta, et al.
Publicado: (2025)

Sequence graphs realizations and ambiguity in language models
por: Khalife, Sammy, et al.
Publicado: (2024)

Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables
por: Jonsson, Peter, et al.
Publicado: (2025)

Near-Optimal Averaging Samplers and Matrix Samplers
por: Xun, Zhiyang, et al.
Publicado: (2024)

AdaBoost is not an Optimal Weak to Strong Learner
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)

Linear Hashing Is Optimal
por: Jaber, Michael, et al.
Publicado: (2025)