| Publication | Date of Publication | Type |
|---|
On locally optimal alignments in genetic sequences
STACS 92 | 2022-08-18 | Paper |
Algorithms and data structures
| 2013-02-12 | Paper |
On \(\mathrm{LR}(k)\)-parsers of polynomial size (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
On Negations in Boolean Networks
Lecture Notes in Computer Science | 2009-11-12 | Paper |
On parsing LL-languages
Theoretical Computer Science | 2002-03-03 | Paper |
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
Journal of Algorithms | 2000-08-24 | Paper |
scientific article; zbMATH DE number 1452980 (Why is no real title available?)
| 2000-05-25 | Paper |
An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
Information Processing Letters | 1997-02-28 | Paper |
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Information Processing Letters | 1997-02-27 | Paper |
scientific article; zbMATH DE number 619548 (Why is no real title available?)
| 1994-09-13 | Paper |
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals
Information Processing Letters | 1994-09-05 | Paper |
scientific article; zbMATH DE number 177842 (Why is no real title available?)
| 1993-05-18 | Paper |
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
SIAM Journal on Computing | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3946042 (Why is no real title available?)
| 1985-01-01 | Paper |
An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3907792 (Why is no real title available?)
| 1985-01-01 | Paper |
An area-maximum edge length trade-off for VSLI layout
Information and Control | 1985-01-01 | Paper |
A Boolean function requiring 3n network size
Theoretical Computer Science | 1984-01-01 | Paper |
Characterization of all optimal networks for a simultaneous computation of AND and NOR
Acta Informatica | 1984-01-01 | Paper |
More on the power of chain rules in context-free grammars
Theoretical Computer Science | 1983-01-01 | Paper |
A note on the parallel computation thesis
Information Processing Letters | 1983-01-01 | Paper |
On the power of chain rules in context free grammars
Acta Informatica | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3780587 (Why is no real title available?)
| 1982-01-01 | Paper |
On the average number of rebalancing operations in weight-balanced trees
Theoretical Computer Science | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3619922 (Why is no real title available?)
| 1979-01-01 | Paper |
