| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A note on finding minimum cuts in directed planar networks by parallel computations
|
Janiga, Ladislav
|
|
1985
|
21 |
2 |
p. 75-78
4 p.
|
article
|
| 2 |
Exposure to deadlock for communicating processes is hard to detect
|
Räuchle, Thomas
|
|
1985
|
21 |
2 |
p. 63-68
6 p.
|
article
|
| 3 |
Fair mutual exclusion with unfair P and V operations
|
Martin, Alain J.
|
|
1985
|
21 |
2 |
p. 97-100
4 p.
|
article
|
| 4 |
Fast parallel polynomial division via reduction to triangular toeplitz matrix inversion and to polynomial inversion modulo a power
|
Bini, Dario
|
|
1985
|
21 |
2 |
p. 79-81
3 p.
|
article
|
| 5 |
Feedback automata and their languages
|
Wätjen, Dietmar
|
|
1985
|
21 |
2 |
p. 83-86
4 p.
|
article
|
| 6 |
Linear lower bounds on unbounded fan-in boolean circuits
|
Hromkovič, Juraj
|
|
1985
|
21 |
2 |
p. 71-74
4 p.
|
article
|
| 7 |
Lower time bounds for integer programming with two variables
|
Lautemann, Clemens
|
|
1985
|
21 |
2 |
p. 101-105
5 p.
|
article
|
| 8 |
On fast computation of distance between line segments
|
Lumelsky, Vladimir J.
|
|
1985
|
21 |
2 |
p. 55-61
7 p.
|
article
|
| 9 |
On the decomposition of sequences into ascending subsequences
|
Kaldewaij, Anne
|
|
1985
|
21 |
2 |
p. 69-
1 p.
|
article
|
| 10 |
Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit
|
Vitányi, Paul M.B.
|
|
1985
|
21 |
2 |
p. 87-91
5 p.
|
article
|
| 11 |
The incompleteness of Misra and Chandy's proof systems
|
Nguyen, Van
|
|
1985
|
21 |
2 |
p. 93-96
4 p.
|
article
|
| 12 |
The probe: An addition to communication primitives
|
|
|
1985
|
21 |
2 |
p. 107-
1 p.
|
article
|
Journal description