scientific article; zbMATH DE number 3340123

Cited in

(72)

Semi-local longest common subsequences in subquadratic time
Matching subsequences in trees
An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
New algorithms for the LCS problem
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
Data structures and algorithms for approximate string matching
A practical algorithm for Boolean matrix multiplication
A faster algorithm computing string edit distances
The string merging problem
A sensitive transitive closure algorithm
Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
On computing the transitive closure of a relation
A constant update time finger search tree
Recognizing quasi-triangulated graphs.
An efficient algorithm for LCS problem between two arbitrary sequences
An improved transitive closure algorithm
On the number of ANDs versus the number of ORs in monotone Boolean circuits
Partially local multi-way alignments
Path querying on acyclic graphs using Boolean grammars
A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
Improved normal form for grammars with one-sided contexts
Deposition and extension approach to find longest common subsequence for thousands of long sequences
Fast and compact regular expression matching
A hardness result and new algorithm for the longest common palindromic subsequence problem
Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Towards optimal packed string matching
Complexity of the path avoiding forbidden pairs problem revisited
All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
Fast matrix decomposition in F₂
Efficient determination of the transitive closure of a directed graph
Quantum complexity of Boolean matrix multiplication and related problems
Optimization of \(\mathsf {LPN}\) solving algorithms
Worst case efficient single and multiple string matching in the RAM model
Edit distance with duplications and contractions revisited
Algebraic dynamic programming for multiple context-free grammars
Lower bounds for combinatorial algorithms for Boolean matrix multiplication
Full-text indexes for high-throughput sequencing
Fast Searching in Packed Strings
Parsing by matrix multiplication generalized to Boolean grammars
Conjunctive and Boolean grammars: the true general case of the context-free grammars
Efficient string matching on packed texts
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Fast matrix multiplication and its algebraic neighbourhood
Conditional hardness for sensitivity problems
Tighter connections between Formula-SAT and shaving logs
scientific article; zbMATH DE number 7559452 (Why is no real title available?)
Even faster elastic-degenerate string matching via fast matrix multiplication
Fast searching in packed strings
scientific article; zbMATH DE number 7053319 (Why is no real title available?)
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Elastic-Degenerate String Matching via Fast Matrix Multiplication
Optimal Las Vegas reduction from one-way set reconciliation to error correction
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
A sum-over-paths extension of edit distances accounting for all sequence alignments
A fast output-sensitive algorithm for Boolean matrix multiplication
OnionPIR: effective protection of sensitive metadata in online communication networks
Faster combinatorial \(k\)-clique algorithms
Parallel detection of all palindromes in a string
On the calculation of transitive reduction-closure of orders
Computing longest common subsequence under Cartesian-tree matching model
Subsequence matching and LCS under Cartesian-tree equivalence
A new efficient algorithm for computing the longest common subsequence
The four corners problem over larger alphabets
A note on Boolean matrix multiplication
Computing a longest common subsequence for a set of strings
Speeding up HMM decoding and training by exploiting sequence repetitions
An O(NP) sequence comparison algorithm
Algorithms for computing variants of the longest common subsequence problem
New efficient algorithms for the LCS and constrained LCS problems
Fast multiplication of matrices over a finitely generated semiring
The Mailman algorithm: a note on matrix-vector multiplication
Efficient algorithms for clique problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616735)