Imagen de Portada

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Bowie, Wong, Dennis, Lam, Chan-Tong, Im, Marcus
Formato:	Preprint
Publicado:	2024
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

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
por: Liu, Bowie, et al.
Publicado: (2025)

Algorithms for the local and the global postage stamp problem
por: Palais, Léo Colisson, et al.
Publicado: (2026)

Greedy Gray Codes for some Restricted Classes of Binary Words
por: Hassler, Nathanaël, et al.
Publicado: (2024)

The self-concordant perceptron is efficient on a sub-family feasibility instances
por: Chan-Hon-Tong, Adrien
Publicado: (2019)

Constant delay Gray code enumeration of ideals and antichains in posets
por: Brenner, Sofia, et al.
Publicado: (2026)

New Algorithm for Combinatorial $n$-folds and Applications
por: Jansen, Klaus, et al.
Publicado: (2024)

Eliminating Left Recursion without the Epsilon
por: Smith, James
Publicado: (2019)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
por: Blažej, Václav, et al.
Publicado: (2024)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
por: Gupta, Sushmita, et al.
Publicado: (2025)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
por: Chen, Qingyun, et al.
Publicado: (2024)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
por: Dalirrooyfard, Mina, et al.
Publicado: (2026)

Recursive lattice reduction -- A framework for finding short lattice vectors
por: Aggarwal, Divesh, et al.
Publicado: (2023)

Exact recovery of planted cliques in semi-random graphs
por: Khanna, Yash
Publicado: (2020)

Capacity-Achieving Gray Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Online Distributed Queue Length Estimation
por: Bhaskara, Aditya, et al.
Publicado: (2025)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
por: Chan, Timothy M.
Publicado: (2026)

Robust Gray Codes Approaching the Optimal Rate
por: Con, Roni, et al.
Publicado: (2024)

Gray Codes With Constant Delay and Constant Auxiliary Space
por: Amarilli, Antoine, et al.
Publicado: (2026)

Probabilistic analysis of arithmetic coding showing its robustness
por: Mahmoud, Hosam M., et al.
Publicado: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
por: Im, Sungjin, et al.
Publicado: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
por: Burcsi, Péter, et al.
Publicado: (2020)

Diameter Computation on (Random) Geometric Graphs
por: Bläsius, Thomas, et al.
Publicado: (2026)

A Dynamic Working Set Method for Compressed Sensing
por: Cheng, Siu-Wing, et al.
Publicado: (2025)

Optimal Unlabeled Pebble Motion on Trees and its Application to Multi-Agent Path Finding
por: Calvi, Annalisa, et al.
Publicado: (2026)

Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
por: Jeffery, Stacey, et al.
Publicado: (2024)

Learning-Augmented Online Scheduling with Parsimonious Preemption
por: Blue, Mugen, et al.
Publicado: (2026)

Towards an algebraic approach to the reconfiguration CSP
por: Kimura, Kei
Publicado: (2025)

Engineering Dominating Patterns: A Fine-grained Case Study
por: Dransfeld, Jonathan, et al.
Publicado: (2025)

TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges
por: Qiu, Ruizhong, et al.
Publicado: (2025)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
por: Tsin, Yung H.
Publicado: (2023)

Carbonyl4: A Sketch for Set-Increment Mixed Updates
por: Zhao, Yikai, et al.
Publicado: (2024)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
por: Grigoriev, Alexander, et al.
Publicado: (2025)

Ultrabubble enumeration via a lowest common ancestor approach
por: Zisis, Athanasios E., et al.
Publicado: (2026)

Faster Algorithms for Text-to-Pattern Hamming Distances
por: Chan, Timothy M., et al.
Publicado: (2023)

Chromatic correlation clustering via cluster LP
por: Abbasi, Fateme, et al.
Publicado: (2025)

SimiSketch: Efficiently Estimating Similarity of streaming Multisets
por: Dong, Fenghao, et al.
Publicado: (2024)

ResidualSketch: Enhancing Layer Efficiency and Error Reduction in Hierarchical Heavy Hitter Detection with ResNet Innovations
por: Liu, Xilai, et al.
Publicado: (2025)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
por: Becchetti, Luca, et al.
Publicado: (2025)

OrderedCuts: A new approach for computing Gomory-Hu tree
por: Kolmogorov, Vladimir
Publicado: (2022)