Thomas G. Szymanski

Available identifiers

zbMath Open szymanski.thomas-gMaRDI QIDQ1229099

List of research outcomes

Publication	Date of Publication	Type
The macro model for data compression (Extended Abstract)	2014-03-14	Paper
Hash table reorganization	1985-01-01	Paper
Data compression via textual substitution	1982-01-01	Paper
The Complexity of Finding Cycles in Periodic Functions	1982-01-01	Paper
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions	1981-01-01	Paper
Chaining Span-Dependent Jump Instructions	1980-01-01	Paper
Assembling code for machines with span-dependent instructions	1978-01-01	Paper
Lower Bounds and Reductions Between Grammar Problems	1978-01-01	Paper
Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems	1978-01-01	Paper
A fast algorithm for computing longest common subsequences	1977-01-01	Paper
Succinctness of Descriptions of Unambiguous Context-Free Languages	1977-01-01	Paper
Economy of description by parsers, DPDA's, and PDA's	1977-01-01	Paper
Operations on sparse relations	1977-01-01	Paper
Concerning bounded-right-context grammars	1977-01-01	Paper
Evaluating Relational Expressions with Dense and Sparse Arguments	1977-01-01	Paper
On the equivalence, containment, and covering problems for the regular and context-free languages	1976-01-01	Paper
Noncanonical Extensions of Bottom-Up Parsing Techniques	1976-01-01	Paper
The covering problem for linear context-free grammars	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4140366	1976-01-01	Paper
Complexity metatheorems for context-free grammar problems	1976-01-01	Paper
On the complexity of LR(k) testing	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4134979	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4133129	1975-01-01	Paper
Program Schemes with Pushdown Stores	1972-01-01	Paper

Research outcomes over time

This page was built for person: Thomas G. Szymanski