Please use this identifier to cite or link to this item:
Title: Randomized competitive algorithms for successful and unsuccessful search
Authors: Hui, Lucas Chi Kwong 
Martel, Charles U.
Issue Date: 1996
Citation: Hui, Lucas Chi Kwong,Martel, Charles U. (1996). Randomized competitive algorithms for successful and unsuccessful search. Computer Journal 39 (5) : 427-438. ScholarBank@NUS Repository.
Abstract: This paper studies the classical dictionary problem using a self-adjusting linear list. We designed and analyzed randomized, on-line algorithms for a sequence of successful and unsuccessful searches which are competitive with off-line algorithms. Our algorithms combined the ps bit technique which speeds up unsuccessful search with the randomized move-to-front scheme of Reingold et al., which they used to speed up successful search.
Source Title: Computer Journal
ISSN: 00104620
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Feb 22, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.