Research Initiation:  Inherent Complexity of Priority       Problems
{'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 reseearch will investigate the minimum spanning tree and matching          problems from the point of view of inherent complexity.  The best known         algorithms for both problems use priority queues in similar ways.  The          priority queue operations are the bottlenecks of these algorithms.  By          investigating the inherent complexity of the priority queue problems in         the comparison tree model, it should be possible to determine how far           current ideas about how to solve these problems can be pushed.
{'FirstName': 'Thomas', 'LastName': 'Spencer', 'PI_MID_INIT': 'H', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Thomas H Spencer', 'EmailAddress': 'spencer @ unocss.unomaha.edu', 'NSF_ID': '000094961', 'StartDate': '09/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Rensselaer Polytechnic Institute', 'CityName': 'TROY', 'ZipCode': '121803590', 'PhoneNumber': '5182766000', 'StreetAddress': '110 8TH ST', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '20', 'CONGRESS_DISTRICT_ORG': 'NY20', 'ORG_UEI_NUM': 'U5WBFKEBLMX3', 'ORG_LGL_BUS_NAME': 'RENSSELAER POLYTECHNIC INSTITUTE', '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': '8810609.xml'}