Imagen de Portada

A note on the depth of optimal fanout-bounded prefix circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Sergeev, Igor S.
Formato:	Preprint
Publicado:	2025
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

Complexity of basic boolean operators for digital circuit design
por: Sergeev, Igor S.
Publicado: (2026)

Optimal prefix-suffix queries with applications
por: Pissis, Solon P.
Publicado: (2024)

Worst-case optimal adaptive alphabetic prefix-free coding
por: Gagie, Travis
Publicado: (2021)

Faster PBWT prefix-array access via batching
por: Gagie, Travis
Publicado: (2026)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
por: Sergeev, Ivan
Publicado: (2024)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
por: Czyżewska, Jadwiga, et al.
Publicado: (2025)

Deterministic factorization of constant-depth algebraic circuits in subexponential time
por: Bhattacharjee, Somnath, et al.
Publicado: (2025)

A short note about the learning-augmented secretary problem
por: Choo, Davin, et al.
Publicado: (2024)

A basic lower bound for property testing
por: Fischer, Eldar
Publicado: (2024)

Short circuit walks in fixed dimension
por: Black, Alexander E., et al.
Publicado: (2025)

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

Height-bounded Lempel-Ziv encodings
por: Bannai, Hideo, et al.
Publicado: (2024)

A note on Ordered Ruzsa-Szemerédi graphs
por: Pratt, Kevin
Publicado: (2025)

Upper bounds on the theta function of random graphs
por: Feige, Uriel, et al.
Publicado: (2025)

Optimal bounds on a tree inference algorithm
por: Gardiner, Jack, et al.
Publicado: (2024)

Improved bounds for group testing in arbitrary hypergraphs
por: De Bonis, Annalisa
Publicado: (2024)

A note on approximating the average degree of bounded arboricity graphs
por: Eden, Talya, et al.
Publicado: (2026)

Faster optimal univariate microgaggregation
por: Stamm, Felix I., et al.
Publicado: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
por: Lanzinger, Matthias, et al.
Publicado: (2023)

Testing $C_k$-freeness in bounded-arboricity graphs
por: Eden, Talya, et al.
Publicado: (2024)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

The Leafed Induced Subtree in chordal and bounded treewidth graphs
por: Baste, Julien
Publicado: (2023)

Tight bounds for the sensitivity of CDAWGs with left-end edits
por: Fujimaru, Hiroto, et al.
Publicado: (2023)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
por: Montanaro, Ashley, et al.
Publicado: (2024)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
por: Lachish, Oded, et al.
Publicado: (2026)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
por: Feng, Yilong, et al.
Publicado: (2025)

Dynamic r-index: An Updatable Self-Index in LCP-bounded Time
por: Nishimoto, Takaaki, et al.
Publicado: (2025)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
por: Bodlaender, Hans L., et al.
Publicado: (2025)

Approximating optimization problems in graphs with locational uncertainty
por: Bougeret, Marin, et al.
Publicado: (2022)

Instance-optimal estimation of L2-norm
por: Adar, Tomer
Publicado: (2026)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
por: Benchasattabuse, Naphan, et al.
Publicado: (2023)

Approximating maximum properly colored forests via degree bounded independent sets
por: Bai, Yuhang, et al.
Publicado: (2025)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
por: Clementino, Thailsson, et al.
Publicado: (2025)

Matrix Multiplication Reductions
por: Gola, Ashish, et al.
Publicado: (2024)

Near-optimal Algorithms for Stochastic Online Bin Packing
por: Ayyadevara, Nikhil, et al.
Publicado: (2022)

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
por: An, Shinwoo, et al.
Publicado: (2024)

GridOT -- a discrete optimal transport solver on grids
por: Rauch, Johannes, et al.
Publicado: (2025)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
por: Banerjee, Sandip, et al.
Publicado: (2025)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)