| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A note on lower bounds for rectilinear Steiner trees
|
Salowe, J.S.
|
|
1992
|
42 |
3 |
p. 151-152
2 p.
|
article
|
| 2 |
A short proof of the decidability of bisimulation for normed bpa-processes
|
Groote, Jan Friso
|
|
1992
|
42 |
3 |
p. 167-171
5 p.
|
article
|
| 3 |
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
|
Sarkar, U.K.
|
|
1992
|
42 |
3 |
p. 173-177
5 p.
|
article
|
| 4 |
Average case complexity under the universal distribution equals worst-case complexity
|
Li, Ming
|
|
1992
|
42 |
3 |
p. 145-149
5 p.
|
article
|
| 5 |
Complexity of the closest vector problem in a lattice generated by (0,1)-matrix
|
Szymanski, Boleslaw K.
|
|
1992
|
42 |
3 |
p. 121-126
6 p.
|
article
|
| 6 |
Finding good approximate vertex and edge partitions is NP-hard
|
Bui, Thang Nguyen
|
|
1992
|
42 |
3 |
p. 153-159
7 p.
|
article
|
| 7 |
Finitary logics for some CCS observational bisimulations
|
Mowbray, Miranda
|
|
1992
|
42 |
3 |
p. 161-165
5 p.
|
article
|
| 8 |
On the editing distance between unordered labeled trees
|
Zhang, Kaizhong
|
|
1992
|
42 |
3 |
p. 133-139
7 p.
|
article
|
| 9 |
Optimal value for the Newton-Raphson division algorithm
|
Parker, A.
|
|
1992
|
42 |
3 |
p. 141-144
4 p.
|
article
|
| 10 |
Which finite monoids are syntactic monoids of rational ω-languages
|
Huy, Phan Trung
|
|
1992
|
42 |
3 |
p. 127-132
6 p.
|
article
|
Journal description