BibTeX records: Thomas G. Szymanski

download as .bib file

@inproceedings{DBLP:conf/itc/BoseAS97,
  author       = {Soumitra Bose and
                  Vishwani D. Agrawal and
                  Thomas G. Szymanski},
  title        = {Algorithms for Switch Level Delay Fault Simulation},
  booktitle    = {Proceedings {IEEE} International Test Conference 1997, Washington,
                  DC, USA, November 3-5, 1997},
  pages        = {982--991},
  publisher    = {{IEEE} Computer Society},
  year         = {1997},
  url          = {https://doi.org/10.1109/TEST.1997.639714},
  doi          = {10.1109/TEST.1997.639714},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/itc/BoseAS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dac/Szymanski92,
  author       = {Thomas G. Szymanski},
  editor       = {Daniel G. Schweikert},
  title        = {Computing Optimal Clock Schedules},
  booktitle    = {Proceedings of the 29th Design Automation Conference, Anaheim, California,
                  USA, June 8-12, 1992},
  pages        = {399--404},
  publisher    = {{IEEE} Computer Society Press},
  year         = {1992},
  url          = {http://portal.acm.org/citation.cfm?id=113938.149547},
  timestamp    = {Thu, 16 Mar 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/dac/Szymanski92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccad/SzymanskiS92,
  author       = {Thomas G. Szymanski and
                  Narendra V. Shenoy},
  editor       = {Louise Trevillyan and
                  Michael R. Lightner},
  title        = {Verifying clock schedules},
  booktitle    = {1992 {IEEE/ACM} International Conference on Computer-Aided Design,
                  {ICCAD} 1992, Santa Clara, CA, USA, November 8-12, 1992. Digest of
                  Technical Papers},
  pages        = {124--131},
  publisher    = {{IEEE} Computer Society / {ACM}},
  year         = {1992},
  url          = {https://doi.org/10.1109/ICCAD.1992.279387},
  doi          = {10.1109/ICCAD.1992.279387},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iccad/SzymanskiS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/AgrawalRS90,
  author       = {Prathima Agrawal and
                  Scott H. Robinson and
                  Thomas G. Szymanski},
  title        = {Automatic modeling of switch-level networks using partial orders {[MOS}
                  circuits]},
  journal      = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
  volume       = {9},
  number       = {7},
  pages        = {696--707},
  year         = {1990},
  url          = {https://doi.org/10.1109/43.55209},
  doi          = {10.1109/43.55209},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcad/AgrawalRS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dt/BaysCFGHMS89,
  author       = {Laurence E. Bays and
                  Chin{-}Fu Chen and
                  Evelyn M. Fields and
                  Renato N. Gadenz and
                  W. Patrick Hays and
                  Howard S. Moscovitz and
                  Thomas G. Szymanski},
  title        = {Post-layout verification of the {WE} {DSP32} digital signal processor},
  journal      = {{IEEE} Des. Test},
  volume       = {6},
  number       = {1},
  pages        = {56--66},
  year         = {1989},
  url          = {https://doi.org/10.1109/54.20390},
  doi          = {10.1109/54.20390},
  timestamp    = {Mon, 01 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dt/BaysCFGHMS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccad/AgrawalRS88,
  author       = {Prathima Agrawal and
                  Scott H. Robinson and
                  Thomas G. Szymanski},
  title        = {Automatic modeling of switch-level networks using partial orders},
  booktitle    = {1988 {IEEE} International Conference on Computer-Aided Design, {ICCAD}
                  1988, Santa Clara, CA, USA, November 7-10, 1988. Digest of Technical
                  Papers},
  pages        = {350--353},
  publisher    = {{IEEE} Computer Society},
  year         = {1988},
  url          = {https://doi.org/10.1109/ICCAD.1988.122526},
  doi          = {10.1109/ICCAD.1988.122526},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iccad/AgrawalRS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dt/SzymanskiW85,
  author       = {Thomas G. Szymanski and
                  Christopher J. Van Wyk},
  title        = {Goalie: {A} Space Efficient System for {VLSI} Artwork Analysis},
  journal      = {{IEEE} Des. Test},
  volume       = {2},
  number       = {3},
  pages        = {64--72},
  year         = {1985},
  url          = {https://doi.org/10.1109/MDT.1985.294742},
  doi          = {10.1109/MDT.1985.294742},
  timestamp    = {Fri, 05 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dt/SzymanskiW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Szymanski85,
  author       = {Thomas G. Szymanski},
  title        = {Hash Table Reorganization},
  journal      = {J. Algorithms},
  volume       = {6},
  number       = {3},
  pages        = {322--335},
  year         = {1985},
  url          = {https://doi.org/10.1016/0196-6774(85)90002-1},
  doi          = {10.1016/0196-6774(85)90002-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Szymanski85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/Szymanski85,
  author       = {Thomas G. Szymanski},
  title        = {Dogleg Channel Routing is NP-Complete},
  journal      = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
  volume       = {4},
  number       = {1},
  pages        = {31--41},
  year         = {1985},
  url          = {https://doi.org/10.1109/TCAD.1985.1270096},
  doi          = {10.1109/TCAD.1985.1270096},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcad/Szymanski85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dac/SzymanskiW83,
  author       = {Thomas G. Szymanski and
                  Christopher J. Van Wyk},
  editor       = {Charles E. Radke},
  title        = {Space efficient algorithms for {VLSI} artwork analysis},
  booktitle    = {Proceedings of the 20th Design Automation Conference, {DAC} '83, Miami
                  Beach, Florida, USA, June 27-29, 1983},
  pages        = {734--739},
  publisher    = {{ACM/IEEE}},
  year         = {1983},
  url          = {http://dl.acm.org/citation.cfm?id=800754},
  timestamp    = {Wed, 29 Mar 2017 16:45:25 +0200},
  biburl       = {https://dblp.org/rec/conf/dac/SzymanskiW83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StorerS82,
  author       = {James A. Storer and
                  Thomas G. Szymanski},
  title        = {Data compression via textual substitution},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {928--951},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322346},
  doi          = {10.1145/322344.322346},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/StorerS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SedgewickSY82,
  author       = {Robert Sedgewick and
                  Thomas G. Szymanski and
                  Andrew Chi{-}Chih Yao},
  title        = {The Complexity of Finding Cycles in Periodic Functions},
  journal      = {{SIAM} J. Comput.},
  volume       = {11},
  number       = {2},
  pages        = {376--390},
  year         = {1982},
  url          = {https://doi.org/10.1137/0211030},
  doi          = {10.1137/0211030},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SedgewickSY82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AhoSSU81,
  author       = {Alfred V. Aho and
                  Yehoshua Sagiv and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Inferring a Tree from Lowest Common Ancestors with an Application
                  to the Optimization of Relational Expressions},
  journal      = {{SIAM} J. Comput.},
  volume       = {10},
  number       = {3},
  pages        = {405--421},
  year         = {1981},
  url          = {https://doi.org/10.1137/0210030},
  doi          = {10.1137/0210030},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AhoSSU81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/LeverettS80,
  author       = {Bruce W. Leverett and
                  Thomas G. Szymanski},
  title        = {Chaining Span-Dependent Jump Instructions},
  journal      = {{ACM} Trans. Program. Lang. Syst.},
  volume       = {2},
  number       = {3},
  pages        = {274--289},
  year         = {1980},
  url          = {https://doi.org/10.1145/357103.357105},
  doi          = {10.1145/357103.357105},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toplas/LeverettS80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SedgewickS79,
  author       = {Robert Sedgewick and
                  Thomas G. Szymanski},
  editor       = {Michael J. Fischer and
                  Richard A. DeMillo and
                  Nancy A. Lynch and
                  Walter A. Burkhard and
                  Alfred V. Aho},
  title        = {The Complexity of Finding Periods},
  booktitle    = {Proceedings of the 11h Annual {ACM} Symposium on Theory of Computing,
                  April 30 - May 2, 1979, Atlanta, Georgia, {USA}},
  pages        = {74--80},
  publisher    = {{ACM}},
  year         = {1979},
  url          = {https://doi.org/10.1145/800135.804400},
  doi          = {10.1145/800135.804400},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/SedgewickS79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Szymanski78,
  author       = {Thomas G. Szymanski},
  title        = {Assembling Code for Machines with Span-Dependent Instructions},
  journal      = {Commun. {ACM}},
  volume       = {21},
  number       = {4},
  pages        = {300--308},
  year         = {1978},
  url          = {https://doi.org/10.1145/359460.359474},
  doi          = {10.1145/359460.359474},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/Szymanski78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HuntS78,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski},
  title        = {Lower Bounds and Reductions Between Grammar Problems},
  journal      = {J. {ACM}},
  volume       = {25},
  number       = {1},
  pages        = {32--51},
  year         = {1978},
  url          = {https://doi.org/10.1145/322047.322051},
  doi          = {10.1145/322047.322051},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/HuntS78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HuntS78a,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski},
  title        = {Corrigendum: "Lower Bounds and Reductions Between Grammar Problems"},
  journal      = {J. {ACM}},
  volume       = {25},
  number       = {4},
  pages        = {687--688},
  year         = {1978},
  url          = {https://doi.org/10.1145/322092.322107},
  doi          = {10.1145/322092.322107},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/HuntS78a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/StorerS78,
  author       = {James A. Storer and
                  Thomas G. Szymanski},
  editor       = {Richard J. Lipton and
                  Walter A. Burkhard and
                  Walter J. Savitch and
                  Emily P. Friedman and
                  Alfred V. Aho},
  title        = {The Macro Model for Data Compression (Extended Abstract)},
  booktitle    = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
                  May 1-3, 1978, San Diego, California, {USA}},
  pages        = {30--39},
  publisher    = {{ACM}},
  year         = {1978},
  url          = {https://doi.org/10.1145/800133.804329},
  doi          = {10.1145/800133.804329},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/StorerS78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/popl/1978,
  editor       = {Alfred V. Aho and
                  Stephen N. Zilles and
                  Thomas G. Szymanski},
  title        = {Conference Record of the Fifth Annual {ACM} Symposium on Principles
                  of Programming Languages, Tucson, Arizona, USA, January 1978},
  publisher    = {{ACM} Press},
  year         = {1978},
  url          = {http://dl.acm.org/citation.cfm?id=512760},
  timestamp    = {Mon, 21 May 2012 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/popl/1978.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/HuntSU77,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Operations on Sparse Relations},
  journal      = {Commun. {ACM}},
  volume       = {20},
  number       = {3},
  pages        = {171--176},
  year         = {1977},
  url          = {https://doi.org/10.1145/359436.359446},
  doi          = {10.1145/359436.359446},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/HuntSU77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/HuntS77,
  author       = {James W. Hunt and
                  Thomas G. Szymanski},
  title        = {A Fast Algorithm for Computing Longest Subsequences},
  journal      = {Commun. {ACM}},
  volume       = {20},
  number       = {5},
  pages        = {350--353},
  year         = {1977},
  url          = {https://doi.org/10.1145/359581.359603},
  doi          = {10.1145/359581.359603},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/HuntS77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SzymanskiU77,
  author       = {Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Evaluating Relational Expressions with Dense and Sparse Arguments},
  journal      = {{SIAM} J. Comput.},
  volume       = {6},
  number       = {1},
  pages        = {109--122},
  year         = {1977},
  url          = {https://doi.org/10.1137/0206009},
  doi          = {10.1137/0206009},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SzymanskiU77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchmidtS77,
  author       = {Erik Meineche Schmidt and
                  Thomas G. Szymanski},
  title        = {Succinctness of Descriptions of Unambiguous Context-Free Languages},
  journal      = {{SIAM} J. Comput.},
  volume       = {6},
  number       = {3},
  pages        = {547--553},
  year         = {1977},
  url          = {https://doi.org/10.1137/0206039},
  doi          = {10.1137/0206039},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SchmidtS77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GellerHSU77,
  author       = {Matthew M. Geller and
                  Harry B. Hunt III and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Economy of Description by Parsers, DPDA'S, and PDA'S},
  journal      = {Theor. Comput. Sci.},
  volume       = {4},
  number       = {2},
  pages        = {143--153},
  year         = {1977},
  url          = {https://doi.org/10.1016/0304-3975(77)90033-0},
  doi          = {10.1016/0304-3975(77)90033-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GellerHSU77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HuntRS76,
  author       = {Harry B. Hunt III and
                  Daniel J. Rosenkrantz and
                  Thomas G. Szymanski},
  title        = {On the Equivalence, Containment, and Covering Problems for the Regular
                  and Context-Free Languages},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {12},
  number       = {2},
  pages        = {222--268},
  year         = {1976},
  url          = {https://doi.org/10.1016/S0022-0000(76)80038-4},
  doi          = {10.1016/S0022-0000(76)80038-4},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/HuntRS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HuntS76,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski},
  title        = {Complexity Metatheorems for Context-Free Grammar Problems},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {13},
  number       = {3},
  pages        = {318--334},
  year         = {1976},
  url          = {https://doi.org/10.1016/S0022-0000(76)80044-X},
  doi          = {10.1016/S0022-0000(76)80044-X},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/HuntS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SzymanskiW76,
  author       = {Thomas G. Szymanski and
                  John H. Williams},
  title        = {Noncanonical Extensions of Bottom-Up Parsing Techniques},
  journal      = {{SIAM} J. Comput.},
  volume       = {5},
  number       = {2},
  pages        = {231--250},
  year         = {1976},
  url          = {https://doi.org/10.1137/0205019},
  doi          = {10.1137/0205019},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SzymanskiW76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuntRS76,
  author       = {Harry B. Hunt III and
                  Daniel J. Rosenkrantz and
                  Thomas G. Szymanski},
  title        = {The Covering Problem for Linear Context-Free Grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {2},
  number       = {3},
  pages        = {361--382},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90088-8},
  doi          = {10.1016/0304-3975(76)90088-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HuntRS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Szymanski76,
  author       = {Thomas G. Szymanski},
  title        = {Concerning Bounded-Right-Context Grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {3},
  number       = {3},
  pages        = {273--282},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90046-3},
  doi          = {10.1016/0304-3975(76)90046-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Szymanski76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuntS76,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski},
  editor       = {Ashok K. Chandra and
                  Detlef Wotschke and
                  Emily P. Friedman and
                  Michael A. Harrison},
  title        = {Dichotomization, Reachability, and the Forbidden Subgraph Problem
                  (Extended Abstract)},
  booktitle    = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing,
                  May 3-5, 1976, Hershey, Pennsylvania, {USA}},
  pages        = {126--134},
  publisher    = {{ACM}},
  year         = {1976},
  url          = {https://doi.org/10.1145/800113.803640},
  doi          = {10.1145/800113.803640},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HuntS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/HuntSU75,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {On the Complexity of LR(k) Testing},
  journal      = {Commun. {ACM}},
  volume       = {18},
  number       = {12},
  pages        = {707--716},
  year         = {1975},
  url          = {https://doi.org/10.1145/361227.361232},
  doi          = {10.1145/361227.361232},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/HuntSU75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SzymanskiU75,
  author       = {Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Evaluating Relational Expressions with Dense and Sparse Arguments},
  booktitle    = {16th Annual Symposium on Foundations of Computer Science, Berkeley,
                  California, USA, October 13-15, 1975},
  pages        = {90--97},
  publisher    = {{IEEE} Computer Society},
  year         = {1975},
  url          = {https://doi.org/10.1109/SFCS.1975.13},
  doi          = {10.1109/SFCS.1975.13},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/SzymanskiU75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GellerHSU75,
  author       = {Matthew M. Geller and
                  Harry B. Hunt III and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Economy of Descriptions by Parsers, DPDA's, and PDA's},
  booktitle    = {16th Annual Symposium on Foundations of Computer Science, Berkeley,
                  California, USA, October 13-15, 1975},
  pages        = {122--127},
  publisher    = {{IEEE} Computer Society},
  year         = {1975},
  url          = {https://doi.org/10.1109/SFCS.1975.12},
  doi          = {10.1109/SFCS.1975.12},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GellerHSU75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/HuntSU75,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  editor       = {Robert M. Graham and
                  Michael A. Harrison and
                  John C. Reynolds},
  title        = {On the Complexity of LR(k) Testing},
  booktitle    = {Conference Record of the Second {ACM} Symposium on Principles of Programming
                  Languages, Palo Alto, California, USA, January 1975},
  pages        = {130--136},
  publisher    = {{ACM} Press},
  year         = {1975},
  url          = {https://doi.org/10.1145/512976.512990},
  doi          = {10.1145/512976.512990},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/popl/HuntSU75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuntS75,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski},
  editor       = {William C. Rounds and
                  Nancy Martin and
                  Jack W. Carlyle and
                  Michael A. Harrison},
  title        = {On the Complexity of Grammar and Related Problems},
  booktitle    = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing,
                  May 5-7, 1975, Albuquerque, New Mexico, {USA}},
  pages        = {54--65},
  publisher    = {{ACM}},
  year         = {1975},
  url          = {https://doi.org/10.1145/800116.803753},
  doi          = {10.1145/800116.803753},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HuntS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuntSU74,
  author       = {Harry B. Hunt III and
                  Thomas G. Szymanski and
                  Jeffrey D. Ullman},
  title        = {Operations on Sparse Relations and Efficient Algorithms for Grammar
                  Problems (Extended Abstract)},
  booktitle    = {15th Annual Symposium on Switching and Automata Theory, New Orleans,
                  Louisiana, USA, October 14-16, 1974},
  pages        = {127--132},
  publisher    = {{IEEE} Computer Society},
  year         = {1974},
  url          = {https://doi.org/10.1109/SWAT.1974.21},
  doi          = {10.1109/SWAT.1974.21},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HuntSU74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SzymanskiW73,
  author       = {Thomas G. Szymanski and
                  John H. Williams},
  title        = {Non-Canonical Parsing},
  booktitle    = {14th Annual Symposium on Switching and Automata Theory, Iowa City,
                  Iowa, USA, October 15-17, 1973},
  pages        = {122--129},
  publisher    = {{IEEE} Computer Society},
  year         = {1973},
  url          = {https://doi.org/10.1109/SWAT.1973.16},
  doi          = {10.1109/SWAT.1973.16},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/SzymanskiW73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrownGS72,
  author       = {Steven Brown and
                  David Gries and
                  Thomas G. Szymanski},
  title        = {Program Schemes with Pushdown Stores},
  journal      = {{SIAM} J. Comput.},
  volume       = {1},
  number       = {3},
  pages        = {242--268},
  year         = {1972},
  url          = {https://doi.org/10.1137/0201017},
  doi          = {10.1137/0201017},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BrownGS72.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics