( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Nearest common ancestors: a survey and a new distributed algorithm.

, , , и . SPAA, стр. 258-264. ACM, (2002)

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.

Cyril Bazin

Cyril Grouin

Cyril Mazauric

Cyril Cohen

Cyril Faucher

 

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

An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three., и . SIROCCO, стр. 162-175. Carleton Scientific, (1997)On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing., и . SIROCCO, том 2 из Proceedings in Informatics, стр. 113-121. Carleton Scientific, (1995)Interval Routing in Reliability Networks., и . SIROCCO, том 17 из Proceedings in Informatics, стр. 147-162. Carleton Scientific, (2003)Recognizing Bipartite Incident-Graphs of Circulant Digraphs., , и . WG, том 1665 из Lecture Notes in Computer Science, стр. 215-227. Springer, (1999)Localisation-Resistant Random Words with Small Alphabets., , и . WORDS, том 11682 из Lecture Notes in Computer Science, стр. 193-206. Springer, (2019)On the Treewidth of Planar Minor Free Graphs., и . InterSol, том 321 из Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, стр. 238-250. Springer, (2020)Localized and Compact Data-Structure for Comparability Graphs., и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 1122-1131. Springer, (2005)What Can Be Observed Locally?, , и . DISC, том 5805 из Lecture Notes in Computer Science, стр. 243-257. Springer, (2009)Simpler, faster and shorter labels for distances in graphs., , , и . SODA, стр. 338-350. SIAM, (2016)Strong-Diameter Decompositions of Minor Free Graphs., , , и . Theory Comput. Syst., 47 (4): 837-855 (2010)