The complexity of parallel search
- 作者Richard M. Karp; Eli Upfal; Avi Wigderson
- 卷第36卷
- 期第2期
- 印刷ISSN0022-0000
- 电子ISSN1090-2724
- 文件大小1838.67KB
- 发表时间1988
- DOI10.1016/0022-0000(88)90027-x
- 页码225-253
[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - ForewordFischer, Michael J.; Fischer, Michael J.; Fischer, Michael J.; Fischer, Michael J.; Ginsburg, Seymour; Ginsburg, Seymour; Ginsburg, Seymour; Ginsburg, Seymour; Kirkpatrick, David G.; Kirkpatrick, David G.; Kirkpatrick, David G.; Kirkpatrick, David G.; Ladner, Richard E.; Ladner, Richard E.; Ladner, Richard E.; Ladner, Richard E.; Miller, Gary L.; Miller, Gary L.; Miller, Gary L.; Miller, Gary L.; Pippenger, Nicholas; Pippenger, Nicholas; Pippenger, Nicholas; Pippenger, Nicholas; Scott, Dana; Scott, Dana; Scott, Dana; Scott, Dana; Valiant, Leslie G.; Valiant, Leslie G.; Valiant, Leslie G.; Valiant, Leslie G.; Yannakakis, Mihalis; Yannakakis, Mihalis; Yannakakis, Mihalis; Yannakakis, Mihalis; Yao, F. Frances; Yao, F. Frances; Yao, F. Frances; Yao, F. Frances · 1982
Random interval graphsNicholas Pippenger · 1998
Self -Routing SuperconcentratorsNicholas Pippenger · 1996
Editor's forewordLawrence Snyder; E.K. Blum; Nicholas Pippenger · 1980
Pebbling with an auxiliary pushdownNicholas Pippenger · 1981
Computational Complexity of Algebraic FunctionsNicholas Pippenger · 1981
Superconcentrators of depth 2Nicholas Pippenger · 1982
The inducibility of graphsNicholas Pippenger; Martin Charles Golumbic · 1975