From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Efficient Resolution of Singularities of Plane Curves.

D. Kozen. FSTTCS, том 880 из Lecture Notes in Computer Science, стр. 1-11. Springer, (1994)

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.

Theory of Computation.D. Kozen. Texts in Computer Science Springer, (2006)Practical coinduction.D. Kozen, и A. Silva. Math. Struct. Comput. Sci., 27 (7): 1132-1152 (2017)The Ackermann Award 2015.A. Dawar, D. Kozen, и S. Rocca. CSL, том 41 из LIPIcs, стр. xv-xviii. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Complexity of Set Constraints.A. Aiken, D. Kozen, M. Vardi, и E. Wimmers. CSL, том 832 из Lecture Notes in Computer Science, стр. 1-17. Springer, (1993)Scalable verification of probabilistic networks.S. Smolka, P. Kumar, D. Kahn, N. Foster, J. Hsu, D. Kozen, и A. Silva. PLDI, стр. 190-203. ACM, (2019)A note on the complexity of propositional Hoare logic.E. Cohen, и D. Kozen. ACM Trans. Comput. Log., 1 (1): 171-174 (2000)The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)M. Ben-Or, D. Kozen, и J. Reif. STOC, стр. 457-464. ACM, (1984)Automating Proofs in Category Theory.D. Kozen, C. Kreitz, и E. Richter. IJCAR, том 4130 из Lecture Notes in Computer Science, стр. 392-407. Springer, (2006)Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time.S. Smolka, N. Foster, J. Hsu, T. Kappé, D. Kozen, и A. Silva. Proc. ACM Program. Lang., 4 (POPL): 61:1-61:28 (2020)Complexity of Boolean Algebras.D. Kozen. Theor. Comput. Sci., (1980)