scientific article; zbMATH DE number 4047072
From MaRDI portal
Publication:3783528
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)
Cited in
(18)- An efficient parallel algorithm for random sampling
- A randomized parallel branch-and-bound algorithm
- From randomizing polynomials to parallel algorithms
- scientific article; zbMATH DE number 3978375 (Why is no real title available?)
- A randomized parallel backtracking algorithm
- scientific article; zbMATH DE number 176073 (Why is no real title available?)
- scientific article; zbMATH DE number 1302200 (Why is no real title available?)
- scientific article; zbMATH DE number 1304350 (Why is no real title available?)
- scientific article; zbMATH DE number 1857643 (Why is no real title available?)
- scientific article; zbMATH DE number 1857646 (Why is no real title available?)
- Time-Randomness Trade-offs in Parallel Computation
- scientific article; zbMATH DE number 1419211 (Why is no real title available?)
- scientific article; zbMATH DE number 1419212 (Why is no real title available?)
- scientific article; zbMATH DE number 1419213 (Why is no real title available?)
- scientific article; zbMATH DE number 1419214 (Why is no real title available?)
- Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
- Parallelism in random access machines
- Randomized parallel algorithms
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 Q3783528)
