Concepedia

Thomas G. Szymanski

TG

Statistics

Publications

28

Citations

2.9K

H-Index

20

Active since

1972

Affiliations

Princeton University(Current)

AT&T (United States)

Harvard University

Carnegie Mellon University

Nokia (United States)

Thomas G. Szymanski is an author at Princeton University specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityComputer EngineeringFormal MethodsComputer ArchitectureSyntaxGrammarLanguageLinguistics

Publications per year

1972–2003

28

Publications

28

A fast algorithm for computing longest common subsequences

James Hunt, Thomas G. Szymanski · Communications of the ACM · 1977 · 687 citations · Full text

Fast Algorithm, Engineering, String-searching Algorithm +10

Data compression via textual substitution

James A. Storer, Thomas G. Szymanski · Journal of the ACM · 1982 · 643 citations · Full text

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

A. V. Aho, Yehoshua Sagiv, Thomas G. Szymanski et al. · SIAM Journal on Computing · 1981 · 412 citations

Relational Database, Engineering, Computational Complexity +19

Dogleg Channel Routing is NP-Complete

Thomas G. Szymanski · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1985 · 197 citations

Mathematical Programming, Engineering, Network Routing +16

On the equivalence, containment, and covering problems for the regular and context-free languages

Harry B. Hunt, Daniel J. Rosenkrantz, Thomas G. Szymanski · Journal of Computer and System Sciences · 1976 · 134 citations

Combinatorics On Word, Engineering, Automated Reasoning +7

Rows per page

1–5 of 28