nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear time algorithm for unique Horn satisfiability
|
Pretolani, Daniele |
|
1993 |
48 |
2 |
p. 61-66 6 p. |
artikel |
2 |
An incremental LL(1) parsing algorithm
|
Yang, Wuu |
|
1993 |
48 |
2 |
p. 67-72 6 p. |
artikel |
3 |
A remark on the regulation of k1ETOL systems
|
Gärtner, Stefan |
|
1993 |
48 |
2 |
p. 83-85 3 p. |
artikel |
4 |
Bounds on sample space size for matrix product verification
|
Chinn, Donald D. |
|
1993 |
48 |
2 |
p. 87-91 5 p. |
artikel |
5 |
Enumerating k-way trees
|
Atkinson, M.D. |
|
1993 |
48 |
2 |
p. 73-75 3 p. |
artikel |
6 |
Fast algorithms for approximately counting mismatches
|
Karloff, Howard |
|
1993 |
48 |
2 |
p. 53-60 8 p. |
artikel |
7 |
Kaikoura tree theorems: Computing the maximum agreement subtree
|
Steel, Mike |
|
1993 |
48 |
2 |
p. 77-82 6 p. |
artikel |
8 |
On bounded-probability operators and C=P
|
Gupta, Sanjay |
|
1993 |
48 |
2 |
p. 93-98 6 p. |
artikel |
9 |
Worst-case performance of some heuristics for Steiner's problem in directed graphs
|
Voss, Stefan |
|
1993 |
48 |
2 |
p. 99-105 7 p. |
artikel |