Structure of Computations in Parallel Complexity Classes
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
Research is in progress along two lines.  The first line of research            concerns a two-person pebble game model of synchronous parallel                 computation and some of its applications.  This game extends the two-           person pebble game defined previously by Dymond and Tompa, and provides         a combinatorial framework for the study of issues in parallel                   computation.  The extensions are being used to abstract the control             structure of parallel algorithms.  This game has motivated the                  discovery of a key property, semi unboundedness of computations in the          parallel complexity class LOGCFL.  The second line of research deals            with some interesting theoretical questions raised by this property.            One of these questions involves a study of Boolean circuit models in            which fan-in is considered as a resource in addition to the traditional         resources such as size and depth.  Among other applications, these              models are providing a framework in which to address the question of            closure under complementation of complexity classes such as LOGCFL.                                                                                             The P.I. is a 1986 Ph.D whose proposal contains fresh ideas for                 approaching important questions in the complexity of parallel                   computation.  The proposal and the P.I.'s initial research demonstrate          that he knows the appropriate background material and has the                   capability of successfully attacking the problems proposed.
{'FirstName': 'H', 'LastName': 'Venkateswaran', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'H Venkateswaran', 'EmailAddress': 'venkat@cc.gatech.edu', 'NSF_ID': '000349368', 'StartDate': '09/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Georgia Tech Research Corporation', 'CityName': 'ATLANTA', 'ZipCode': '303186395', 'PhoneNumber': '4048944819', 'StreetAddress': '926 DALNEY ST NW', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Georgia', 'StateCode': 'GA', 'CONGRESSDISTRICT': '05', 'CONGRESS_DISTRICT_ORG': 'GA05', 'ORG_UEI_NUM': 'EMW9FC8J3HN4', 'ORG_LGL_BUS_NAME': 'GEORGIA TECH RESEARCH CORP', 'ORG_PRNT_UEI_NUM': 'EMW9FC8J3HN4'}
{'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': '8711749.xml'}