If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Publisher: Elsevier

Related content
Volume 60, Number 3, 11 November 1996

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Transitive term graph rewriting
pp. 109-114(6)
Author: Banach, R.

Favourites:Add to Favourites

Efficient multiway radix search trees
pp. 115-120(6)
Authors: Erlingsson, U.; Krishnamoorthy, M.; Raman, T.V.

Favourites:Add to Favourites

Range searching in low-density environments
pp. 121-127(7)
Authors: Schwarzkopf, O.; Vleugels, J.

Favourites:Add to Favourites
Favourites:Add to Favourites

Dividing strategies for the optimization of a test suite
pp. 135-141(7)
Authors: Tsong, Y.C.; Man, F.L.

Favourites:Add to Favourites

The subprogram problem for software metric design
pp. 143-149(7)
Author: Prather, R.E.

Favourites:Add to Favourites

An efficient algorithm for concurrent priority queue heaps
pp. 151-157(7)
Authors: Hunt, G.C.; Michael, M.M.; Parthasarathy, S.; Scott, M.L.

Favourites:Add to Favourites

Finding biconnected components in O(n) time for a class of graphs
pp. 159-163(5)
Authors: Liang, Y.D.; Rhee, C.

Share Content

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