Thomas G. Szymanski

From MaRDI portal
Person:1229099

Available identifiers

zbMath Open szymanski.thomas-gMaRDI QIDQ1229099

List of research outcomes





PublicationDate of PublicationType
The macro model for data compression (Extended Abstract)2014-03-14Paper
Hash table reorganization1985-01-01Paper
Data compression via textual substitution1982-01-01Paper
The Complexity of Finding Cycles in Periodic Functions1982-01-01Paper
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions1981-01-01Paper
Chaining Span-Dependent Jump Instructions1980-01-01Paper
Assembling code for machines with span-dependent instructions1978-01-01Paper
Lower Bounds and Reductions Between Grammar Problems1978-01-01Paper
Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems1978-01-01Paper
A fast algorithm for computing longest common subsequences1977-01-01Paper
Succinctness of Descriptions of Unambiguous Context-Free Languages1977-01-01Paper
Economy of description by parsers, DPDA's, and PDA's1977-01-01Paper
Operations on sparse relations1977-01-01Paper
Concerning bounded-right-context grammars1977-01-01Paper
Evaluating Relational Expressions with Dense and Sparse Arguments1977-01-01Paper
On the equivalence, containment, and covering problems for the regular and context-free languages1976-01-01Paper
Noncanonical Extensions of Bottom-Up Parsing Techniques1976-01-01Paper
The covering problem for linear context-free grammars1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403661976-01-01Paper
Complexity metatheorems for context-free grammar problems1976-01-01Paper
On the complexity of LR(k) testing1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41349791975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331291975-01-01Paper
Program Schemes with Pushdown Stores1972-01-01Paper

Research outcomes over time

This page was built for person: Thomas G. Szymanski