BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
7 × USA
Collaborated with:
H.B.H.III C.J.V.Wyk R.Sedgewick J.A.Storer J.D.Ullman
Talks about:
complex (3) problem (2) forbidden (1) algorithm (1) subgraph (1) reachabl (1) dichotom (1) compress (1) schedul (1) grammar (1)

Person: Thomas G. Szymanski

DBLP DBLP: Szymanski:Thomas_G=

Facilitated 1 volumes:

POPL 1978Ed

Contributed to:

DAC 19921992
DAC 19831983
STOC 19791979
STOC 19781978
STOC 19761976
POPL 19751975
STOC 19751975

Wrote 7 papers:

Computing Optimal Clock Schedules (TGS), pp. 399–404.
DAC-1983-SzymanskiW #algorithm #analysis #performance
Space efficient algorithms for VLSI artwork analysis (TGS, CJVW), pp. 734–739.
STOC-1979-SedgewickS #complexity
The Complexity of Finding Periods (RS, TGS), pp. 74–80.
STOC-1978-StorerS #metaprogramming
The Macro Model for Data Compression (JAS, TGS), pp. 30–39.
STOC-1976-HuntS #problem #reachability
Dichotomization, Reachability, and the Forbidden Subgraph Problem (HBHI, TGS), pp. 126–134.
POPL-1975-HuntSU #complexity #lr #on the #testing
On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.
STOC-1975-HuntS #complexity #on the #problem
On the Complexity of Grammar and Related Problems (HBHI, TGS), pp. 54–65.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.