Stochastic Process Creation
From MaRDI portal
Publication:3182911
DOI10.1007/978-3-642-03816-7_3zbMath1250.68211OpenAlexW114397102MaRDI QIDQ3182911
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_3
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Scheduling multithreaded computations by work stealing
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Polya Urn Models
- Space-Efficient Scheduling of Stochastically Generated Tasks
- Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
- The total progeny in a branching process and a related random walk
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stochastic Process Creation
