( en | de | ru )

 

Disambiguation of "Michail, Othon"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Growing a Graph.

, , , , and . ALGOSENSORS, volume 13707 of Lecture Notes in Computer Science, page 123-137. Springer, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Othon Litke

Michail Logvinov

Michail Paschkowskij

Michail Bondartschuk

Michail Karpenko

 

Other publications of authors with the same name

Passively mobile communicating machines that use restricted space., , , , and . FOMC, page 6-15. ACM, (2011)Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata.. PODC, page 37-46. ACM, (2015)Mediated population protocols., , and . Theor. Comput. Sci., 412 (22): 2434-2450 (2011)Passively mobile communicating logarithmic space machines, , , , and . (2010)Brief Announcement: Decidable Graph Languages by Mediated Population Protocols., , and . DISC, volume 5805 of Lecture Notes in Computer Science, page 239-240. Springer, (2009)Recent Advances in Population Protocols., , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 56-76. Springer, (2009)Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes., and . ALGOSENSORS, volume 13707 of Lecture Notes in Computer Science, page 60-76. Springer, (2022)How Many Cooks Spoil the Soup?, and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 3-18. (2016)A Glimpse at Paul G. Spirakis., , , , , , and . Algorithms, Probability, Networks, and Games, volume 9295 of Lecture Notes in Computer Science, page 3-24. Springer, (2015)All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model., , , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 270-281. Springer, (2010)