( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simpler, faster and shorter labels for distances in graphs.

, , , и . SODA, стр. 338-350. SIAM, (2016)

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.

Holger Petersen

Holger Petersen

Holger Petersen

Holger Petersen

Holger Petersen

 

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

Complexity Results for Prefix Grammars.. DCFS, стр. 295-302. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)LIKE Patterns and Complexity.. COCOON, том 11653 из Lecture Notes in Computer Science, стр. 469-477. Springer, (2019)Dyck1-Reductions of Context-free Languages., , , и . FCT, том 278 из Lecture Notes in Computer Science, стр. 218-227. Springer, (1987)How to Convert any Digital Signature Scheme into a Group Signature Scheme.. Security Protocols Workshop, том 1361 из Lecture Notes in Computer Science, стр. 177-190. Springer, (1997)Fooling Rebound Automata.. MFCS, том 1672 из Lecture Notes in Computer Science, стр. 241-250. Springer, (1999)The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses.. MFCS, том 1450 из Lecture Notes in Computer Science, стр. 296-304. Springer, (1998)Bounded Counter Languages.. DCFS, том 7386 из Lecture Notes in Computer Science, стр. 266-279. Springer, (2012)Automata with Sensing Heads.. ISTCS, стр. 150-157. IEEE Computer Society, (1995)Simpler, faster and shorter labels for distances in graphs., , , и . SODA, стр. 338-350. SIAM, (2016)Prefix Rewriting and Descriptional Complexity.. Journal of Automata, Languages and Combinatorics, 5 (3): 245-254 (2000)