:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Grodin, Harrison, Harper, Robert
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Data Structures and Algorithms Category Theory
Online Access:	https://arxiv.org/abs/2404.03641
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Critical Pair Enumeration Algorithm for String Diagram Rewriting
by: Matsui, Anna, et al.
Published: (2026)

Certified binary search tree on W-types
by: Arengas, Gustavo
Published: (2024)

Towards a Unified Theory of Time-Varying Data
by: Bumpus, Benjamin Merlin, et al.
Published: (2024)

A Coalgebraic Dijkstra Algorithm
by: Sanada, Takahiro, et al.
Published: (2026)

Amortized Analysis of Leftist Heaps
by: Schoenmakers, Berry
Published: (2024)

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)

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

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)

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

Subsequences in Bounded Ranges: Matching and Analysis Problems
by: Kosche, Maria, et al.
Published: (2022)

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

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

Efficient Coalgebraic Partition Refinement
by: Dorsch, Ulrich, et al.
Published: (2017)

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
by: Huang, Qunsheng, et al.
Published: (2024)

High-level quantum algorithm programming using Silq
by: Bezganovic, Viktorija, et al.
Published: (2024)

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

Quantum Backtracking in Qrisp Applied to Sudoku Problems
by: Seidel, Raphael, et al.
Published: (2024)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
by: Inenaga, Shunsuke, et al.
Published: (2024)

Exponent-Strings and Their Edit Distance
by: Baek, Ingyu
Published: (2024)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
by: Inenaga, Shunsuke
Published: (2024)

A closer look at TDFA
by: Borsotti, Angelo, et al.
Published: (2022)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

A Fast Algorithm for Computing Prefix Probabilities
by: Nowak, Franz, et al.
Published: (2023)

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

Absent Subsequences in Words
by: Kosche, Maria, et al.
Published: (2021)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2025)

$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

Algorithmical Aspects of Some Bio Inspired Operations
by: Dumitran, Marius
Published: (2025)

Dynamic Membership for Regular Tree Languages
by: Amarilli, Antoine, et al.
Published: (2025)

On Minimizers of Minimum Density
by: Shur, Arseny
Published: (2025)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
by: Taylor, Landon, et al.
Published: (2025)

Linear Time Subsequence and Supersequence Regex Matching
by: Amarilli, Antoine, et al.
Published: (2025)

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)