Parallel Algorithms and Complexity Theory
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dana S. Richards', 'PO_EMAI': None, 'PO_PHON': None}
The goals of the proposed research are to understand the nature of              parallel                                                                        computation, to develop theoretical foundations for the design and              analysis of                                                                     algorithms for parallel computer systems, and to apply these principles         to                                                                              discover appropriate parallel computer architectures and algorithms.            Some                                                                            of the specific areas in which research has been and is being conducted         are:                                                                            (1) parallel algorithms for a variety of natural problems, (2) models           of                                                                              parallel computers and their interrelationships, (3) lower bounds or            other                                                                           evidence that specific problems cannot be efficiently solved by                 parallel                                                                        machines, and (4) implementation and measurement of parallel algorithms         on                                                                              currently available processors.                                                                                                                                 This is an excellent proposal by a very fine researcher.  The proposed          study                                                                           of parallel computing is fundamental for progress in computer science           at this                                                                         time.
{'FirstName': 'Walter', 'LastName': 'Ruzzo', 'PI_MID_INIT': 'L', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Walter L Ruzzo', 'EmailAddress': 'ruzzo@cs.washington.edu', 'NSF_ID': '000275104', 'StartDate': '08/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Washington', 'CityName': 'SEATTLE', 'ZipCode': '981951016', 'PhoneNumber': '2065434043', 'StreetAddress': '4333 BROOKLYN AVE NE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Washington', 'StateCode': 'WA', 'CONGRESSDISTRICT': '07', 'CONGRESS_DISTRICT_ORG': 'WA07', 'ORG_UEI_NUM': 'HD1WMN6945W6', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF WASHINGTON', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8703196.xml'}