nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An O(n) time algorithm for maximum matching on cographs
|
Yu, Ming-Shing |
|
1993 |
47 |
2 |
p. 89-93 5 p. |
artikel |
2 |
An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
|
Park, Heonchul |
|
1993 |
47 |
2 |
p. 109-113 5 p. |
artikel |
3 |
Improved bounds for the max-flow min-multicut ratio for planar and K r, r -free graphs
|
Tardos, Éva |
|
1993 |
47 |
2 |
p. 77-80 4 p. |
artikel |
4 |
On Simon's string searching algorithm
|
Hancart, Christophe |
|
1993 |
47 |
2 |
p. 95-99 5 p. |
artikel |
5 |
On the non-existence of maximal inference degrees for language identification
|
Jain, Sanjay |
|
1993 |
47 |
2 |
p. 81-88 8 p. |
artikel |
6 |
On the union of 0L languages
|
Dassow, Jürgen |
|
1993 |
47 |
2 |
p. 59-63 5 p. |
artikel |
7 |
Semantics and properties of existential quantifiers in deductive databases
|
Lee, Sang Ho |
|
1993 |
47 |
2 |
p. 101-108 8 p. |
artikel |
8 |
Shortest path computations in source-deplanarized graphs
|
Frederickson, Greg N. |
|
1993 |
47 |
2 |
p. 71-75 5 p. |
artikel |
9 |
Simple LPO constraint solving methods
|
Nieuwenhuis, Robert |
|
1993 |
47 |
2 |
p. 65-69 5 p. |
artikel |