Probabilistic analysis of some distributed algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 125893
- Distributed randomized algorithms for probabilistic performance analysis
- Validation of Stochastic Systems
- Stochastic analysis of average-based distributed algorithms
- A lower bound for probabilistic distributed algorithms
- Large deviations analysis for distributed algorithms in an ergodic Markovian environment
- scientific article; zbMATH DE number 4137536
- scientific article; zbMATH DE number 4049028
- scientific article; zbMATH DE number 4047070
- scientific article; zbMATH DE number 1246226
Cites work
- scientific article; zbMATH DE number 43081 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- An accurate algorithm for computing the eigenvalues of a polygonal membrane
- Brownian motion and algorithm complexity
- Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes
- Perturbation bounds for the stationary probabilities of a finite Markov chain
- Random walks, Gaussian processes and list structures
- Recurrence times and capacities for finite ergodic chains
- Representation Theory for Denumerable Markov Chains
Cited in
(24)- Stochastic analysis of average-based distributed algorithms
- scientific article; zbMATH DE number 3972180 (Why is no real title available?)
- scientific article; zbMATH DE number 125893 (Why is no real title available?)
- scientific article; zbMATH DE number 929635 (Why is no real title available?)
- Probabilistic analysis of a network resource allocation algorithm
- 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
- Distributed algorithms with dynamical random transitions
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
- Hitting time of a corner for a reflected diffusion in the square
- scientific article; zbMATH DE number 3911705 (Why is no real title available?)
- Random walks, heat equation and distributed algorithms
- Probabilistic analysis of some (un)directed animals
- scientific article; zbMATH DE number 4085056 (Why is no real title available?)
- Asymptotic properties of some underdiagonal walks generation algorithms
- Approximation of excessive backlog probabilities of two tandem queues
- scientific article; zbMATH DE number 3943024 (Why is no real title available?)
- Analysis of distributed systems via quasi-stationary distributions
- The shape of stretched planar trees
- Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata
- The exhaustion of shared memory: Stochastic results
- Some distributed algorithms revisited
- Distributed algorithms in an ergodic Markovian environment
This page was built for publication: Probabilistic analysis of some distributed algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358236)