nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors
|
Ali, H.H. |
|
1995 |
51 |
2 |
p. 301-306 6 p. |
artikel |
2 |
A Tight Upper Bound on the Benefits of Replica Control Protocols
|
Johnson, D.B. |
|
1995 |
51 |
2 |
p. 168-176 9 p. |
artikel |
3 |
Clique Partitions, Graph Compression and Speeding-Up Algorithms
|
Feder, T. |
|
1995 |
51 |
2 |
p. 261-272 12 p. |
artikel |
4 |
Editor′s Foreword
|
Mendelzon, A.O. |
|
1995 |
51 |
2 |
p. 135- 1 p. |
artikel |
5 |
Extrema Predicates in Deductive Databases
|
Ganguly, S. |
|
1995 |
51 |
2 |
p. 244-259 16 p. |
artikel |
6 |
Language Learning with Some Negative Information
|
Baliga, G. |
|
1995 |
51 |
2 |
p. 273-285 13 p. |
artikel |
7 |
Non-deterministic Queue Operations
|
Garciamolina, H. |
|
1995 |
51 |
2 |
p. 211-222 12 p. |
artikel |
8 |
On Datalog vs Polynomial Time
|
Afrati, F. |
|
1995 |
51 |
2 |
p. 177-196 20 p. |
artikel |
9 |
On the Expected Size of Recursive Datalog Queries
|
Seshadri, S. |
|
1995 |
51 |
2 |
p. 137-148 12 p. |
artikel |
10 |
Separating the Communication Complexities of MOD m and MOD p Circuits
|
Grolmusz, V. |
|
1995 |
51 |
2 |
p. 307-313 7 p. |
artikel |
11 |
Shortest Paths in Reachability Graphs
|
Desel, J. |
|
1995 |
51 |
2 |
p. 314-323 10 p. |
artikel |
12 |
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications
|
Blanchetsadri, F. |
|
1995 |
51 |
2 |
p. 324-337 14 p. |
artikel |
13 |
Spatial Query Optimization: From Boolean Constraints to Range Queries
|
Helm, R. |
|
1995 |
51 |
2 |
p. 197-210 14 p. |
artikel |
14 |
Subtyping in OODBs
|
Beeri, C. |
|
1995 |
51 |
2 |
p. 223-243 21 p. |
artikel |
15 |
The Expected Advantage of Asynchrony
|
Cole, R. |
|
1995 |
51 |
2 |
p. 286-300 15 p. |
artikel |
16 |
Tractable Query Languages for Complex Object Databases
|
Grumbach, S. |
|
1995 |
51 |
2 |
p. 149-167 19 p. |
artikel |