Data structures with dynamical random transitions
From MaRDI portal
Recommendations
- On the dynamization of data structures
- scientific article; zbMATH DE number 1418448
- scientific article; zbMATH DE number 6797624
- An optimal data structure to handle dynamic environments in non-deterministic computations
- Stochastic rearrangement rules for self-organizing data structures
- scientific article; zbMATH DE number 17540
- Distributed algorithms with dynamical random transitions
- The design of dynamic data structures
- Pseudorandom Graphs in Data Structures
Cites work
- Distributed algorithms with dynamical random transitions
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Quenched, annealed and functional large deviations for one-dimensional random walk in random environment
Cited in
(8)- Excessive backlog probabilities of two parallel queues
- A weighted random walk model, with application to a genetic algorithm
- scientific article; zbMATH DE number 3947370 (Why is no real title available?)
- scientific article; zbMATH DE number 17540 (Why is no real title available?)
- The Maximum Size of Dynamic Data Structures
- Data Structures' Maxima
- scientific article; zbMATH DE number 1962821 (Why is no real title available?)
- Approximation of excessive backlog probabilities of two tandem queues
This page was built for publication: Data structures with dynamical random transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486321)