Image de couverture de livre

A (Weakly) Polynomial Algorithm for AIVF Coding

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dolatabadi, Reza Hosseini, Golin, Mordecai J., Zamani, Arian
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms F.2; E.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

New Entropy Measures for Tries with Applications to the XBWT
par: Carfagna, Lorenzo, et autres
Publié: (2025)

Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
par: Golin, Mordecai J., et autres
Publié: (2018)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
par: Mukhopadhyay, Asish, et autres
Publié: (2024)

Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
par: Blondin, Michael, et autres
Publié: (2024)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
par: Krawczyk, Tomasz
Publié: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
par: Garg, Ishant
Publié: (2026)

Optimal Preprocessing for Answering On-Line Product Queries
par: Alon, Noga, et autres
Publié: (2024)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
par: Brodal, Gerth Stølting
Publié: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
par: Bushnell, Brian
Publié: (2026)

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
par: Krawczyk, Tomasz
Publié: (2024)

The World's Fastest Matching Engine Algorithm
par: Yoon, Jake
Publié: (2026)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
par: Berger, Benjamin
Publié: (2025)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
par: Masson, Charles, et autres
Publié: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
par: Gouvine, Gabriel
Publié: (2023)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
par: Assadi, Sepehr, et autres
Publié: (2022)

A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm
par: Abdulaziz, Mohammad, et autres
Publié: (2024)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
par: Sitters, René
Publié: (2025)

Streaming Algorithms for Bin Packing and Vector Scheduling
par: Cormode, Graham, et autres
Publié: (2019)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
par: Goldenberg, Elazar, et autres
Publié: (2022)

New Sorting Algorithm Wave Sort (W-Sort)
par: Wei, Jia Xu
Publié: (2025)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
par: Chakrabarti, Amit, et autres
Publié: (2024)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
par: Chuzhoy, Julia, et autres
Publié: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
par: Goswami, Mayank, et autres
Publié: (2022)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
par: De Stefani, Lorenzo, et autres
Publié: (2024)

The Markov-Chain Polytope with Applications
par: Golin, Mordecai J., et autres
Publié: (2024)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
par: Hušek, Radek, et autres
Publié: (2020)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
par: Gæde, Emil Toftegaard, et autres
Publié: (2025)

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric
par: Chakraborty, Arya
Publié: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
par: Jacob, Ashwin, et autres
Publié: (2026)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
par: Date, Vinicius T. V., et autres
Publié: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
par: Jiang, Xinwen, et autres
Publié: (2021)

A Framework for Algorithm Stability
par: Meulemans, Wouter, et autres
Publié: (2017)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
par: Bell, Tolson, et autres
Publié: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
par: Agarwala, Aryan, et autres
Publié: (2024)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Improving Online Bin Covering with Little Advice
par: Brodnik, Andrej, et autres
Publié: (2025)