%% Szymanski T % % converted from refer format by refer-to-bibtex 0.7.1 % @article{Brown72, author = {S. Brown and D. Gries and T. G. Szymanski}, title = {Program Schemes with Pushdown Stores}, journal = {SIAM J. Computing}, volume = {1:3}, pages = {242--268}, month = {September}, year = {1972} } @techreport{Szymanski73, author = {T. G. Szymanski}, institution = {Dept. of Computer Science, Cornell University}, title = {Generalized Bottom-Up Parsing}, type = {Report}, number = {73-168}, address = {Ithaca, New York}, month = {May}, year = {1973}, keywords = {DNL} } @inproceedings{Szymanski73a, author = {T. G. Szymanski and J. H. Williams}, title = {Non-Canonical Parsing}, booktitle = {Proc. 14th Annual IEEE Symp. on Switching and Automata Theory}, pages = {122--129}, month = {October}, year = {1973} } @inproceedings{Hunt74, author = {Hunt, III, H. B. and T. G. Szymanski and J. D. Ullman}, title = {Operations on Sparse Relations and Efficient Algorithms for Grammar Problems}, booktitle = {Proc. 15th Annual IEEE Symp. on Switching and Automata Theory}, pages = {127--132}, month = {October}, year = {1974} } @techreport{Szymanski75, author = {T. G. Szymanski}, institution = {Dept. of Elect. Eng. and Computer Science, Princeton University}, title = {A Special Case of the Maximal Common Subsequence Problem}, type = {Report}, number = {170}, address = {Princeton, N.J.}, month = {January}, year = {1975}, keywords = {DNL} } @inproceedings{Hunt75, author = {Hunt, III, H. B. and T. G. Szymanski}, title = {On the Complexity of Grammar and Related Problems}, booktitle = {Proc. 7th Annual ACM Symp. on Theory of Computing}, pages = {54--65}, month = {May}, year = {1975} } @article{Hunt75a, author = {Hunt, III, H. B. and T. G. Szymanski and J. D. Ullman}, title = {On the Complexity of {LR}(k) Testing}, journal = {Comm. ACM}, volume = {18}, number = {12}, pages = {707--716}, month = {December}, year = {1975}, note = {Also in {\it Conf. Rec. 2nd ACM Symp. on Principles of Programming Languages}, pp. 130-136, Jan. 1975.} } @article{Hunt76, author = {Hunt, III, H. B. and D. J. Rosenkrantz and T. G. Szymanski}, title = {On the Equivalence, Containment and Covering Problems for the Regular and Context-Free Grammars}, journal = {J. Comp. and Sys. Sciences}, volume = {12:2}, pages = {222--268}, month = {April}, year = {1976} } @inproceedings{Hunt76a, author = {Hunt, III, H. B. and T. G. Szymanski}, title = {Dichotomization, Reachability and the Forbidden Subgraph Problem}, booktitle = {Proc. 8th Annual ACM Symp. on Theory of Computing}, pages = {126--134}, month = {May}, year = {1976} } @article{Szymanski76, author = {T. G. Szymanski and J. H. Williams}, title = {Non-Canonical Extensions of Bottom-Up Parsing Techniques}, journal = {SIAM J. Computing}, volume = {5:2}, pages = {231--250}, month = {June}, year = {1976} } @article{Hunt76b, author = {Hunt, III, H. B. and D. J. Rosenkrantz and T. G. Szymanski}, title = {The Covering Problem for Linear Context-Free Grammars}, journal = {Theoretical Computer Science}, volume = {2:3}, pages = {361--382}, month = {September}, year = {1976} } @article{Hunt76c, author = {Hunt, III, H. B. and T. G. Szymanski}, title = {Complexity Metatheorems for Context-Free Grammar Problems}, journal = {J. Comp. and Sys. Sciences}, volume = {13:3}, pages = {318--334}, month = {December}, year = {1976} } @article{Szymanski77, author = {T. G. Szymanski and J. D. Ullman}, title = {Evaluating Relational Expressions with Dense and Sparse Arguments}, journal = {SIAM J. Computing}, volume = {6:1}, pages = {109--122}, month = {March}, year = {1977}, note = {Earlier version in {\it Proc. 16th Annual IEEE Symp. on Foundations of Computing}, pp. 90-97, October 1975.} } @article{Hunt77, author = {Hunt, III, H. B. and T. G. Szymanski and J. D. Ullman}, title = {Operations on Sparse Relations}, journal = {Comm. ACM}, volume = {20:3}, pages = {171--176}, month = {March}, year = {1977} } @article{Szymanski77a, author = {T. G. Szymanski}, title = {Concerning Bounded-Right-Context Grammars}, journal = {Theoretical Computer Science}, volume = {3:3}, pages = {273--282}, month = {May}, year = {1977} } @article{Hunt77a, author = {Hunt, III, J. W. and T. G. Szymanski}, title = {A Fast Algorithm for Computing Longest Common Subsequences}, journal = {Comm. ACM}, volume = {20:5}, pages = {350--353}, month = {May}, year = {1977} } @article{Schmidt77, author = {E. M. Schmidt and T. G. Szymanski}, title = {Succinctness of Description of Unambiguous Context-free Languages}, journal = {SIAM J. Computing}, volume = {6:3}, pages = {547--553}, month = {September}, year = {1977} } @article{Geller77, author = {M. M. Geller and Hunt, III, H. B. and T. G. Szymanski and J. D. Ullman}, title = {Economy of description by parsers, dpda's and pda's}, journal = {Theoretical Computer Science}, volume = {4}, pages = {143--153}, month = {October}, year = {1977}, note = {Earlier version in {\it Proc. 16th Annual IEEE Symp. on Foundations of Computing}, pp. 120-127, October 1975.} } @article{Hunt78, author = {Hunt, III, H. B. and T. G. Szymanski}, title = {Lower Bounds and Reductions Between Grammar Problems}, journal = {J. ACM}, volume = {25}, number = {1}, pages = {32--51}, month = {January}, year = {1978}, note = {(Corrigendum, {\it J. ACM {\bf 25(}4)}, pp. 687-688, October 1978.)} } @article{Szymanski78, author = {T. G. Szymanski}, title = {Assembling Code for Machines With Span-Dependent Instructions}, journal = {Comm. ACM}, volume = {21}, number = {4}, pages = {300--308}, month = {April}, year = {1978}, keywords = {cacm} } @inproceedings{Storer78, author = {J. A. Storer and T. G. Szymanski}, title = {The Macro Model for Data Compression}, booktitle = {Proc. 10th Annual ACM Symp. on Theory of Computing}, pages = {30--39}, month = {May}, year = {1978} } @article{Aho78, author = {A. V. Aho and Y. Sagiv and T. G. Szymanski and J. D. Ullman}, title = {Inferring a Tree from Lowest Common Ancestors With an Application to the Optimization of Relational Expressions}, journal = {SIAM J. on Computing}, volume = {10}, number = {3}, pages = {405--421}, month = {October}, year = {1978}, mrnumber = {TM 78-1271-16}, note = {Earlier version in {\it Proc. 16th Annual Allerton Conference on Communication, Control, and Computing}, October 1978.} } @article{Sedgewick79, author = {R. Sedgewick and T. G. Szymanski}, title = {The Complexity of Finding Periods}, journal = {Proc 11th Ann. SIGACT Conf. on Theory of Computing}, pages = {74--80}, month = {May}, year = {1979} } @inproceedings{Aho80, author = {A. V. Aho and T. G. Szymanski and M. Yannakakis}, title = {Sorting the Cartesian Product}, booktitle = {Proc. Princeton Conf. on Inf. Science and Systems}, pages = {557--558}, month = {March}, year = {1980} } @article{Leverett80, author = {Bruce Leverett and T. G. Szymanski}, title = {Chaining Span-Dependent Jump Instructions}, journal = {ACM Trans. on Programming Languages and Systems}, volume = {2}, number = {3}, pages = {274--289}, month = {July}, year = {1980}, mrnumber = {TM 79-1271-14} } @article{Aldefeld80, author = {B. Aldefeld and S. E. Levinson and T. G. Szymanski}, title = {A Minimum-Distance Search Technique and Its Application to Automatic Directory Assistance}, journal = {Bell Sys. Tech. J.}, volume = {59}, number = {8}, pages = {1343--1356}, month = {October}, year = {1980}, mrnumber = {TM 79-1227-22, TM 79-1271-8} } @article{Sedgewick82, author = {R. Sedgewick and T. G. Szymanski and A. C. Yao}, title = {The Complexity of Finding Cycles in Periodic Functions}, journal = {SIAM J. on Computing}, volume = {11}, number = {2}, pages = {376--390}, month = {May}, year = {1982} } @article{Storer82, author = {J. A. Storer and T. G. Szymanski}, title = {Data Compression via Textual Substitution}, journal = {JACM}, volume = {29}, number = {4}, pages = {928--951}, month = {October}, year = {1982} } @article{Aldefeld82, author = {B. Aldefeld and S. E. Levinson and T. G. Szymanski}, title = {Spelled Word Recognizer}, journal = {US Patent 4,355,302}, month = {October}, year = {1982} } @inproceedings{Szymanski83, author = {T. G. Szymanski and C. J. Van Wyk}, title = {Space Efficient Algorithms for {VLSI} Artwork Analysis}, booktitle = {Proc. 20th Design Automation Conf.}, pages = {734--739}, month = {June}, year = {1983} } @article{Szy85, author = {T. G. Szymanski}, title = {Dogleg Channel Routing is {NP}-Complete}, journal = {IEEE Trans. on Computer-Aided Design}, volume = {CAD-4}, number = {1}, pages = {31--41}, month = {January}, year = {1985} } @article{Szy85a, author = {T. G. Szymanski}, title = {Hash Table Reorganization}, journal = {J. of Algorithms}, number = {6}, pages = {322--335}, month = {March}, year = {1985}, mrnumber = {82-11276-3} } @article{SV85, author = {T. G. Szymanski and C. J. Van Wyk}, title = {{GOALIE}: {A} Space Efficient System for {VLSI} Artwork Analysis}, journal = {IEEE Design and Test of Computers}, volume = {2}, number = {3}, pages = {64--72}, month = {June}, year = {1985}, note = {Earlier version in {\it International Conference on Computer-Aided Design}, pp. 278-280, November 1984.} } @inproceedings{Szy86, author = {T. G. Szymanski}, title = {{LEADOUT}: {A} Static Timing Analyzer for {MOS} Circuits}, booktitle = {International Conference on Computer-Aided Design}, pages = {130--133}, month = {November}, year = {1986} } @incollection{SV88, author = {T. G. Szymanski and C. J. Van Wyk}, editor = {B. T. Preas and M. J. Lorenzetti}, title = {Layout Analysis and Verification}, booktitle = {Physical Design Automation of Electronic Systems}, publisher = {Benjamin/Cummings Publishing Co., Inc.}, year = {1988} } @article{GHBCFMS89, author = {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}, title = {Post-Layout Verification for the {WE} DSP32 Digital Signal Processor}, journal = {IEEE Design and Test of Computers}, volume = {6}, number = {1}, pages = {56--66}, month = {February}, year = {1989} } @article{ARS90, author = {P. Agrawal and S. H. Robinson and T. G. Szymanski}, title = {Automatic Modeling of Switch-Level Networks Using Partial Orders}, journal = {IEEE Trans. on Computer-Aided Design}, volume = {9}, number = {7}, pages = {696--707}, month = {July}, year = {1990}, note = {Earlier version in {\it International Conference on Computer-Aided Design}, pp. 350-353, November 1988} } @inproceedings{Szy92, author = {T. G. Szymanski}, title = {Computing Optimal Clock Schedules}, booktitle = {Proc. 29th Design Automation Conf.}, pages = {399--404}, month = {June}, year = {1992} } @inproceedings{SS92, author = {T. G. Szymanski and N. Shenoy}, title = {Verifying Clock Schedules}, booktitle = {International Conference on Computer-Aided Design}, pages = {124--131}, month = {November}, year = {1992} } @inproceedings{SS93, author = {T. G. Szymanski and N. Shenoy}, title = {How Good is the Min-Max Delay Model?}, booktitle = {Tau 93: Workshop on Timing Issues in the Specification and Synthesis of Digital Systems}, month = {September}, year = {1993} } @inproceedings{BAS97, author = {S. Bose and V. D. Agrawal and T. G. Szymanski}, title = {Algorithms for Switch Level Delay Fault Simulation}, booktitle = {International Test Conference}, pages = {982--991}, month = {November}, year = {1997} }