Online Algorithms for Finger Searching (Classic Reprint) - Couverture souple

Cole, Richard

Couverture souple

ISBN 10 : 1333377568 ISBN 13 : 9781333377564

Editeur : Forgotten Books, 2018

Synopsis

Finger searching on a line: Model, fork moves, and competitive analysis for online algorithms with limited fingers reveals how a small set of moving pointers, or fingers, can solve sequence of requests on a line more efficiently than an offline oracle in many cases.

This work shows practical strategies and theoretical bounds for online algorithms that share a line with a limited number of fingers. This nonfiction study frames the problem, outlines key models, and presents results that quantify how well online strategies perform when they can fork to positions held by other fingers. It situates finger movement, fork operations, and competitive analysis as a unified approach to understanding dynamic server problems on a line.

• How online algorithms with a fixed number of fingers perform against optimal offline solutions.
• When forking helps versus when it doesn’t, and how this affects competitive bounds.
• Concrete results for different finger counts, including a constant-competitive algorithm for three fingers.
• Connections to established server problems and to broader questions in online algorithm analysis.

Ideal for readers of algorithms, competitive analysis, and data structure research who want a rigorous treatment of finger-based online strategies.

Détails de l'édition

• Éditeur: Forgotten Books
• Date d'édition: 2018
• Langue: anglais
• ISBN 10: 1333377568
• ISBN 13: 9781333377564
• Reliure: Broché
• Nombre de pages: 37
• Coordonnées du fabricant: Copytech (UK) Ltd, Trading as Printondemand-worldwide.com; gpsr@podww.com; ; 9 Culley Court; Orton Southgate; Peterborough; Cambridgeshire; PE2 6WA; Royaume-Uni
• Personne responsable: Easy Access System Europe Oü, 16879218; +358405003575; gpsr.requests@easproject.com; ; Mustamäe tee 50; Tallinn; 10621; Estonie