Extended Extremes of Information Combining - Lucas Boczkowski (CoRR, 2012)

Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages. - Lucas Boczkowski; Amos Korman; Emanuele Natale (PODC, 2016)

Self-Stabilizing Clock Synchronization with 3-bit messages. - Lucas Boczkowski; Amos Korman; Emanuele Natale (CoRR, 2016)

Searching on Trees with Noisy Memory. - Lucas Boczkowski; Amos Korman; Yoav Rodeh (CoRR, 2016)

Streaming Communication Protocols. - Lucas Boczkowski; Iordanis Kerenidis; Frédéric Magniez (Electron. Colloquium Comput. Complex., 2016)

Searching a Tree with Permanently Noisy Advice. - Lucas Boczkowski; Amos Korman; Yoav Rodeh (ESA, 2018)

Limits for Rumor Spreading in Stochastic Populations. - Lucas Boczkowski; Ofer Feinerman; Amos Korman; Emanuele Natale (ITCS, 2018)

Random Walks with Multiple Step Lengths. - Lucas Boczkowski; Brieuc Guinard; Amos Korman; Zvi Lotker; Marc P. Renault (LATIN, 2018)

Limits on reliable information flows through stochastic populations. - Lucas Boczkowski; Emanuele Natale; Ofer Feinerman; Amos Korman (PLoS Comput. Biol., 2018)

Sensitivity of Mixing Times in Eulerian Digraphs. - Lucas Boczkowski; Yuval Peres; Perla Sousi (SIAM J. Discret. Math., 2018)

Search and broadcast in stochastic environments, a biological perspective. (Recherche et diffusion d'informations dans un environnement bruité, une perspective biologique). - Lucas Boczkowski (2018)

Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. - Lucas Boczkowski; Amos Korman; Emanuele Natale (Distributed Comput., 2019)

Navigating in Trees with Permanently Noisy Advice. - Lucas Boczkowski; Uriel Feige; Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2021)

On mappings on the hypercube with small average stretch. - Lucas Boczkowski; Igor Shinkar (Comb. Probab. Comput., 2023)

The Query Complexity of Searching Trees with Permanently Noisy Advice. - Lucas Boczkowski; Uriel Feige; Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2025)