nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
|
Lipski Jr., Witold |
|
1981 |
2 |
3 |
p. 211-226 16 p. |
artikel |
2 |
A unified approach to the analysis of bilinear algorithms
|
Pan, V |
|
1981 |
2 |
3 |
p. 301-310 10 p. |
artikel |
3 |
Dynamization of order decomposable set problems
|
Overmars, Mark H |
|
1981 |
2 |
3 |
p. 245-260 16 p. |
artikel |
4 |
Generating coset representatives for permutation groups
|
Allison, Lloyd |
|
1981 |
2 |
3 |
p. 227-244 18 p. |
artikel |
5 |
On systems of bilinear forms whose minimal division-free algorithms are all bilinear
|
Feig, Ephraim |
|
1981 |
2 |
3 |
p. 261-281 21 p. |
artikel |
6 |
Problems
|
Guibas, Leo J |
|
1981 |
2 |
3 |
p. 314-315 2 p. |
artikel |
7 |
The measure problem for rectangular ranges in d-space
|
van Leeuwen, Jan |
|
1981 |
2 |
3 |
p. 282-300 19 p. |
artikel |
8 |
The minimum-length generator sequence problem is NP-hard
|
Even, S |
|
1981 |
2 |
3 |
p. 311-313 3 p. |
artikel |