( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of LR(k) Testing.

, , и . POPL, стр. 130-136. ACM Press, (1975)

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

Anneliese Szymanski

Gerhard Szymanski

Daniel Szymanski

 

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

On the Complexity of Grammar and Related Problems, и . STOC, стр. 54-65. ACM, (1975)On the Complexity of LR(k) Testing., , и . POPL, стр. 130-136. ACM Press, (1975)Algorithms for Switch Level Delay Fault Simulation., , и . ITC, стр. 982-991. IEEE Computer Society, (1997)Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract), , и . SWAT, стр. 127-132. IEEE Computer Society, (1974)Succinctness of Descriptions of Unambiguous Context-Free Languages., и . SIAM J. Comput., 6 (3): 547-553 (1977)The Complexity of Finding Periods, и . STOC, стр. 74-80. ACM, (1979)Space efficient algorithms for VLSI artwork analysis., и . DAC, стр. 734-739. ACM/IEEE, (1983)Computing Optimal Clock Schedules.. DAC, стр. 399-404. IEEE Computer Society Press, (1992)The Macro Model for Data Compression (Extended Abstract), и . STOC, стр. 30-39. ACM, (1978)Verifying clock schedules., и . ICCAD, стр. 124-131. IEEE Computer Society / ACM, (1992)