Program Schemes with Pushdown Stores. - Steven Brown; David Gries; Thomas G. Szymanski (SIAM J. Comput., 1972)

Non-Canonical Parsing - Thomas G. Szymanski; John H. Williams (SWAT, 1973)

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) - Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (SWAT, 1974)

Economy of Descriptions by Parsers, DPDA's, and PDA's - Matthew M. Geller; Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (FOCS, 1975)

On the Complexity of Grammar and Related Problems - Harry B. Hunt III; Thomas G. Szymanski (STOC, 1975)

On the Complexity of LR(k) Testing. - Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (Commun. ACM, 1975)

Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) - Harry B. Hunt III; Thomas G. Szymanski (STOC, 1976)

On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. - Harry B. Hunt III; Daniel J. Rosenkrantz; Thomas G. Szymanski (J. Comput. Syst. Sci., 1976)

Complexity Metatheorems for Context-Free Grammar Problems. - Harry B. Hunt III; Thomas G. Szymanski (J. Comput. Syst. Sci., 1976)

Noncanonical Extensions of Bottom-Up Parsing Techniques. - Thomas G. Szymanski; John H. Williams (SIAM J. Comput., 1976)

The Covering Problem for Linear Context-Free Grammars. - Harry B. Hunt III; Daniel J. Rosenkrantz; Thomas G. Szymanski (Theor. Comput. Sci., 1976)

Concerning Bounded-Right-Context Grammars. - Thomas G. Szymanski (Theor. Comput. Sci., 1976)

A Fast Algorithm for Computing Longest Subsequences. - James W. Hunt; Thomas G. Szymanski (Commun. ACM, 1977)

Operations on Sparse Relations. - Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (Commun. ACM, 1977)

Succinctness of Descriptions of Unambiguous Context-Free Languages. - Erik Meineche Schmidt; Thomas G. Szymanski (SIAM J. Comput., 1977)

Evaluating Relational Expressions with Dense and Sparse Arguments. - Thomas G. Szymanski; Jeffrey D. Ullman (SIAM J. Comput., 1977)

Economy of Description by Parsers, DPDA'S, and PDA'S. - Matthew M. Geller; Harry B. Hunt III; Thomas G. Szymanski; Jeffrey D. Ullman (Theor. Comput. Sci., 1977)

The Macro Model for Data Compression (Extended Abstract) - James A. Storer; Thomas G. Szymanski (STOC, 1978)

Assembling Code for Machines with Span-Dependent Instructions. - Thomas G. Szymanski (Commun. ACM, 1978)

Lower Bounds and Reductions Between Grammar Problems. - Harry B. Hunt III; Thomas G. Szymanski (J. ACM, 1978)

Corrigendum: "Lower Bounds and Reductions Between Grammar Problems". - Harry B. Hunt III; Thomas G. Szymanski (J. ACM, 1978)

The Complexity of Finding Periods - Robert Sedgewick; Thomas G. Szymanski (STOC, 1979)

Chaining Span-Dependent Jump Instructions. - Bruce W. Leverett; Thomas G. Szymanski (ACM Trans. Program. Lang. Syst., 1980)

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Thomas G. Szymanski; Jeffrey D. Ullman (SIAM J. Comput., 1981)

Data compression via textual substitution. - James A. Storer; Thomas G. Szymanski (J. ACM, 1982)

The Complexity of Finding Cycles in Periodic Functions. - Robert Sedgewick; Thomas G. Szymanski; Andrew Chi-Chih Yao (SIAM J. Comput., 1982)

Space efficient algorithms for VLSI artwork analysis. - Thomas G. Szymanski; Christopher J. Van Wyk (DAC, 1983)

Goalie: A Space Efficient System for VLSI Artwork Analysis. - Thomas G. Szymanski; Christopher J. Van Wyk (IEEE Des. Test, 1985)

Hash Table Reorganization. - Thomas G. Szymanski (J. Algorithms, 1985)

Dogleg Channel Routing is NP-Complete. - Thomas G. Szymanski (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985)

Automatic modeling of switch-level networks using partial orders. - Prathima Agrawal; Scott H. Robinson; Thomas G. Szymanski (ICCAD, 1988)

Post-layout verification of the WE DSP32 digital signal processor. - Laurence E. Bays; Chin-Fu Chen; Evelyn M. Fields; Renato N. Gadenz; W. Patrick Hays; Howard S. Moscovitz; Thomas G. Szymanski (IEEE Des. Test, 1989)

Automatic modeling of switch-level networks using partial orders [MOS circuits]. - Prathima Agrawal; Scott H. Robinson; Thomas G. Szymanski (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990)

Computing Optimal Clock Schedules. - Thomas G. Szymanski (DAC, 1992)

Verifying clock schedules. - Thomas G. Szymanski; Narendra V. Shenoy (ICCAD, 1992)

Algorithms for Switch Level Delay Fault Simulation. - Soumitra Bose; Vishwani D. Agrawal; Thomas G. Szymanski (ITC, 1997)