Thomas G. Szymanski

发表

Noncanonical Extensions of Bottom-Up Parsing Techniques

Thomas G. Szymanski, John H. Williams, T. G. Szymanski, 1976, SIAM J. Comput..

Economy of description by parsers, DPDA's, and PDA's

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

On the Complexity of LR(k) Testing

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1975, Commun. ACM.

Assembling code for machines with span-dependent instructions

Thomas G. Szymanski, T. G. Szymanski, 1978, CACM.

Evaluating Relational Expressions with Dense and Sparse Arguments

Jeffrey D. Ullman, Thomas G. Szymanski, 1977, SIAM J. Comput..

Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems''

Harry B. Hunt, Thomas G. Szymanski, 1978, JACM.

Computing optimal clock schedules

Thomas G. Szymanski, T. G. Szymanski, 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

Program Schemes with Pushdown Stores

David Gries, Thomas G. Szymanski, Steven Brown, 1972, SIAM J. Comput..

Space Efficient Algorithms for VLSI Artwork Analysis

Christopher J. Van Wyk, Thomas G. Szymanski, 1983, 20th Design Automation Conference Proceedings.

Succinctness of Descriptions of Unambiguous Context-Free Languages

Erik Meineche Schmidt, Thomas G. Szymanski, 1977, SIAM J. Comput..

On the complexity of LR(k) testing

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1975, CACM.

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1974, SWAT.

Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)

Harry B. Hunt, Thomas G. Szymanski, 1976, STOC '76.

Verifying clock schedules

Narendra V. Shenoy, Thomas G. Szymanski, 1992, ICCAD.

On the complexity of grammar and related problems

Harry B. Hunt, Thomas G. Szymanski, T. G. Szymanski, 1975, STOC.

Data compression via textual substitution

James A. Storer, Thomas G. Szymanski, T. G. Szymanski, 1982, JACM.

The macro model for data compression (Extended Abstract)

James A. Storer, Thomas G. Szymanski, 1978, STOC '78.

On the complexity of LR(k) testing

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1975, POPL 1975.

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

Alfred V. Aho, Jeffrey D. Ullman, Thomas G. Szymanski, 1981, SIAM J. Comput..

Automatic modeling of switch-level networks using partial orders [MOS circuits]

Prathima Agrawal, Thomas G. Szymanski, Scott H. Robinson, 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Operations on sparse relations

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1977, CACM.

Dogleg Channel Routing is NP-Complete

Thomas G. Szymanski, 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

The complexity of finding periods

Thomas G. Szymanski, Robert Sedgewick, 1979, STOC '79.

Method and circuit arrangement for detecting an alphanumeric input string

Thomas G. Szymanski, Stephen E. Levinson, Bernd Aldefeld, 1981 .

Chaining Span-Dependent Jump Instructions

Thomas G. Szymanski, Bruce W. Leverett, T. G. Szymanski, 1980, ACM Trans. Program. Lang. Syst..

The Covering Problem for Linear Context-Free Grammars

Harry B. Hunt, Daniel J. Rosenkrantz, Thomas G. Szymanski, 1976, Theor. Comput. Sci..

Evaluating relational expressions with dense and sparse arguments

Jeffrey D. Ullman, Thomas G. Szymanski, 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

Economy of Descriptions by Parsers, DPDA's, and PDA's

Harry B. Hunt, Jeffrey D. Ullman, Thomas G. Szymanski, 1975, FOCS.

Lower Bounds and Reductions Between Grammar Problems

Harry B. Hunt, Thomas G. Szymanski, T. G. Szymanski, 1978, JACM.

Non-Canonical Parsing

Thomas G. Szymanski, John H. Williams, T. G. Szymanski, 1973, SWAT.

A fast algorithm for computing longest common subsequences

Thomas G. Szymanski, James W. Hunt, T. G. Szymanski, 1977, CACM.

The Complexity of Finding Cycles in Periodic Functions

Andrew Chi-Chih Yao, Thomas G. Szymanski, Robert Sedgewick, 1982, SIAM J. Comput..

Algorithms for switch level delay fault simulation

Soumitra Bose, Vishwani D. Agrawal, Thomas G. Szymanski, 1997, Proceedings International Test Conference 1997.

Hash Table Reorganization

Thomas G. Szymanski, 1985, J. Algorithms.

Concerning Bounded-Right-Context Grammars

Thomas G. Szymanski, 1976, Theor. Comput. Sci..

Complexity Metatheorems for Context-Free Grammar Problems

Harry B. Hunt, Thomas G. Szymanski, T. G. Szymanski, 1976, J. Comput. Syst. Sci..

Verifying clock schedules

Narendra V. Shenoy, Thomas G. Szymanski, T. G. Szymanski, 1992, ICCAD 1992.

Automatic modeling of switch-level networks using partial orders

Prathima Agrawal, Thomas G. Szymanski, Scott H. Robinson, 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.