Trie size in a dynamic list structure (Q5044775)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7611299

Language	Label	Description	Also known as
English	Trie size in a dynamic list structure	scientific article; zbMATH DE number 7611299

Statements

scholarly article

0 references

Trie size in a dynamic list structure (English)

0 references

Lecture Notes in Computer Science

0 references

publication date

2 November 2022

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-56610-4_100

0 references

On the joint distribution of the maximum and its location for a linear diffusion

0 references

The maximum of a random walk whose mean path has a maximum

0 references

The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres

0 references

The first-passage density of a continuous gaussian process to a general boundary

0 references

The analysis of simple list structures

0 references

Sequence of operations analysis for dynamic data structures

0 references

0 references

0 references

Random walks, Gaussian processes and list structures

0 references

Brownian motion and algorithm complexity

0 references

Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis

0 references

Paths in a random digital tree: limiting distributions

0 references

New results on the size of tries

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-56610-4_100

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5044775

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5044775&oldid=37451543"