 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen 
|
Hilfe 
|
 |
|
| Suche: Citkey="Karp-Upfal-Wigderson/88" |
|
The complexity of parallel search
R.M. Karp, E. Upfal, A. Wigderson
Journal of Computer and System Sciences 36 (2), 1988, April, pp. 225-253
| Publisher: | Academic Press | |
| Address: | New York-San Francisco-London-San Diego | |
| Institution: | Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA | |
| Keywords: | parallel search algorithms, deterministic complexity, independence systems, self-reducibility process, maximal independent set, oracle queries, rank oracle, graphic matroids, partition matroids, randomized complexity, processor-time trade-offs | |
|
|
|
|