University of Illinois Urbana-Champaign

The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots

Tiwari, Prasoon

This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.

Permalink

https://hdl.handle.net/2142/75711

Description

Title
The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots
Author(s)
Tiwari, Prasoon
Issue Date
1986-10
Keyword(s)
  • Distributed systems
  • Distributed algorithms
  • Parallel algorithms
  • Polynomial roots
  • Communication complexity
Publisher
Applied Computation Theory, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
Series/Report Name or Number
Coordinated Science Laboratory Report no. UILU-ENG-86-2236, ACT-71
Type of Resource
text
Language
English
Permalink
http://hdl.handle.net/2142/75711
Sponsor(s)/Grant Number(s)
  • National Science Foundation / MCS-82-17445
  • Eastman Kodak Company
  • Schlumberger Doctoral Fellowship in Electrical and Computer Engineering
  • Office of Naval Research / N00014-85-K-00570
  • IBM graduate fellowship

Owning Collections

Report - Coordinated Science Laboratory PRIMARY