Cover Image

A (Weakly) Polynomial Algorithm for AIVF Coding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dolatabadi, Reza Hosseini, Golin, Mordecai J., Zamani, Arian
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms F.2; E.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

New Entropy Measures for Tries with Applications to the XBWT
by: Carfagna, Lorenzo, et al.
Published: (2025)

Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
by: Golin, Mordecai J., et al.
Published: (2018)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
by: Mukhopadhyay, Asish, et al.
Published: (2024)

Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
by: Blondin, Michael, et al.
Published: (2024)

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

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

Optimal Preprocessing for Answering On-Line Product Queries
by: Alon, Noga, et al.
Published: (2024)

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

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

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

The World's Fastest Matching Engine Algorithm
by: Yoon, Jake
Published: (2026)

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

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
by: Masson, Charles, et al.
Published: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
by: Gouvine, Gabriel
Published: (2023)

A Faster Directed Single-Source Shortest Path Algorithm
by: Duan, Ran, et al.
Published: (2026)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
by: Assadi, Sepehr, et al.
Published: (2022)

A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm
by: Abdulaziz, Mohammad, et al.
Published: (2024)

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

Streaming Algorithms for Bin Packing and Vector Scheduling
by: Cormode, Graham, et al.
Published: (2019)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
by: Goldenberg, Elazar, et al.
Published: (2022)

New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
by: Chakrabarti, Amit, et al.
Published: (2024)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
by: De Stefani, Lorenzo, et al.
Published: (2024)

The Markov-Chain Polytope with Applications
by: Golin, Mordecai J., et al.
Published: (2024)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
by: Hušek, Radek, et al.
Published: (2020)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
by: Gæde, Emil Toftegaard, et al.
Published: (2025)

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric
by: Chakraborty, Arya
Published: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
by: Jacob, Ashwin, et al.
Published: (2026)

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

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)

A Framework for Algorithm Stability
by: Meulemans, Wouter, et al.
Published: (2017)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
by: Bell, Tolson, et al.
Published: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
by: Agarwala, Aryan, et al.
Published: (2024)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)

Improving Online Bin Covering with Little Advice
by: Brodnik, Andrej, et al.
Published: (2025)