Publisher: Elsevier

Related content
Volume 73, Number 1, 31 January 2000

< previous issue | all issues | next issue >

Favourites:Add to Favourites

On inferring linear single-tree languages
pp. 1-3(3)
Author: Makinen, E.

Favourites:Add to Favourites

On the Day-Tripathi orientation of the star graphs: Connectivity
pp. 5-10(6)
Authors: Cheng, E.; Lipman, M.J.

Favourites:Add to Favourites

PACS, simple-PAC and query learning
pp. 11-16(6)
Authors: Castro, J.; Guijarro, D.

Favourites:Add to Favourites

Performance guarantees for the TSP with a parameterized triangle inequality
pp. 17-21(5)
Authors: Bender, M.A.; Chekuri, C.

Favourites:Add to Favourites

An ergodic theorem for read-once non-uniform deterministic finite automata
pp. 23-28(6)
Authors: Goldmann, M.; Russell, A.; Therien, D.

Favourites:Add to Favourites

Low discrepancy sets yield approximate min-wise independent permutation families
pp. 29-32(4)
Authors: Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D.

Favourites:Add to Favourites

Placing two disks in a convex polygon
pp. 33-39(7)
Authors: Kim, S.K.; Shin C.-S.; Yang, T.

Favourites:Add to Favourites

Error-detecting codes and fault-containing self-stabilization
pp. 41-46(6)
Authors: Herman, T.; Pemmaraju, S.

Favourites:Add to Favourites

On-line scheduling with setup costs
pp. 61-68(8)
Authors: Gambosi, G.; Nicosia, G.

Favourites:Add to Favourites

Finding OR in a noisy broadcast network
pp. 69-75(7)
Authors: Feige, U.; Kilian, J.

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