PYI: Resource Bounds and Parallel Computation.
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dana May Latch', 'PO_EMAI': None, 'PO_PHON': None}
This research has two aspects: proving lower bounds on the resources            needed to solve problems and finding algorithms which meet those                resource bounds.                                                                                                                                                A major focus of this research is on how various features of parallel           models affect the resources needed for performing computations.                                                                                                 Large shared-memory machines are likely to be implemented on processor          interconnection networks and this implementation suggests shared-memory         models with even more powerful primitive operations than those of the           machines previously studied - primitive operations like unbounded fan-          in threshold functions and other unbounded fan-in associative                   operations.  Under investigation are the limitations and capabilities           of these more powerful machines which have recently been proposed as            very useful abstractions of large parallel computers.                                                                                                           There still are a number of very basic computational problems such as           division, connectivity, and transitive closure for which parallel               algorithms exist but whose parallel complexity is not clearly                   understood.                                                                     It is particularly important to improve the resource usage for these            basic problems because the algorithms for solving them underlie the             parallel algorithms for many more complex problems.
{'FirstName': 'Paul', 'LastName': 'Beame', 'PI_MID_INIT': 'W', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Paul W Beame', 'EmailAddress': 'beame@cs.washington.edu', 'NSF_ID': '000169746', 'StartDate': '08/06/1993', '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': 'University of Washington', 'CityName': 'SEATTLE', 'StateCode': 'WA', 'ZipCode': '981951016', 'StreetAddress': '4333 BROOKLYN AVE NE', 'CountryCode': 'US', 'CountryName': 'United States', 'StateName': 'Washington', 'CountryFlag': '1', 'CONGRESSDISTRICT': '07', 'CONGRESS_DISTRICT_PERF': 'WA07'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8858799.xml'}