An Approximation Algorithm for Binary Searching in Trees

Authors:
Eduardo Laber;Marco Molinaro
Affiliations:
Informatics Department of PUC-Rio, , Brazil;Informatics Department of PUC-Rio, , Brazil
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 3

On the complexity of searching in trees: average-case minimization

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Searching in dynamic tree-like partial orders

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the complexity of searching in trees and partially ordered structures

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face ...