( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On space-stretch trade-offs: lower bounds.

, , и . SPAA, стр. 207-216. ACM, (2006)

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

 

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

Towards plane spanners of degree 3., , , , , и . J. Comput. Geom., 8 (1): 11-31 (2017)Compact name-independent routing with minimum stretch., , , , и . ACM Trans. Algorithms, 4 (3): 37:1-37:12 (2008)Object location using path separators., и . PODC, стр. 188-197. ACM, (2006)A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract)., , и . SIROCCO, том 9439 из Lecture Notes in Computer Science, стр. 209-223. Springer, (2015)Improved Compact Routing Scheme for Chordal Graphs., и . DISC, том 2508 из Lecture Notes in Computer Science, стр. 252-264. Springer, (2002)On space-stretch trade-offs: upper bounds., , и . SPAA, стр. 217-224. ACM, (2006)Compact Routing Tables for Graphs of Bounded Genus., и . ICALP, том 1644 из Lecture Notes in Computer Science, стр. 351-360. Springer, (1999)Distributed Data Structures: A Survey on Informative Labeling Schemes.. MFCS, том 4162 из Lecture Notes in Computer Science, стр. 38. Springer, (2006)Optimal Distance Labeling for Interval and Circular-Arc Graphs., и . ESA, том 2832 из Lecture Notes in Computer Science, стр. 254-265. Springer, (2003)Distance Labeling for Permutation Graphs., и . Electron. Notes Discret. Math., (2005)