Partial fillup and search time in LC tries (Q4962683): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q5233149
 
(5 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Partial Fillup and Search Time in LC Tries
description / endescription / en
scientific article; zbMATH DE number 6972842
scientific article; zbMATH DE number 7105368
Property / title
 
Partial Fillup and Search Time in LC Tries (English)
Property / title: Partial Fillup and Search Time in LC Tries (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1423.68127 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/1.9781611972962.6 / rank
 
Normal rank
Property / published in
 
Property / published in: 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) / rank
 
Normal rank
Property / publication date
 
16 September 2019
Timestamp+2019-09-16T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 16 September 2019 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7105368 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101596348 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2283807851 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0510017 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 6 May 2024

scientific article; zbMATH DE number 7105368
  • Partial Fillup and Search Time in LC Tries
Language Label Description Also known as
English
Partial fillup and search time in LC tries
scientific article; zbMATH DE number 7105368
  • Partial Fillup and Search Time in LC Tries

Statements

Partial fillup and search time in LC tries (English)
0 references
Partial Fillup and Search Time in LC Tries (English)
0 references
0 references
0 references
0 references
0 references
5 November 2018
0 references
16 September 2019
0 references
0 references
0 references
digital trees
0 references
Poissonization
0 references
level-compressed tries
0 references
partial fillup
0 references
probabilistic analysis
0 references
strings
0 references
trees
0 references
0 references
0 references
0 references