Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Mehlhorn, Kurt

dblp



BibTeX cite key*:

mehlhorn79bz

Title

Title*:

Dynamic Binary Search


Mehlhorn_a_1979_b.pdf (2353.84 KB)

Journal

Journal Title*:

SIAM Journal on Computing

Journal's URL:


Download URL
for the article:

http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SMJCAT000008000002000175000001&idtype=cvips&prog=normal

Language:

English

Publisher

Publisher's
Name:

SIAM

Publisher's URL:


Publisher's
Address:


ISSN:


Vol, No, pp, Date

Volume*:

8

Number:

2

Publishing Date:

1979

Pages*:

175-198

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

We consider search trees under time-varying access probabilities. Let $S = \{ B_1 , \cdots ,B_n \} $ and let $p_i^t $ be the number of accesses to object $B_i $ up to time $t$, $W^t = \sum {p_i^t } $. We introduce D-trees with the following properties.1) A search for $X = B_i $ at time $t$ takes time $O(\log W^t /p_i^t )$. This is nearly optimal.2) Update time after a search is at most proportional to search time, i.e. the overhead for administration is small.

URL for the Abstract:

http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=SMJCAT000008000002000175000001&idtype=cvips&gifs=yes

Categories,
Keywords:

searching, binary trees, time-varying access probabilities, TRIES

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{mehlhorn79bz,
AUTHOR = {Mehlhorn, Kurt},
TITLE = {Dynamic Binary Search},
JOURNAL = {SIAM Journal on Computing},
PUBLISHER = {SIAM},
YEAR = {1979},
NUMBER = {2},
VOLUME = {8},
PAGES = {175--198},
}


Entry last modified by Stephanie Müller, 11/25/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Christine Kiesel
Created
08/07/2006 05:58:19 AM
Revisions
5.
4.
3.
2.
1.
Editor(s)
Stephanie Müller
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
25.11.2014 10:40:58
04.01.2007 15:06:12
04.01.2007 14:46:42
04.01.2007 14:43:08
04.01.2007 12:28:18
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section
Mehlhorn_a_1979_b.pdf
View attachments here: