( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tricolorable torus knots are NP-complete.

, , , , и . ACM Southeast Regional Conference, ACM, (2009)

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.

Aleksandar Radoni

Einfluss des humanen Herpesvirus-6 auf die Expression Apoptose- und Zellzyklus-relevanter Gene. HU Berlin, (2009)

Aleksandar Putic

Aleksandar Jankovic

Aleksandar Tuci

Aleksandar Vasilevski

 

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

Combining Time and Frequency Domain Specifications for Periodic Signals., , и . RV, том 7186 из Lecture Notes in Computer Science, стр. 294-309. Springer, (2011)Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three., , и . IWOCA, том 6460 из Lecture Notes in Computer Science, стр. 43-55. Springer, (2010)Better Counterexamples for Dafny., , , и . TACAS (1), том 13243 из Lecture Notes in Computer Science, стр. 404-411. Springer, (2022)Static analysis for probabilistic programs: inferring whole program properties from finitely many paths., , и . PLDI, стр. 447-458. ACM, (2013)Probabilistic Program Analysis with Martingales., и . CAV, том 8044 из Lecture Notes in Computer Science, стр. 511-526. Springer, (2013)Tricolorable torus knots are NP-complete., , , , и . ACM Southeast Regional Conference, ACM, (2009)Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference., , , и . ICSE, стр. 1165-1168. IEEE Computer Society, (2013)Deductive Proofs of Almost Sure Persistence and Recurrence Properties., , и . TACAS, том 9636 из Lecture Notes in Computer Science, стр. 260-279. Springer, (2016)Expectation Invariants for Probabilistic Program Loops as Fixed Points., и . SAS, том 8723 из Lecture Notes in Computer Science, стр. 85-100. Springer, (2014)Recurrent Partial Words and Representable Sets., , , , , , и . Journal of Automata, Languages and Combinatorics, 21 (3): 149-181 (2016)