Technical, Research Report
@TechReport
Technischer-, Forschungsbericht


Show entries of:

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

Action:

login to update

Options:









Author, Editor

Author(s):

Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.

dblp
dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

??

Editor(s):





BibTeX Citekey*:

mehlhorn91d

Language:

English

Title, Institution

Title*:

Dynamic Perfect Hashing: Upper and Lower Bounds

Institution*:

Princeton University

Publishers or Institutions Address*:

Princeton, NJ, USA

Type:


No, Year, pp.,

Number*:

TR-310-91

Pages*:

34

Month:


VG Wort
Pages*:


Year*:

1991

ISBN/ISSN:






DOI:




Note, Abstract, ©

Note:

This technical report has been published as
Dynamic Perfect Hashing: Upper and Lower Bounds. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert and Robert E. Tarjan,
  • Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (1988), 524-531 and
  • SIAM J. Comput. 23 (1994) 738-761.

(LaTeX) Abstract:

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes O(1) worst-case time for lookups and O(1) amortized expected time for insertions and deletions; it uses space proportional to the size of the set stored. Furthermore, lower bounds for the time complexity of a class of deterministic algorithms for the dictionary problem are proved. This class encompasses realistic hashing-based schemes that use linear space. Such algorithms have amortized worst-case time complexity OMEGA(log n) for a sequence of n insertions and lookups; if the worst-case lookup time is restricted to k then the lower bound becomes $OMEGA (k^cdot^n sup 1/k$).

Categories / Keywords:


Copyright Message:


HyperLinks / References / URLs:


Personal Comments:


File Upload:


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:
@TECHREPORT{mehlhorn91d,
AUTHOR = {Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer Auf Der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.},
TITLE = {Dynamic Perfect Hashing: Upper and Lower Bounds},
YEAR = {1991},
INSTITUTION = {Princeton University},
NUMBER = {TR-310-91},
PAGES = {34},
ADDRESS = {Princeton, NJ, USA},
NOTE = {This technical report has been published as
Dynamic Perfect Hashing: Upper and Lower Bounds. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert and Robert E. Tarjan,
Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (1988), 524-531 and
SIAM J. Comput. 23 (1994) 738-761.},
}


Entry last modified by Christine Kiesel, 09/18/2006
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
09/18/2006 10:56:51 AM
Revision
0.



Editor
Christine Kiesel



Edit Date
18.09.2006 11:12:00



Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section