Information Processing Letters logo Elsevier logo

Publisher: Elsevier

Related content
Volume 80, Number 6, 31 December 2001

< previous issue | all issues | next issue >

In-memory hash tables for accumulating text vocabularies
pp. 271-277(7)
Authors: Zobel J.; Heinz S.; Williams H.E.

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem
pp. 279-285(7)
Authors: Crochemore M.; Iliopoulos C.S.; Pinzon Y.J.; Reid J.F.

Security of Wang et al.'s group-oriented (t,n) threshold signature schemes with traceable signers
pp. 295-298(4)
Authors: Li Z.C.; Hui L.C.K.; Chow K.P.; Chong C.F.; Tsang W.W.; Chan H.W.

A decoding algorithm for triple-error-correcting binary BCH codes
pp. 299-303(5)
Authors: Lu E.-H.; Wu S.-W.; Cheng Y.-C.

A parallel algorithm for approximate regularity
pp. 311-316(6)
Authors: Boxer L.; Miller R.

< previous issue | all issues | next issue >

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

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page