nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A non-factorial algorithm for canonical numbering of a graph
|
Corneil, Derek |
|
1984 |
5 |
3 |
p. 345-362 18 p. |
artikel |
2 |
An O(n log n) algorithm for finding all repetitions in a string
|
Main, Michael G |
|
1984 |
5 |
3 |
p. 422-432 11 p. |
artikel |
3 |
An optimal contour algorithm for iso-oriented rectangles
|
Hartmut Güting, Ralf |
|
1984 |
5 |
3 |
p. 303-326 24 p. |
artikel |
4 |
A separator theorem for graphs of bounded genus
|
Gilbert, John R |
|
1984 |
5 |
3 |
p. 391-407 17 p. |
artikel |
5 |
Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
|
Rosenstiehl, Pierre |
|
1984 |
5 |
3 |
p. 375-390 16 p. |
artikel |
6 |
On symmetric algorithms for bilinear forms over finite fields
|
Seroussi, G |
|
1984 |
5 |
3 |
p. 327-344 18 p. |
artikel |
7 |
On the solution of inequality systems relevant to IC-layout
|
Lengauer, T |
|
1984 |
5 |
3 |
p. 408-421 14 p. |
artikel |
8 |
Optimum split trees
|
Perl, Yehoshua |
|
1984 |
5 |
3 |
p. 367-374 8 p. |
artikel |
9 |
Papers to appear in forthcoming issues
|
|
|
1984 |
5 |
3 |
p. 448-449 2 p. |
artikel |
10 |
Short monotone formulae for the majority function
|
Valiant, L.G |
|
1984 |
5 |
3 |
p. 363-366 4 p. |
artikel |
11 |
The NP-completeness column: An ongoing guide
|
Johnson, David S |
|
1984 |
5 |
3 |
p. 433-447 15 p. |
artikel |