( en | de | ru )

 

Disambiguation of "Gasieniec, Leszek"

Author of the publication

copydeleteadd this publication to your clipboard
Work-time-optimal parallel algorithms for string problems.

, , , , and . STOC, page 713-722. ACM, (1995)

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.

Leszek Kalicki

Leszek Skrzypczak

Leszek Wieczorek

Leszek Wilkiewicz

Leszek Klimczak

 

Other publications of authors with the same name

Designing and Testing Temporally Connected Graphs., , , and . CoRR, (2015)Deterministic Computations on a PRAM with Static Processor and Memory Faults., , and . CoRR, (2018)Optimal Pattern Matching on Meshes., and . STACS, volume 775 of Lecture Notes in Computer Science, page 213-224. Springer, (1994)On Temporally Connected Graphs of Small Cost., , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 84-96. Springer, (2015)Towards the 5/6-Density Conjecture of Pinwheel Scheduling., , and . ALENEX, page 91-103. SIAM, (2022)A Randomized Algorithm for Gossiping in Radio Networks., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 483-492. Springer, (2001)The wake-up problem in multi-hop radio networks., , and . SODA, page 992-1000. SIAM, (2004)Deterministic Population Protocols for Exact Majority and Plurality., , , , and . OPODIS, volume 70 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Searching with Increasing Speeds., , and . SSS, volume 11201 of Lecture Notes in Computer Science, page 126-138. Springer, (2018)Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts., , and . MFCS, volume 1672 of Lecture Notes in Computer Science, page 48-58. Springer, (1999)