Suffix Trees in the Functional Programming Paradigm
Abstract elided by the publisher.
Related papers
- Procedural Abstraction with Reverse Prefix Trees CGO 2009
- Parallel suffix array and least common prefix for the GPU PPoPP 2013
- Theoretical analysis of classic algorithms on highly-threaded many-core GPUs PPoPP 2014
- Para-Functional Programming: A Paradigm for Programming Multiprocessor Systems POPL 1986
- Calibro: Compilation-Assisted Linking-Time Binary Code Outlining for Code Size Reduction in Android Applications CGO 2025
- A Counting Semantics for Monitoring LTL Specifications over Finite Traces CAV 2018
- Compiler techniques for code compaction TOPLAS 2000
- Evaluation of splittable pseudo-random generators JFP 2015