scientific article; zbMATH DE number 3972180
From MaRDI portal
Publication:3738554
Recommendations
Cited in
(18)- Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes
- scientific article; zbMATH DE number 125893 (Why is no real title available?)
- Performance analysis of stack space allocation based upon random walk model
- Approximation of the exit probability of a stable Markov modulated constrained random walk
- Large deviations analysis for distributed algorithms in an ergodic Markovian environment
- Excessive backlog probabilities of two parallel queues
- Optimal computer memory allocation for the Poisson flows
- Permutations with forbidden subsequences and nonseparable planar maps
- Basic analytic combinatorics of directed lattice paths
- Random walks, heat equation and distributed algorithms
- About optimal management of work-stealing deques in two-level memory
- Approximation of excessive backlog probabilities of two tandem queues
- About optimal management of FIFO-queues in two-level memory
- The linked list representation of \(n\) LIFO-stacks and/or FIFO-queues in the single-level memory
- Analysis of distributed systems via quasi-stationary distributions
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- The exhaustion of shared memory: Stochastic results
- Distributed algorithms in an ergodic Markovian environment
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738554)