On searching strategies, parallel questions, and delayed answers

Authors:
Ferdinando Cicalese;Luisa Gargano;Ugo Vaccaro
Affiliations:
Dipartimento di Informatica ed Applicazioni "R. M. Capocelli", Università di Salerno, 84081 Baronissi (SA), Italy;Dipartimento di Informatica ed Applicazioni "R. M. Capocelli", Università di Salerno, 84081 Baronissi (SA), Italy;Dipartimento di Informatica ed Applicazioni "R. M. Capocelli", Università di Salerno, 84081 Baronissi (SA), Italy
Venue:
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Year:
2004

Combinatorial search

Combinatorial search
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Designing broadcasting algorithms in the Postal Model for message-passing systems

Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Optimal point-to-point broadcast algorithms via lopsided trees

Discrete Applied Mathematics
Searching games with errors---fifty years of coping with liars

Theoretical Computer Science
Delayed Information and Action in On-line Algorithms

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

The multi-interval ulam-rényi game

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms

Hi-index	0.00

In this paper we study the effect that delayed answers can have on binary search procedures.