( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Covering Problem for Linear Context-Free Grammars.

, , и . 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.

Christian Szymanski

Tanja Szymanski

Gerhard Szymanski

Peter Szymanski

Anneliese Szymanski

 

Другие публикации лиц с тем же именем

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