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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Partial Fillup and Search Time in LC Tries
@@ description / en / description / en @@
+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 @@
+.68127
@@ Property / zbMATH Open document ID: 1423.68127 / rank @@
+Normal rank
@@ Property / DOI @@
+.1137/1.9781611972962.6
@@ Property / DOI: 10.1137/1.9781611972962.6 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
+Normal rank
@@ Property / publication date @@
+September 2019Timestamp +2019-09-16T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-09-16T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 16 September 2019 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7105368
@@ Property / zbMATH DE Number: 7105368 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2283807851
@@ Property / OpenAlex ID: W2283807851 / rank @@
+Normal rank