Publisher: Elsevier

Related content
Volume 71, Number 3, 27 August 1999

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Fast practical multi-pattern matching
pp. 107-113(7)
Authors: Crochemore, M.; Czumaj, A.; Gasieniec, L.; Lecroq, T.; Plandowski, W.; Rytter, W.

Favourites:Add to Favourites

How to prevent interaction of functional and inclusion dependencies
pp. 115-125(11)
Authors: Levene, M.; Loizou, G.

Favourites:Add to Favourites

Tree precedence in scheduling: The strong-weak distinction
pp. 127-134(8)
Authors: Dror, M.; Kubiak, W.; Leung, J.Y.

Favourites:Add to Favourites

A matched approximation bound for the sum of a greedy coloring
pp. 135-140(6)
Authors: Bar-Noy, A.; Halldorsson, M.M.; Kortsarz, G.

Favourites:Add to Favourites

An interesting way to partition a number
pp. 141-148(8)
Author: Bhatt, P.C.P.

Favourites:Add to Favourites

Hamming weights of correlation immune Boolean functions
pp. 149-153(5)
Authors: Maitra, S.; Sarkar, P.

Favourites:Add to Favourites

A simple bivalency proof that t-resilient consensus requires t+1 rounds
pp. 155-158(4)
Authors: Aguilera, M.K.; Toueg, S.

Favourites:Add to Favourites

The complexity of some complementation problems
pp. 159-165(7)
Authors: Plaisted, D.A.; Kucherov, G.

Favourites:Add to Favourites

The cost of graceful degradation for omission failures
pp. 167-172(6)
Authors: Jayanti, P.; Chandra, T.D.; Toueg, S.

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