Topics in Algorithms and Complexity
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes', 'PO_EMAI': None, 'PO_PHON': None}
This research concerns main areas of algorithms and complexity. In              graph isomorphism testing, a search for unifying sequential and                 parallel algorithms solving efficiently several of the known tractable          cases, in particular the classes of graphs with bounded valence or              eigenvalue multiplicity, will be unitiated.  In communication                   complexity, specific problems in the deterministic and probabilistic            models will be investigated.  Besides the standard application of               communication complexity to the AT2 complexity in VLSI, this project            will also consider applications to lower bound problems. In learnabiliy         theory, the kearning of language classes for a variety of learning              protocols will be investigated.  Possible extensions and their                  limitations of algorithms for learning finite automata, Marcov chains,          as well as deteministic one counter automata will be considered.
[{'FirstName': 'Piotr', 'LastName': 'Berman', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Piotr Berman', 'EmailAddress': None, 'NSF_ID': '000495443', 'StartDate': '09/01/1988', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}, {'FirstName': 'Martin', 'LastName': 'Furer', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Martin Furer', 'EmailAddress': 'fhs@psu.edu', 'NSF_ID': '000428276', 'StartDate': '09/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}, {'FirstName': 'Georg', 'LastName': 'Schnitger', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Georg Schnitger', 'EmailAddress': 'georg@cs.psu.edu', 'NSF_ID': '000220564', 'StartDate': '09/01/1988', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}]
{'Name': 'Pennsylvania State Univ University Park', 'CityName': 'UNIVERSITY PARK', 'ZipCode': '168021503', 'PhoneNumber': '8148651372', 'StreetAddress': '201 OLD MAIN', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Pennsylvania', 'StateCode': 'PA', 'CONGRESSDISTRICT': '15', 'CONGRESS_DISTRICT_ORG': 'PA15', 'ORG_UEI_NUM': 'NPM2J7MSCF61', 'ORG_LGL_BUS_NAME': 'THE PENNSYLVANIA STATE 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': '8805978.xml'}