( en | de | ru )

 

Disambiguation of "Szymanski, Thomas G."

Author of the publication

copydeleteadd this publication to your clipboard
The Covering Problem for Linear Context-Free Grammars.

, , and . Theor. Comput. Sci., 2 (3): 361-382 (1976)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christian Szymanski

Tanja Szymanski

Anneliese Szymanski

Gerhard Szymanski

Daniel Szymanski

 

Other publications of authors with the same name

Assembling Code for Machines with Span-Dependent Instructions.. Commun. ACM, 21 (4): 300-308 (1978)The Complexity of Finding Periods, and . STOC, page 74-80. ACM, (1979)Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract), , and . SWAT, page 127-132. IEEE Computer Society, (1974)Succinctness of Descriptions of Unambiguous Context-Free Languages., and . SIAM J. Comput., 6 (3): 547-553 (1977)Hash Table Reorganization.. J. Algorithms, 6 (3): 322-335 (1985)Dogleg Channel Routing is NP-Complete.. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 4 (1): 31-41 (1985)The Covering Problem for Linear Context-Free Grammars., , and . Theor. Comput. Sci., 2 (3): 361-382 (1976)Complexity Metatheorems for Context-Free Grammar Problems., and . J. Comput. Syst. Sci., 13 (3): 318-334 (1976)The Macro Model for Data Compression (Extended Abstract), and . STOC, page 30-39. ACM, (1978)Chaining Span-Dependent Jump Instructions., and . ACM Trans. Program. Lang. Syst., 2 (3): 274-289 (1980)