Algorithmic and Combintorial Problems On Words
{'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}
The objective of this research is to limit a systematic study of the            tradeoff between structural simplicity and expected performance in              combinatorial algorithms.  In this research, the attention is                   restricted to some fundamental algorithmic problems on words (or                strings).  One goal is that of testing to what extent simpler and more          direct algorithms can be expected in practice to match performance of           more complicated, asymptotically faster ones.  (In general,                     straightforward algorithms are not only more easily designed, but also          more easily encoded, debugged, documented, upgraded etc.)  Another goal         is that of discovering entirely new algorithms on words that would              represent good compromises in terms of structural complexity, expected          performance and worst-case performance.  A third goal is that of                identifying novel cost measures for at least some classes of                    algorithms, possibly along with new analysis-design methodologies.
[{'FirstName': 'Alberto', 'LastName': 'Apostolico', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Alberto Apostolico', 'EmailAddress': 'axa@cc.gatech.edu', 'NSF_ID': '000210555', 'StartDate': '06/30/1993', 'EndDate': None, 'RoleCode': 'Principal Investigator'}, {'FirstName': 'Wojciech', 'LastName': 'Szpankowski', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Wojciech Szpankowski', 'EmailAddress': 'spa@cs.purdue.edu', 'NSF_ID': '000286821', 'StartDate': '07/01/1989', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}]
{'Name': 'Purdue Research Foundation', 'CityName': 'WEST LAFAYETTE', 'ZipCode': '479064353', 'PhoneNumber': '3174946200', 'StreetAddress': '1281 WIN HENTSCHEL BLVD STE 2500', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Indiana', 'StateCode': 'IN', 'CONGRESSDISTRICT': '04', 'CONGRESS_DISTRICT_ORG': 'IN04', 'ORG_UEI_NUM': 'C1G1LGYJF5G5', 'ORG_LGL_BUS_NAME': 'PURDUE RESEARCH FOUNDATION', 'ORG_PRNT_UEI_NUM': 'YRXVL4JYCEF5'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '286000', 'Text': 'THEORY OF COMPUTING'}, {'Code': '471500', 'Text': 'COMPUTER SYSTEMS ARCHITECTURE'}, {'Code': '592000', 'Text': 'ITALY'}, {'Code': '914500', 'Text': 'SPECIAL PROGRAMS-RESERVE'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1989&All=true', 'xml': '8900305.xml'}