:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Shi, Freda, Gimpel, Kevin, Livescu, Karen
Format:	Preprint
Published:	2024
Subjects:	Computation and Language Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2402.13433
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parsing Millions of URLs per Second
by: Nizipli, Yagiz, et al.
Published: (2023)

Neuro-symbolic Syntactic Parsing: Shaping a Neural Network with the CYK Algorithm
by: Zanzotto, Fabio Massimo, et al.
Published: (2026)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
by: Kociumaka, Tomasz, et al.
Published: (2014)

Algorithmically Establishing Trust in Evaluators
by: de Wynter, Adrian
Published: (2025)

Theoretical Analysis of Byte-Pair Encoding
by: Kozma, László, et al.
Published: (2024)

Fast Exact Retrieval for Nearest-neighbor Lookup (FERN)
by: Zhu, Richard
Published: (2024)

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
by: Shanto, MD Nazmul Alam, et al.
Published: (2026)

On the Complexity of the Matching Problem of Regular Expressions with Backreferences
by: Kumabe, Soh, et al.
Published: (2026)

Towards Optimal Multi-draft Speculative Decoding
by: Hu, Zhengmian, et al.
Published: (2025)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
by: Konstantinovsky, Thomas, et al.
Published: (2026)

Parsing Millions of DNS Records per Second
by: Koekkoek, Jeroen, et al.
Published: (2024)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
by: Leutgeb, Lorenz, et al.
Published: (2022)

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

Declarative Concurrent Data Structures
by: Raza, Aun, et al.
Published: (2024)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Coupling without Communication and Drafter-Invariant Speculative Decoding
by: Daliri, Majid, et al.
Published: (2024)

AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
by: Tatsuno, Kento, et al.
Published: (2024)

Tokenisation over Bounded Alphabets is Hard
by: Kastreva, Violeta, et al.
Published: (2025)

Minimum projective linearizations of trees in linear time
by: Alemany-Puig, Lluís, et al.
Published: (2021)

Characterizing the Effect of Noise in Language Generation in the Limit
by: Li, Aaron, et al.
Published: (2026)

A Partition Cover Approach to Tokenization
by: Lim, Jia Peng, et al.
Published: (2025)

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
by: Borchmann, Łukasz, et al.
Published: (2020)

A Tighter Complexity Analysis of SparseGPT
by: Li, Xiaoyu, et al.
Published: (2024)

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

Tokenisation is NP-Complete
by: Whittington, Philip, et al.
Published: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)

Tight Static Lower Bounds for Non-Adaptive Data Structures
by: Persiano, Giuseppe, et al.
Published: (2020)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
by: Cadilhac, Michaël, et al.
Published: (2025)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
by: Cohen, Cyril, et al.
Published: (2024)

Verified Purely Functional Catenable Real-Time Deques
by: Viennot, Jules, et al.
Published: (2025)

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

The Fine-Grained Complexity of Gradient Computation for Training Large Language Models
by: Alman, Josh, et al.
Published: (2024)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
by: Kurita, Kazuhiro, et al.
Published: (2025)

Diagram Control and Model Order for Sugiyama Layouts
by: Domrös, Sören, et al.
Published: (2024)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
by: Zhang, Qirun
Published: (2024)

Optimizations and extensions for fair join pattern matching
by: Karras, Ioannis
Published: (2025)

Towards Efficient Hash Maps in Functional Array Languages
by: Due, William Henrich, et al.
Published: (2025)

AbsInf: A Lightweight Object to Represent float('inf') in Dijkstra's Algorithm
by: Bellamkonda, Anjan, et al.
Published: (2025)

Efficient Dynamic Algorithms to Predict Short Races
by: Zhang, Minjian, et al.
Published: (2026)

Deep Learning and Machine Learning -- Python Data Structures and Mathematics Fundamental: From Theory to Practice
by: Chen, Silin, et al.
Published: (2024)