bibliography tgs
-
S. Brown and D. Gries and T. G. Szymanski,
Program Schemes with Pushdown Stores,
SIAM J. Computing,
Vol. 1:3,
pp. 242--268,
September 1972.
-
T. G. Szymanski,
Generalized Bottom-Up Parsing,
73-168,
Dept. of Computer Science Cornell University,
Ithaca New York,
May 1973,
Report.
-
T. G. Szymanski and J. H. Williams,
Non-Canonical Parsing,
Proc. 14th Annual IEEE Symp. on Switching and Automata Theory,
pp. 122--129,
October 1973.
-
Hunt III H. B. and T. G. Szymanski and J. D. Ullman,
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems,
Proc. 15th Annual IEEE Symp. on Switching and Automata Theory,
pp. 127--132,
October 1974.
-
T. G. Szymanski,
A Special Case of the Maximal Common Subsequence Problem,
170,
Dept. of Elect. Eng. and Computer Science Princeton University,
Princeton N.J.,
January 1975,
Report.
-
Hunt III H. B. and T. G. Szymanski,
On the Complexity of Grammar and Related Problems,
Proc. 7th Annual ACM Symp. on Theory of Computing,
pp. 54--65,
May 1975.
-
Hunt III H. B. and T. G. Szymanski and J. D. Ullman,
On the Complexity of LR (k) Testing,
Comm. ACM,
Vol. 18,
12,
pp. 707--716,
December 1975,
(Also in it Conf. Rec. 2nd ACM Symp. on Principles of Programming Languages pp. 130-136 Jan. 1975.) .
-
Hunt III H. B. and D. J. Rosenkrantz and T. G. Szymanski,
On the Equivalence Containment and Covering Problems for the Regular and Context-Free Grammars,
J. Comp. and Sys. Sciences,
Vol. 12:2,
pp. 222--268,
April 1976.
-
Hunt III H. B. and T. G. Szymanski,
Dichotomization Reachability and the Forbidden Subgraph Problem,
Proc. 8th Annual ACM Symp. on Theory of Computing,
pp. 126--134,
May 1976.
-
T. G. Szymanski and J. H. Williams,
Non-Canonical Extensions of Bottom-Up Parsing Techniques,
SIAM J. Computing,
Vol. 5:2,
pp. 231--250,
June 1976.
-
Hunt III H. B. and D. J. Rosenkrantz and T. G. Szymanski,
The Covering Problem for Linear Context-Free Grammars,
Theoretical Computer Science,
Vol. 2:3,
pp. 361--382,
September 1976.
-
Hunt III H. B. and T. G. Szymanski,
Complexity Metatheorems for Context-Free Grammar Problems,
J. Comp. and Sys. Sciences,
Vol. 13:3,
pp. 318--334,
December 1976.
-
T. G. Szymanski and J. D. Ullman,
Evaluating Relational Expressions with Dense and Sparse Arguments,
SIAM J. Computing,
Vol. 6:1,
pp. 109--122,
March 1977,
(Earlier version in it Proc. 16th Annual IEEE Symp. on Foundations of Computing pp. 90-97 October 1975.) .
-
Hunt III H. B. and T. G. Szymanski and J. D. Ullman,
Operations on Sparse Relations,
Comm. ACM,
Vol. 20:3,
pp. 171--176,
March 1977.
-
T. G. Szymanski,
Concerning Bounded-Right-Context Grammars,
Theoretical Computer Science,
Vol. 3:3,
pp. 273--282,
May 1977.
-
Hunt III J. W. and T. G. Szymanski,
A Fast Algorithm for Computing Longest Common Subsequences,
Comm. ACM,
Vol. 20:5,
pp. 350--353,
May 1977.
-
E. M. Schmidt and T. G. Szymanski,
Succinctness of Description of Unambiguous Context-free Languages,
SIAM J. Computing,
Vol. 6:3,
pp. 547--553,
September 1977.
-
M. M. Geller and Hunt III H. B. and T. G. Szymanski and J. D. Ullman,
Economy of description by parsers dpda s and pda s,
Theoretical Computer Science,
Vol. 4,
pp. 143--153,
October 1977,
(Earlier version in it Proc. 16th Annual IEEE Symp. on Foundations of Computing pp. 120-127 October 1975.) .
-
Hunt III H. B. and T. G. Szymanski,
Lower Bounds and Reductions Between Grammar Problems,
J. ACM,
Vol. 25,
1,
pp. 32--51,
January 1978,
((Corrigendum it J. ACM bf 25( 4) pp. 687-688 October 1978.)) .
-
T. G. Szymanski,
Assembling Code for Machines With Span-Dependent Instructions,
Comm. ACM,
Vol. 21,
4,
pp. 300--308,
April 1978.
-
J. A. Storer and T. G. Szymanski,
The Macro Model for Data Compression,
Proc. 10th Annual ACM Symp. on Theory of Computing,
pp. 30--39,
May 1978.
-
A. V. Aho and Y. Sagiv and T. G. Szymanski and J. D. Ullman,
Inferring a Tree from Lowest Common Ancestors With an Application to the Optimization of Relational Expressions,
SIAM J. on Computing,
Vol. 10,
3,
pp. 405--421,
October 1978,
(Earlier version in it Proc. 16th Annual Allerton Conference on Communication Control and Computing October 1978.) .
-
R. Sedgewick and T. G. Szymanski,
The Complexity of Finding Periods,
Proc 11th Ann. SIGACT Conf. on Theory of Computing,
pp. 74--80,
May 1979.
-
A. V. Aho and T. G. Szymanski and M. Yannakakis,
Sorting the Cartesian Product,
Proc. Princeton Conf. on Inf. Science and Systems,
pp. 557--558,
March 1980.
-
Bruce Leverett and T. G. Szymanski,
Chaining Span-Dependent Jump Instructions,
ACM Trans. on Programming Languages and Systems,
Vol. 2,
3,
pp. 274--289,
July 1980.
-
B. Aldefeld and S. E. Levinson and T. G. Szymanski,
A Minimum-Distance Search Technique and Its Application to Automatic Directory Assistance,
Bell Sys. Tech. J.,
Vol. 59,
8,
pp. 1343--1356,
October 1980.
-
R. Sedgewick and T. G. Szymanski and A. C. Yao,
The Complexity of Finding Cycles in Periodic Functions,
SIAM J. on Computing,
Vol. 11,
2,
pp. 376--390,
May 1982.
-
J. A. Storer and T. G. Szymanski,
Data Compression via Textual Substitution,
JACM,
Vol. 29,
4,
pp. 928--951,
October 1982.
-
B. Aldefeld and S. E. Levinson and T. G. Szymanski,
Spelled Word Recognizer,
US Patent 4 355 302,
October 1982.
-
T. G. Szymanski and C. J. Van Wyk,
Space Efficient Algorithms for VLSI Artwork Analysis,
Proc. 20th Design Automation Conf.,
pp. 734--739,
June 1983.
-
T. G. Szymanski,
Dogleg Channel Routing is NP -Complete,
IEEE Trans. on Computer-Aided Design,
Vol. CAD-4,
1,
pp. 31--41,
January 1985.
-
T. G. Szymanski,
Hash Table Reorganization,
J. of Algorithms,
6,
pp. 322--335,
March 1985.
-
T. G. Szymanski and C. J. Van Wyk,
GOALIE A Space Efficient System for VLSI Artwork Analysis,
IEEE Design and Test of Computers,
Vol. 2,
3,
pp. 64--72,
June 1985,
(Earlier version in it International Conference on Computer-Aided Design pp. 278-280 November 1984.) .
-
T. G. Szymanski,
LEADOUT A Static Timing Analyzer for MOS Circuits,
International Conference on Computer-Aided Design,
pp. 130--133,
November 1986.
-
T. G. Szymanski and C. J. Van Wyk,
Layout Analysis and Verification,
Physical Design Automation of Electronic Systems,
Ed. B. T. Preas and M. J. Lorenzetti,
Benjamin Cummings Publishing Co. Inc.,
1988.
-
R. N. Gadenz and W. P. Hays and L. E. Bays and C. F. Chen and E. M. Fields and H. S. Moscovitz and T. G. Szymanski,
Post-Layout Verification for the WE DSP32 Digital Signal Processor,
IEEE Design and Test of Computers,
Vol. 6,
1,
pp. 56--66,
February 1989.
-
P. Agrawal and S. H. Robinson and T. G. Szymanski,
Automatic Modeling of Switch-Level Networks Using Partial Orders,
IEEE Trans. on Computer-Aided Design,
Vol. 9,
7,
pp. 696--707,
July 1990,
(Earlier version in it International Conference on Computer-Aided Design pp. 350-353 November 1988) .
-
T. G. Szymanski,
Computing Optimal Clock Schedules,
Proc. 29th Design Automation Conf.,
pp. 399--404,
June 1992.
-
T. G. Szymanski and N. Shenoy,
Verifying Clock Schedules,
International Conference on Computer-Aided Design,
pp. 124--131,
November 1992.
-
T. G. Szymanski and N. Shenoy,
How Good is the Min-Max Delay Model?,
Tau 93: Workshop on Timing Issues in the Specification and Synthesis of Digital Systems,
September 1993.
-
S. Bose and V. D. Agrawal and T. G. Szymanski,
Algorithms for Switch Level Delay Fault Simulation,
International Test Conference,
pp. 982--991,
November 1997.
Go to the Computing Sciences
Research Center home page.
Modified: December, 1997.
Copyright © 1997
Lucent Technologies. All rights reserved.