 | 1997 |
|---|
| 34 |       | Soumitra Bose,
Vishwani D. Agrawal,
Thomas G. Szymanski:
Algorithms for Switch Level Delay Fault Simulation.
ITC 1997: 982-991 |
| 1992 |
|---|
| 33 |  | Thomas G. Szymanski:
Computing Optimal Clock Schedules.
DAC 1992: 399-404 |
| 32 | | Thomas G. Szymanski,
Narendra V. Shenoy:
Verifying clock schedules.
ICCAD 1992: 124-131 |
| 1990 |
|---|
| 31 | | Prathima Agrawal,
Scott H. Robinson,
Thomas G. Szymanski:
Automatic modeling of switch-level networks using partial orders [MOS circuits].
IEEE Trans. on CAD of Integrated Circuits and Systems 9(7): 696-707 (1990) |
| 1985 |
|---|
| 30 | | Thomas G. Szymanski:
Dogleg Channel Routing is NP-Complete.
IEEE Trans. on CAD of Integrated Circuits and Systems 4(1): 31-41 (1985) |
| 29 | | Thomas G. Szymanski:
Hash Table Reorganization.
J. Algorithms 6(3): 322-335 (1985) |
| 1982 |
|---|
| 28 | | James A. Storer,
Thomas G. Szymanski:
Data compression via textural substitution.
J. ACM 29(4): 928-951 (1982) |
| 27 | | Robert Sedgewick,
Thomas G. Szymanski,
Andrew Chi-Chih Yao:
The Complexity of Finding Cycles in Periodic Functions.
SIAM J. Comput. 11(2): 376-390 (1982) |
| 1981 |
|---|
| 26 | | 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): 405-421 (1981) |
| 1980 |
|---|
| 25 | | Bruce W. Leverett,
Thomas G. Szymanski:
Chaining Span-Dependent Jump Instructions.
ACM Trans. Program. Lang. Syst. 2(3): 274-289 (1980) |
| 1979 |
|---|
| 24 | | Robert Sedgewick,
Thomas G. Szymanski:
The Complexity of Finding Periods
STOC 1979: 74-80 |
| 1978 |
|---|
| 23 | | James A. Storer,
Thomas G. Szymanski:
The Macro Model for Data Compression (Extended Abstract)
STOC 1978: 30-39 |
| 22 | | Thomas G. Szymanski:
Assembling Code for Machines with Span-Dependent Instructions.
Commun. ACM 21(4): 300-308 (1978) |
| 21 | | Harry B. Hunt III,
Thomas G. Szymanski:
Lower Bounds and Reductions Between Grammar Problems.
J. ACM 25(1): 32-51 (1978) |
| 20 | | Harry B. Hunt III,
Thomas G. Szymanski:
Corrigendum: ``Lower Bounds and Reductions Between Grammar Problems''.
J. ACM 25(4): 687-688 (1978) |
| 1977 |
|---|
| 19 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
Operations on Sparse Relations.
Commun. ACM 20(3): 171-176 (1977) |
| 18 | | James W. Hunt,
Thomas G. Szymanski:
A Fast Algorithm for Computing Longest Subsequences.
Commun. ACM 20(5): 350-353 (1977) |
| 17 | | Thomas G. Szymanski,
Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments.
SIAM J. Comput. 6(1): 109-122 (1977) |
| 16 | | Erik Meineche Schmidt,
Thomas G. Szymanski:
Succinctness of Descriptions of Unambiguous Context-Free Languages.
SIAM J. Comput. 6(3): 547-553 (1977) |
| 15 | | 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): 143-153 (1977) |
| 1976 |
|---|
| 14 | | Harry B. Hunt III,
Thomas G. Szymanski:
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract)
STOC 1976: 126-134 |
| 13 | | 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): 222-268 (1976) |
| 12 | | Harry B. Hunt III,
Thomas G. Szymanski:
Complexity Metatheorems for Context-Free Grammar Problems.
J. Comput. Syst. Sci. 13(3): 318-334 (1976) |
| 11 | | Thomas G. Szymanski,
John H. Williams:
Noncanonical Extensions of Bottom-Up Parsing Techniques.
SIAM J. Comput. 5(2): 231-250 (1976) |
| 10 | | Harry B. Hunt III,
Daniel J. Rosenkrantz,
Thomas G. Szymanski:
The Covering Problem for Linear Context-Free Grammars.
Theor. Comput. Sci. 2(3): 361-382 (1976) |
| 9 | | Thomas G. Szymanski:
Concerning Bounded-Right-Context Grammars.
Theor. Comput. Sci. 3(3): 273-282 (1976) |
| 1975 |
|---|
| 8 | | 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: 122-127 |
| 7 | | Thomas G. Szymanski,
Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments
FOCS 1975: 90-97 |
| 6 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
On the Complexity of LR(k) Testing.
POPL 1975: 130-136 |
| 5 | | Harry B. Hunt III,
Thomas G. Szymanski:
On the Complexity of Grammar and Related Problems
STOC 1975: 54-65 |
| 4 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
On the Complexity of LR(k) Testing.
Commun. ACM 18(12): 707-716 (1975) |
| 1974 |
|---|
| 3 | | Harry B. Hunt III,
Thomas G. Szymanski,
Jeffrey D. Ullman:
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)
FOCS 1974: 127-132 |
| 1973 |
|---|
| 2 | | Thomas G. Szymanski,
John H. Williams:
Non-Canonical Parsing
FOCS 1973: 122-129 |
| 1972 |
|---|
| 1 | | Steven Brown,
David Gries,
Thomas G. Szymanski:
Program Schemes with Pushdown Stores.
SIAM J. Comput. 1(3): 242-268 (1972) |
