Files in this item

FilesDescriptionFormat

application/pdf

application/pdfB39-ACT-71.pdf (2MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots
Author(s):Tiwari, Prasoon
Subject(s):Distributed systems
Distributed algorithms
Parallel algorithms
Polynomial roots
Communication complexity
Issue Date:1986-10
Publisher:Applied Computation Theory, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
Series/Report:Coordinated Science Laboratory Report no. UILU-ENG-86-2236, ACT-71
Genre:Report
Type:Text
Language:English
Description:Coordinated Science Laboratory changed its name from Control Systems Laboratory
URI:http://hdl.handle.net/2142/75711
Sponsor: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
Date Available in IDEALS:2015-04-22


This item appears in the following Collection(s)

Item Statistics