| 1997 | ITC | Algorithms for Switch Level Delay Fault Simulation. | Soumitra Bose, Vishwani D. Agrawal, Thomas G. Szymanski |
| 1992 | DAC | Computing Optimal Clock Schedules. | Thomas G. Szymanski |
| 1992 | ICCAD | Verifying clock schedules. | Thomas G. Szymanski, Narendra V. Shenoy |
| 1988 | ICCAD | Automatic modeling of switch-level networks using partial orders. | Prathima Agrawal, Scott H. Robinson, Thomas G. Szymanski |
| 1983 | DAC | Space efficient algorithms for VLSI artwork analysis. | Thomas G. Szymanski, Christopher J. Van Wyk |
| 1979 | STOC | The Complexity of Finding Periods | Robert Sedgewick, Thomas G. Szymanski |
| 1978 | STOC | The Macro Model for Data Compression (Extended Abstract) | James A. Storer, Thomas G. Szymanski |
| 1976 | STOC | Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) | Harry B. Hunt III, Thomas G. Szymanski |
| 1975 | FOCS | Economy of Descriptions by Parsers, DPDA's, and PDA's | Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | FOCS | Evaluating Relational Expressions with Dense and Sparse Arguments | Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | POPL | On the Complexity of LR(k) Testing. | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | STOC | On the Complexity of Grammar and Related Problems | Harry B. Hunt III, Thomas G. Szymanski |
| 1974 | FOCS | Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1973 | FOCS | Non-Canonical Parsing | Thomas G. Szymanski, John H. Williams |