( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient web searching using temporal factors.

, , , , , , и . Theor. Comput. Sci., 262 (1): 569-582 (2001)

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.

Leszek Kalicki

Leszek Skrzypczak

Leszek Wieczorek

Leszek Urban

Leszek Wilkiewicz

 

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

Designing and Testing Temporally Connected Graphs., , , и . CoRR, (2015)Deterministic Computations on a PRAM with Static Processor and Memory Faults., , и . CoRR, (2018)The wake-up problem in multi-hop radio networks., , и . SODA, стр. 992-1000. SIAM, (2004)Deterministic Population Protocols for Exact Majority and Plurality., , , , и . OPODIS, том 70 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts., , и . MFCS, том 1672 из Lecture Notes in Computer Science, стр. 48-58. Springer, (1999)A Randomized Algorithm for Gossiping in Radio Networks., , и . COCOON, том 2108 из Lecture Notes in Computer Science, стр. 483-492. Springer, (2001)Fast Periodic Graph Exploration with Constant Memory., , , , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 26-40. Springer, (2007)Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes., , , и . PODC, стр. 4-13. ACM, (2019)Optimal Pattern Matching on Meshes., и . STACS, том 775 из Lecture Notes in Computer Science, стр. 213-224. Springer, (1994)On Temporally Connected Graphs of Small Cost., , , и . WAOA, том 9499 из Lecture Notes in Computer Science, стр. 84-96. Springer, (2015)