Thomas G. Szymanski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

1997

Algorithms for Switch Level Delay Fault SimulationSoumitra Bose, Vishwani D. Agrawal, Thomas G. Szymanski. itc 1997: 982-991

1992

Computing Optimal Clock SchedulesThomas G. Szymanski. dac 1992: 399-404 [doi]

Verifying clock schedulesThomas G. Szymanski, Narendra V. Shenoy. iccad 1992: 124-131 [doi]

1990

Automatic modeling of switch-level networks using partial orders [MOS circuits]Prathima Agrawal, Scott H. Robinson, Thomas G. Szymanski. tcad, 9(7):696-707, 1990. [doi]

1989

Post-layout verification of the WE DSP32 digital signal processorLaurence E. Bays, Chin-Fu Chen, Evelyn M. Fields, Renato N. Gadenz, W. Patrick Hays, Howard S. Moscovitz, Thomas G. Szymanski. dt, 6(1):56-66, 1989. [doi]

1988

Automatic modeling of switch-level networks using partial ordersPrathima Agrawal, Scott H. Robinson, Thomas G. Szymanski. iccad 1988: 350-353 [doi]

1985

Dogleg Channel Routing is NP-CompleteThomas G. Szymanski. tcad, 4(1):31-41, 1985. [doi]

Hash Table ReorganizationThomas G. Szymanski. jal, 6(3):322-335, 1985.

Goalie: A Space Efficient System for VLSI Artwork AnalysisThomas G. Szymanski, Christopher J. Van Wyk. dt, 2(3):64-72, 1985. [doi]

1983

Space efficient algorithms for VLSI artwork analysisThomas G. Szymanski, Christopher J. Van Wyk. dac 1983: 734-739 [doi]

1982

The Complexity of Finding Cycles in Periodic FunctionsRobert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao. SICOMP, 11(2):376-390, 1982.

Data compression via textural substitutionJames A. Storer, Thomas G. Szymanski. JACM, 29(4):928-951, 1982. [doi]

1981

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsAlfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman. SICOMP, 10(3):405-421, 1981.

1980

Chaining Span-Dependent Jump InstructionsBruce W. Leverett, Thomas G. Szymanski. TOPLAS, 2(3):274-289, 1980. [doi]

1979

The Complexity of Finding PeriodsRobert Sedgewick, Thomas G. Szymanski. stoc 1979: 74-80

1978

Lower Bounds and Reductions Between Grammar ProblemsHarry B. Hunt III, Thomas G. Szymanski. JACM, 25(1):32-51, 1978. [doi]

Corrigendum: Lower Bounds and Reductions Between Grammar Problems Harry B. Hunt III, Thomas G. Szymanski. JACM, 25(4):687-688, 1978. [doi]

The Macro Model for Data Compression (Extended Abstract)James A. Storer, Thomas G. Szymanski. stoc 1978: 30-39

Assembling Code for Machines with Span-Dependent InstructionsThomas G. Szymanski. CACM, 21(4):300-308, 1978.

1977

Economy of Description by Parsers, DPDA S, and PDA SMatthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. TCS, 4(2):143-153, 1977.

A Fast Algorithm for Computing Longest SubsequencesJames W. Hunt, Thomas G. Szymanski. CACM, 20(5):350-353, 1977.

Operations on Sparse RelationsHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. CACM, 20(3):171-176, 1977.

Succinctness of Descriptions of Unambiguous Context-Free LanguagesErik Meineche Schmidt, Thomas G. Szymanski. SICOMP, 6(3):547-553, 1977.

Evaluating Relational Expressions with Dense and Sparse ArgumentsThomas G. Szymanski, Jeffrey D. Ullman. SICOMP, 6(1):109-122, 1977.

1976

1975

1974

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. focs 1974: 127-132

1973

Non-Canonical ParsingThomas G. Szymanski, John H. Williams. focs 1973: 122-129

1972

Program Schemes with Pushdown StoresSteven Brown, David Gries, Thomas G. Szymanski. SICOMP, 1(3):242-268, 1972.

Sign in or sign up to see more results.

runs on WebDSL