scientific article; zbMATH DE number 1302200
Chernoff boundscombinatorial optimizationcomplexity classesdepth first searchmatching problemsmaximal independent set problemsminimum cost spanning treesnetwork flow problemspacket routingparallel randomized algorithmsshortest paths problemssortingsurvey
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
- An introduction to parallelism in combinatorial optimization
- Optimal parallel randomized algorithms for sparse addition and identification
- Tight Analysis of Parallel Randomized Greedy MIS
- Probabilistic Parallel Algorithms for Sorting and Selection
- scientific article; zbMATH DE number 4047072 (Why is no real title available?)
- scientific article; zbMATH DE number 1304350 (Why is no real title available?)
- The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
- scientific article; zbMATH DE number 1163099 (Why is no real title available?)
- scientific article; zbMATH DE number 934538 (Why is no real title available?)
- scientific article; zbMATH DE number 1419214 (Why is no real title available?)
- Parallel Combinatorial Optimization with Decision Diagrams
- An optimal parallel algorithm for generating combinations
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 Q4247467)
