Thomas G. Szymanski

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