The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas G. Szymanski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002