Skip to main content

Publisher: Elsevier

Volume 74, Number 1, April 2000

On bounded occurrence constraint satisfaction
pp. 1-6(6)
Author: Hastad, J.

Favourites:
ADD
Favourites:
ADD

Approximating low-congestion routing and column-restricted packing problems
pp. 19-25(7)
Authors: Baveja, A.; Srinivasan, A.

Favourites:
ADD

On rewrite constraints and context unification
pp. 35-40(6)
Authors: Niehren, J.; Tison, S.; Treinen, R.

Favourites:
ADD

Variations on computing reciprocals of power series
pp. 41-46(6)
Author: Schonhage, A.

Favourites:
ADD

Farmer's Theorem revisited
pp. 47-53(7)
Author: Veanes, M.

Favourites:
ADD

A rely-guarantee discipline for open distributed systems design
pp. 55-63(9)
Authors: Duarte, C.H.C.; Maibaum, T.

Favourites:
ADD

On a generalized modularization theorem
pp. 65-71(7)
Authors: Dimitrakos, T.; Maibaum, T.

Favourites:
ADD

Trackless online algorithms for the server problem
pp. 73-79(7)
Authors: Bein, W.W.; Larmore, L.L.

Favourites:
ADD

An algorithm for finding a k-median in a directed tree
pp. 81-88(8)
Authors: Vigneron, A.; Gao, L.; Golin, M.J.; Italiano, G.F.; Li, B.

Favourites:
ADD
Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more