laarctags | new | comments | ask | show | place | submitlogin
Parallel Algorithms for Depth-First Search (1991) (upenn.edu)
3 points by nickpsecurity to programming compsci on Jan 8, 2019 | 1 comment





Paper introduces several forms of parallel computation, randomizing algorithms, matching algorithms, does mathematical models of some of this, and describes the actual algorithms as step-by-step English and pseudocode (no math required). Tagged it CompSci, not formal methods, for that reason.

reply




Welcome | Guidelines | Bookmarklet | Feature Requests | Source | API | Contact | Twitter | Lists

RSS (stories) | RSS (comments)

Search: