Thomas G. Szymanski

Publication Activity (10 Years)

Years Active: 1972-1997
Publications (10 Years): 0

Publications

Soumitra Bose, Vishwani D. Agrawal, Thomas G. Szymanski
Algorithms for Switch Level Delay Fault Simulation. ITC (1997)
Thomas G. Szymanski
Computing Optimal Clock Schedules. DAC (1992)
Thomas G. Szymanski, Narendra V. Shenoy
Verifying clock schedules. ICCAD (1992)
Prathima Agrawal, Scott H. Robinson, Thomas G. Szymanski
Automatic modeling of switch-level networks using partial orders [MOS circuits]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9 (7) (1990)
Laurence E. Bays, Chin-Fu Chen, Evelyn M. Fields, Renato N. Gadenz, W. Patrick Hays, Howard S. Moscovitz, Thomas G. Szymanski
Post-layout verification of the WE DSP32 digital signal processor. IEEE Des. Test 6 (1) (1989)
Prathima Agrawal, Scott H. Robinson, Thomas G. Szymanski
Automatic modeling of switch-level networks using partial orders. ICCAD (1988)
Thomas G. Szymanski
Hash Table Reorganization. J. Algorithms 6 (3) (1985)
Thomas G. Szymanski
Dogleg Channel Routing is NP-Complete. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4 (1) (1985)
Thomas G. Szymanski, Christopher J. Van Wyk
Goalie: A Space Efficient System for VLSI Artwork Analysis. IEEE Des. Test 2 (3) (1985)
Thomas G. Szymanski, Christopher J. Van Wyk
Space efficient algorithms for VLSI artwork analysis. DAC (1983)
James A. Storer, Thomas G. Szymanski
Data compression via textual substitution. J. ACM 29 (4) (1982)
Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao
The Complexity of Finding Cycles in Periodic Functions. SIAM J. Comput. 11 (2) (1982)
Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. SIAM J. Comput. 10 (3) (1981)
Bruce W. Leverett, Thomas G. Szymanski
Chaining Span-Dependent Jump Instructions. ACM Trans. Program. Lang. Syst. 2 (3) (1980)
Robert Sedgewick, Thomas G. Szymanski
The Complexity of Finding Periods STOC (1979)
Thomas G. Szymanski
Assembling Code for Machines with Span-Dependent Instructions. Commun. ACM 21 (4) (1978)
Harry B. Hunt III, Thomas G. Szymanski
Lower Bounds and Reductions Between Grammar Problems. J. ACM 25 (1) (1978)
James A. Storer, Thomas G. Szymanski
The Macro Model for Data Compression (Extended Abstract) STOC (1978)
Harry B. Hunt III, Thomas G. Szymanski
Corrigendum: "Lower Bounds and Reductions Between Grammar Problems". J. ACM 25 (4) (1978)
James W. Hunt, Thomas G. Szymanski
A Fast Algorithm for Computing Longest Subsequences. Commun. ACM 20 (5) (1977)
Thomas G. Szymanski, Jeffrey D. Ullman
Evaluating Relational Expressions with Dense and Sparse Arguments. SIAM J. Comput. 6 (1) (1977)
Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
Economy of Description by Parsers, DPDA'S, and PDA'S. Theor. Comput. Sci. 4 (2) (1977)
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
Operations on Sparse Relations. Commun. ACM 20 (3) (1977)
Erik Meineche Schmidt, Thomas G. Szymanski
Succinctness of Descriptions of Unambiguous Context-Free Languages. SIAM J. Comput. 6 (3) (1977)
Harry B. Hunt III, Thomas G. Szymanski
Complexity Metatheorems for Context-Free Grammar Problems. J. Comput. Syst. Sci. 13 (3) (1976)
Thomas G. Szymanski
Concerning Bounded-Right-Context Grammars. Theor. Comput. Sci. 3 (3) (1976)
Thomas G. Szymanski, John H. Williams
Noncanonical Extensions of Bottom-Up Parsing Techniques. SIAM J. Comput. 5 (2) (1976)
Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. J. Comput. Syst. Sci. 12 (2) (1976)
Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
The Covering Problem for Linear Context-Free Grammars. Theor. Comput. Sci. 2 (3) (1976)
Harry B. Hunt III, Thomas G. Szymanski
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) STOC (1976)
Harry B. Hunt III, Thomas G. Szymanski
On the Complexity of Grammar and Related Problems STOC (1975)
Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
Economy of Descriptions by Parsers, DPDA's, and PDA's FOCS (1975)
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
On the Complexity of LR(k) Testing. Commun. ACM 18 (12) (1975)
Thomas G. Szymanski, Jeffrey D. Ullman
Evaluating Relational Expressions with Dense and Sparse Arguments FOCS (1975)
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
On the Complexity of LR(k) Testing. POPL (1975)
Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) SWAT (1974)
Thomas G. Szymanski, John H. Williams
Non-Canonical Parsing SWAT (1973)
Steven Brown, David Gries, Thomas G. Szymanski
Program Schemes with Pushdown Stores. SIAM J. Comput. 1 (3) (1972)