Upper and lower bounds for the average-case complexity of path-search

Nicholas Pippenger. Upper and lower bounds for the average-case complexity of path-search. Networks, 33(4):249-259, 1999. [doi]

Authors

Nicholas Pippenger

This author has not been identified. Look up 'Nicholas Pippenger' in Google