nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An asymptotic comment on a paper by Analyti and Pramanik
|
Prodinger, Helmut |
|
1994 |
49 |
6 |
p. 327-328 2 p. |
artikel |
2 |
An O(log N) algorithm to solve linear recurrences on hypercubes
|
Reddy, H.N. |
|
1994 |
49 |
6 |
p. 319-325 7 p. |
artikel |
3 |
Author Index Volume 49 (1994)
|
|
|
1994 |
49 |
6 |
p. 329-330 2 p. |
artikel |
4 |
Computing a median point of a simple rectilinear polygon
|
Chepoi, Victor |
|
1994 |
49 |
6 |
p. 281-285 5 p. |
artikel |
5 |
Conservativity of nested relational calculi with internal generic functions
|
Libkin, Leonid |
|
1994 |
49 |
6 |
p. 273-280 8 p. |
artikel |
6 |
Extending the quadrangle inequality to speed-up dynamic programming
|
Borchers, Al |
|
1994 |
49 |
6 |
p. 287-290 4 p. |
artikel |
7 |
Maximal matching stabilizes in quadratic time
|
Tel, Gerard |
|
1994 |
49 |
6 |
p. 271-272 2 p. |
artikel |
8 |
Maximum bounded H-matching is MAX SNP-complete
|
Kann, Viggo |
|
1994 |
49 |
6 |
p. 309-318 10 p. |
artikel |
9 |
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
|
Sajith, G. |
|
1994 |
49 |
6 |
p. 303-308 6 p. |
artikel |
10 |
Self-stabilizing depth-first search
|
Collin, Zeev |
|
1994 |
49 |
6 |
p. 297-301 5 p. |
artikel |
11 |
Upper and lower bounds for stochastic marked graphs
|
Rajsbaum, Sergio |
|
1994 |
49 |
6 |
p. 291-295 5 p. |
artikel |