| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A new approach for the domination problem on permutation graphs
|
Liang, Y.
|
|
1991
|
37 |
4 |
p. 219-224
6 p.
|
article
|
| 2 |
An extension of Khrapchenko's theorem
|
Zwick, Uri
|
|
1991
|
37 |
4 |
p. 215-217
3 p.
|
article
|
| 3 |
Approximating linear programming is log-space complete for P
|
Serna, Maria
|
|
1991
|
37 |
4 |
p. 233-236
4 p.
|
article
|
| 4 |
A unified algorithm for sorting on multidimensional mesh-connected processors
|
Corbett, Peter F.
|
|
1991
|
37 |
4 |
p. 225-231
7 p.
|
article
|
| 5 |
Computing a maximum cardinality matching in a bipartite graph in time O(n 1.5 m log n )
|
Alt, H.
|
|
1991
|
37 |
4 |
p. 237-240
4 p.
|
article
|
| 6 |
Introduction to design choices in the semantics of Statecharts
|
Huizing, C.
|
|
1991
|
37 |
4 |
p. 205-213
9 p.
|
article
|
| 7 |
On approximating the minimum independent dominating set
|
Irving, Robert W.
|
|
1991
|
37 |
4 |
p. 197-200
4 p.
|
article
|
| 8 |
Parallel multiple search
|
Wen, Zhaofang
|
|
1991
|
37 |
4 |
p. 181-186
6 p.
|
article
|
| 9 |
Probabilistic checking of associativity in algebras
|
Jacobs, D.P.
|
|
1991
|
37 |
4 |
p. 187-191
5 p.
|
article
|
| 10 |
Server problems and resistive spaces
|
Deng, Xiaotie
|
|
1991
|
37 |
4 |
p. 193-196
4 p.
|
article
|
| 11 |
The intersection searching problem for c-oriented polygons
|
Tan, Xue-Hou
|
|
1991
|
37 |
4 |
p. 201-204
4 p.
|
article
|
Journal description