( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the complexity of protein folding (abstract).

, , , , и . RECOMB, стр. 61-62. ACM, (1998)

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

 

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

Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays., , , и . INFOCOM, стр. 2351-2360. IEEE, (2020)Searching a fixed graph, , и . Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 Paderborn, Germany, July 8--12, 1996 Proceedings 23, стр. 280--289. Springer, (1996)Joint Cyber and Physical Attacks on Power Grids: Graph Theoretical Approaches for Information Recovery., , и . SIGMETRICS, стр. 361-374. ACM, (2015)Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations., и . STACS, том 3404 из Lecture Notes in Computer Science, стр. 340-352. Springer, (2005)Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games., и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 634-645. Springer, (2006)Node- and Edge-Deletion NP-Complete Problems. STOC, стр. 253-264. ACM, (1978)Deadlock-Freedom (and Safety) of Transactions in a Distributed Database., и . PODS, стр. 105-112. ACM, (1985)Probability and Recursion., и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 2-4. Springer, (2005)Smoothed Complexity of SWAP in Local Graph Partitioning., , , и . CoRR, (2023)Smoothed complexity of local max-cut and binary max-CSP., , , , и . STOC, стр. 1052-1065. ACM, (2020)