A distribution-sensitive dictionary with low space overhead (Q414433): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6033172 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dictionary problem | |||
Property / zbMATH Keywords: dictionary problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
distribution sensitivity | |||
Property / zbMATH Keywords: distribution sensitivity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
working set property | |||
Property / zbMATH Keywords: working set property / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
space overhead | |||
Property / zbMATH Keywords: space overhead / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.11.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2004160229 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A unified access bound on comparison-based dynamic dictionaries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3579430 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Layered Working-Set Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A data structure for a sequence of string accesses in external memory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4471357 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms and Data Structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit dictionaries with <i>O</i>(1) modifications per update and fast search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Queaps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-adjusting binary search trees / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 04:06, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A distribution-sensitive dictionary with low space overhead |
scientific article |
Statements
A distribution-sensitive dictionary with low space overhead (English)
0 references
11 May 2012
0 references
dictionary problem
0 references
distribution sensitivity
0 references
working set property
0 references
space overhead
0 references
0 references