File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Randomized competitive algorithms for successful and unsuccessful search

TitleRandomized competitive algorithms for successful and unsuccessful search
Authors
Issue Date1996
PublisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/
Citation
Computer Journal, 1996, v. 39 n. 5, p. 427-438 How to Cite?
AbstractThis 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.
Persistent Identifierhttp://hdl.handle.net/10722/152259
ISSN
2015 Impact Factor: 1.0
2015 SCImago Journal Rankings: 0.371
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHui, LCKen_US
dc.contributor.authorMartel, CUen_US
dc.date.accessioned2012-06-26T06:36:48Z-
dc.date.available2012-06-26T06:36:48Z-
dc.date.issued1996en_US
dc.identifier.citationComputer Journal, 1996, v. 39 n. 5, p. 427-438en_US
dc.identifier.issn0010-4620en_US
dc.identifier.urihttp://hdl.handle.net/10722/152259-
dc.description.abstractThis 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.en_US
dc.languageengen_US
dc.publisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/en_US
dc.relation.ispartofComputer Journalen_US
dc.titleRandomized competitive algorithms for successful and unsuccessful searchen_US
dc.typeArticleen_US
dc.identifier.emailHui, Lucas Chi Kwong:hui@cs.hku.hken_US
dc.identifier.authorityHui, Lucas Chi Kwong=rp00120en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1093/comjnl/39.5.427-
dc.identifier.scopuseid_2-s2.0-0030396297en_US
dc.identifier.volume39en_US
dc.identifier.issue5en_US
dc.identifier.spage427en_US
dc.identifier.epage438en_US
dc.identifier.isiWOS:A1996VW45000007-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridHui, Lucas Chi Kwong=8905728300en_US
dc.identifier.scopusauthoridMartel, Charles U=35589077100en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats