scientific article; zbMATH DE number 3340123
From MaRDI portal
Publication:5616735
zbMath0214.23601MaRDI QIDQ5616735
V. L. Arlazarov, M. A. Kronrod, Yefim Dinitz, I. A. Faradzhev
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs, Deposition and extension approach to find longest common subsequence for thousands of long sequences, A constant update time finger search tree, Speeding up HMM decoding and training by exploiting sequence repetitions, Algebraic dynamic programming for multiple context-free grammars, Unnamed Item, Fast and compact regular expression matching, An improved combinatorial algorithm for Boolean matrix multiplication, Data structures and algorithms for approximate string matching, A practical algorithm for Boolean matrix multiplication, A hardness result and new algorithm for the longest common palindromic subsequence problem, EERTREE: an efficient data structure for processing palindromes in strings, Parsing by matrix multiplication generalized to Boolean grammars, Quantum Complexity of Boolean Matrix Multiplication and Related Problems, Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back, Conjunctive and Boolean grammars: the true general case of the context-free grammars, A faster algorithm computing string edit distances, Optimization of $$\mathsf {LPN}$$ Solving Algorithms, Unnamed Item, A sum-over-paths extension of edit distances accounting for all sequence alignments, A fast output-sensitive algorithm for Boolean matrix multiplication, The string merging problem, A sensitive transitive closure algorithm, Fast matrix multiplication and its algebraic neighbourhood, Towards optimal packed string matching, An O(NP) sequence comparison algorithm, Efficient string matching on packed texts, Worst-case efficient single and multiple string matching on packed texts in the word-RAM model, Complexity of the path avoiding forbidden pairs problem revisited, An efficient algorithm for LCS problem between two arbitrary sequences, Recognizing quasi-triangulated graphs., Algorithms for computing variants of the longest common subsequence problem, Worst Case Efficient Single and Multiple String Matching in the RAM Model, Full-Text Indexes for High-Throughput Sequencing, A simple linear-space data structure for constant-time range minimum query, Parallel detection of all palindromes in a string, Edit Distance with Duplications and Contractions Revisited, A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem, Partially local multi-way alignments, On the calculation of transitive reduction-closure of orders, New efficient algorithms for the LCS and constrained LCS problems, Fast multiplication of matrices over a finitely generated semiring, All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time, Fast searching in packed strings, The Mailman algorithm: a note on matrix-vector multiplication, Efficient algorithms for clique problems, Two fast simulations which imply some fast string matching and palindrome-recognition algorithms, Unnamed Item, On computing the transitive closure of a relation, Unnamed Item, 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, Fast matrix decomposition in \(\mathbb F_2\), Optimal Las Vegas reduction from one-way set reconciliation to error correction, A new efficient algorithm for computing the longest common subsequence, Semi-local longest common subsequences in subquadratic time, Fast Searching in Packed Strings, Matching subsequences in trees, A note on Boolean matrix multiplication, Efficient determination of the transitive closure of a directed graph, An improved transitive closure algorithm, An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem, Computing a longest common subsequence for a set of strings, On the number of ANDs versus the number of ORs in monotone Boolean circuits, Unnamed Item, Unnamed Item, Unnamed Item, Elastic-Degenerate String Matching via Fast Matrix Multiplication, Improved normal form for grammars with one-sided contexts, New algorithms for the LCS problem
