PYI: Design and Analysis of Algorithms
{'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}
Professor Goldberg's primary research interests can be divided into two         interrelated areas:  algorithms and parallel distributed computation.                                                                                           The purpose of Professor Goldberg's research in the first area is to            develop more efficient algorithms for problems that arise in practice.          such improved algorithms reduce computational requirements for the              corresponding applications and may allow computerized solutions of              problems that are infeasible to solve on a computer using previous              algorithms.  Professor Goldberg studies sequential as well as parallel          and distributed algorithms.  He is also interested in implementation            and experimental evaluation of algorithms.                                                                                                                      Parallel processing is being recognized as one of the most promising            ways to wider the class of problems that are feasible to solve by               computers.                                                                      Massively parallel machines are now available commercially.  Taking             advantage of parallelism, however, often requires special methods.              Professor Goldberg is interested in designing efficient parallel and            distributee algorithms for computation-intensive problems.  In addition         to design of parallel and distributed algorithms for specific problems,         he is interested in general techniques for developing parallel and              distributed algorithms.  He also studies the features of parallel               architectures and distributed systems which facilitate efficient                implementations of algorithms.
{'FirstName': 'Andrew V.', 'LastName': 'Goldberg', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Andrew V. Goldberg', 'EmailAddress': None, 'NSF_ID': '000207724', 'StartDate': '07/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Stanford University', 'CityName': 'STANFORD', 'ZipCode': '943052004', 'PhoneNumber': '6507232300', 'StreetAddress': '450 JANE STANFORD WAY', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'California', 'StateCode': 'CA', 'CONGRESSDISTRICT': '16', 'CONGRESS_DISTRICT_ORG': 'CA16', 'ORG_UEI_NUM': 'HJD6G4D6TJY5', 'ORG_LGL_BUS_NAME': 'THE LELAND STANFORD JUNIOR UNIVERSITY', '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=1988&All=true', 'xml': '8858097.xml'}