( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing.

, , и . Electron. Colloquium Comput. Complex., (2013)

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.

Mihalis Nicolaou

 

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

Linear Approximation of Shortest Superstrings, , , , и . STOC, стр. 328-336. ACM, (1991)Issues of Correctness in Database Concurrency Control by Locking. STOC, стр. 363-367. ACM, (1981)Deadlock-Freedom (and Safety) of Transactions in a Distributed Database., и . PODS, стр. 105-112. ACM, (1985)A Theory of Safe Locking Policies in Database Systems.. J. ACM, 29 (3): 718-740 (1982)Node- and Edge-Deletion NP-Complete Problems. STOC, стр. 253-264. ACM, (1978)Multiobjective Query Optimization., и . PODS, ACM, (2001)Probability and Recursion., и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 2-4. Springer, (2005)Adaptive Model Checking., , и . TACAS, том 2280 из Lecture Notes in Computer Science, стр. 357-370. Springer, (2002)The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract)., и . ICALP, том 71 из Lecture Notes in Computer Science, стр. 460-470. Springer, (1979)Recursive Concurrent Stochastic Games., и . ICALP (2), том 4052 из Lecture Notes in Computer Science, стр. 324-335. Springer, (2006)