Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains (Q3415892): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Improving time and space efficiency in generalized binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of a fringe heuristic for binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching processes in the analysis of the heights of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random 2-3 trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of fringe analysis and its application to 23 trees and b-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s026996480000084x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009339318 / rank
 
Normal rank

Latest revision as of 09:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
scientific article

    Statements

    Identifiers