default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas G. Szymanski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[c14]Soumitra Bose, Vishwani D. Agrawal, Thomas G. Szymanski:
Algorithms for Switch Level Delay Fault Simulation. ITC 1997: 982-991- 1992
- [c13]Thomas G. Szymanski:
Computing Optimal Clock Schedules. DAC 1992: 399-404 - [c12]Thomas G. Szymanski, Narendra V. Shenoy:
Verifying clock schedules. ICCAD 1992: 124-131 - 1990
- [j24]Prathima Agrawal, Scott H. Robinson, Thomas G. Szymanski:
Automatic modeling of switch-level networks using partial orders [MOS circuits]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(7): 696-707 (1990)
1980 – 1989
- 1989
- [j23]Laurence E. Bays, Chin-Fu Chen, Evelyn M. Fields, Renato N. Gadenz, W. Patrick Hays, Howard S. Moscovitz, Thomas G. Szymanski:
Post-layout verification of the WE DSP32 digital signal processor. IEEE Des. Test 6(1): 56-66 (1989) - 1988
- [c11]Prathima Agrawal, Scott H. Robinson, Thomas G. Szymanski:
Automatic modeling of switch-level networks using partial orders. ICCAD 1988: 350-353 - 1985
- [j22]Thomas G. Szymanski, Christopher J. Van Wyk:
Goalie: A Space Efficient System for VLSI Artwork Analysis. IEEE Des. Test 2(3): 64-72 (1985) - [j21]Thomas G. Szymanski:
Hash Table Reorganization. J. Algorithms 6(3): 322-335 (1985) - [j20]Thomas G. Szymanski:
Dogleg Channel Routing is NP-Complete. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4(1): 31-41 (1985) - 1983
- [c10]Thomas G. Szymanski, Christopher J. Van Wyk:
Space efficient algorithms for VLSI artwork analysis. DAC 1983: 734-739 - 1982
- [j19]James A. Storer, Thomas G. Szymanski:
Data compression via textual substitution. J. ACM 29(4): 928-951 (1982) - [j18]Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao:
The Complexity of Finding Cycles in Periodic Functions. SIAM J. Comput. 11(2): 376-390 (1982) - 1981
- [j17]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. SIAM J. Comput. 10(3): 405-421 (1981) - 1980
- [j16]Bruce W. Leverett, Thomas G. Szymanski:
Chaining Span-Dependent Jump Instructions. ACM Trans. Program. Lang. Syst. 2(3): 274-289 (1980)
1970 – 1979
- 1979
- [c9]Robert Sedgewick, Thomas G. Szymanski:
The Complexity of Finding Periods. STOC 1979: 74-80 - 1978
- [j15]Thomas G. Szymanski:
Assembling Code for Machines with Span-Dependent Instructions. Commun. ACM 21(4): 300-308 (1978) - [j14]Harry B. Hunt III, Thomas G. Szymanski:
Lower Bounds and Reductions Between Grammar Problems. J. ACM 25(1): 32-51 (1978) - [j13]Harry B. Hunt III, Thomas G. Szymanski:
Corrigendum: "Lower Bounds and Reductions Between Grammar Problems". J. ACM 25(4): 687-688 (1978) - [c8]James A. Storer, Thomas G. Szymanski:
The Macro Model for Data Compression (Extended Abstract). STOC 1978: 30-39 - [e1]Alfred V. Aho, Stephen N. Zilles, Thomas G. Szymanski:
Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978. ACM Press 1978 [contents] - 1977
- [j12]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations. Commun. ACM 20(3): 171-176 (1977) - [j11]James W. Hunt, Thomas G. Szymanski:
A Fast Algorithm for Computing Longest Subsequences. Commun. ACM 20(5): 350-353 (1977) - [j10]Thomas G. Szymanski, Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments. SIAM J. Comput. 6(1): 109-122 (1977) - [j9]Erik Meineche Schmidt, Thomas G. Szymanski:
Succinctness of Descriptions of Unambiguous Context-Free Languages. SIAM J. Comput. 6(3): 547-553 (1977) - [j8]Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Economy of Description by Parsers, DPDA'S, and PDA'S. Theor. Comput. Sci. 4(2): 143-153 (1977) - 1976
- [j7]Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski:
On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. J. Comput. Syst. Sci. 12(2): 222-268 (1976) - [j6]Harry B. Hunt III, Thomas G. Szymanski:
Complexity Metatheorems for Context-Free Grammar Problems. J. Comput. Syst. Sci. 13(3): 318-334 (1976) - [j5]Thomas G. Szymanski, John H. Williams:
Noncanonical Extensions of Bottom-Up Parsing Techniques. SIAM J. Comput. 5(2): 231-250 (1976) - [j4]Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski:
The Covering Problem for Linear Context-Free Grammars. Theor. Comput. Sci. 2(3): 361-382 (1976) - [j3]Thomas G. Szymanski:
Concerning Bounded-Right-Context Grammars. Theor. Comput. Sci. 3(3): 273-282 (1976) - [c7]Harry B. Hunt III, Thomas G. Szymanski:
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract). STOC 1976: 126-134 - 1975
- [j2]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
On the Complexity of LR(k) Testing. Commun. ACM 18(12): 707-716 (1975) - [c6]Thomas G. Szymanski, Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments. FOCS 1975: 90-97 - [c5]Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Economy of Descriptions by Parsers, DPDA's, and PDA's. FOCS 1975: 122-127 - [c4]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
On the Complexity of LR(k) Testing. POPL 1975: 130-136 - [c3]Harry B. Hunt III, Thomas G. Szymanski:
On the Complexity of Grammar and Related Problems. STOC 1975: 54-65 - 1974
- [c2]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract). SWAT 1974: 127-132 - 1973
- [c1]Thomas G. Szymanski, John H. Williams:
Non-Canonical Parsing. SWAT 1973: 122-129 - 1972
- [j1]Steven Brown, David Gries, Thomas G. Szymanski:
Program Schemes with Pushdown Stores. SIAM J. Comput. 1(3): 242-268 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
