| 2026 | PODC | Undecided State Dynamics with Many Opinions. | Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga |
| 2026 | SPAA | Brief Announcement: Discrete Incremental Voting - New Bounds for General Graphs and Expanders. | Petra Berenbrink, Colin Cooper, Thorsten Gtte, Lukas Hintze, Tomasz Radzik |
| 2025 | SODA | Asynchronous 3-Majority Dynamics with Many Opinions. | Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga |
| 2024 | WAW | A Simple Model of Influence: Details and Variants of Dynamics. | Colin Cooper, Nan Kang, Tomasz Radzik, Ngoc Vu |
| 2023 | OPODIS | Discrete Incremental Voting. | Colin Cooper, Tomasz Radzik, Takeharu Shiraga |
| 2023 | PODC | Distributed Averaging in Opinion Dynamics. | Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzago, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera |
| 2023 | PODC | Brief Announcement: Discrete Incremental Voting. | Colin Cooper, Tomasz Radzik, Takeharu Shiraga |
| 2023 | WAW | A Simple Model of Influence. | Colin Cooper, Nan Kang, Tomasz Radzik |
| 2022 | UAI | On early extinction and the effect of travelling in the SIR model. | Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzago, Frederik Mallmann-Trenn, Tomasz Radzik |
| 2019 | CIAC | Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. | Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak |
| 2019 | PODC | On Counting the Population Size. | Petra Berenbrink, Dominik Kaaser, Tomasz Radzik |
| 2018 | MFCS | Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. | Aris Pagourtzis, Tomasz Radzik |
| 2017 | PODC | Brief Announcement: Population Protocols for Leader Election and Exact Majority with | Andreas Bilke, Colin Cooper, Robert Elssser, Tomasz Radzik |
| 2017 | SPAA | Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. | Colin Cooper, Tomasz Radzik, Nicolas Rivera |
| 2017 | SOFSEM | Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). | Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik |
| 2016 | PODC | The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. | Colin Cooper, Tomasz Radzik, Nicolas Rivera |
| 2015 | SIROCCO | Coalescing Walks on Rotor-Router Systems. | Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga |
| 2014 | ICALP | The Power of Two Choices in Distributed Voting. | Colin Cooper, Robert Elssser, Tomasz Radzik |
| 2014 | PAAMS | Artificial Neural Networks in the Detection of Known and Unknown DDoS Attacks: Proof-of-Concept. | Alan Saied, Richard E. Overill, Tomasz Radzik |
| 2014 | WWW | Random walks in recommender systems: exact computation and simulations. | Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik, Yiannis Siantos |
| 2013 | IWOCA | Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks. | Sang-Hyuk Lee, Tomasz Radzik |
| 2013 | WAW | Fast Low-Cost Estimation of Network Properties Using Random Walks. | Colin Cooper, Tomasz Radzik, Yiannis Siantos |
| 2012 | PODC | Coalescing random walks and voting on graphs. | Colin Cooper, Robert Elssser, Hirotaka Ono, Tomasz Radzik |
| 2012 | WWW | A fast algorithm to find all high degree vertices in power law graphs. | Colin Cooper, Tomasz Radzik, Yiannis Siantos |
| 2012 | WAW | A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. | Colin Cooper, Tomasz Radzik, Yiannis Siantos |
| 2011 | SIROCCO | The Cover Times of Random Walks on Hypergraphs. | Colin Cooper, Alan M. Frieze, Tomasz Radzik |
| 2010 | IWOCA | The Cover Time of Cartesian Product Graphs. | Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik |
| 2010 | IWOCA | Efficient Connectivity Testing of Hypercubic Networks with Faults. | Toms Dvork, Jir Fink, Petr Gregor, Vclav Koubek, Tomasz Radzik |
| 2010 | SODA | Speeding Up Random Walks with Neighborhood Exploration. | Petra Berenbrink, Colin Cooper, Robert Elssser, Tomasz Radzik, Thomas Sauerwald |
| 2009 | ICALP | Multiple Random Walks and Interacting Particle Systems. | Colin Cooper, Alan M. Frieze, Tomasz Radzik |
| 2009 | OPODIS | Robustness of the Rotor-router Mechanism. | Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik |
| 2008 | SIROCCO | Locating and Repairing Faults in a Network with Mobile Agents. | Colin Cooper, Ralf Klasing, Tomasz Radzik |
| 2008 | WG | Memory Efficient Anonymous Graph Exploration. | Leszek Gasieniec, Tomasz Radzik |
| 2007 | SODA | Tree exploration with logarithmic memory. | Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang |
| 2006 | OPODIS | On Many-to-Many Communication in Packet Radio Networks. | Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik |
| 2006 | OPODIS | Searching for Black-Hole Faults in a Network Using Multiple Agents. | Colin Cooper, Ralf Klasing, Tomasz Radzik |
| 2005 | ICALP | On the Wake-Up Problem in Radio Networks. | Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik |
| 2005 | OPODIS | Approximation Bounds for Black Hole Search Problems. | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
| 2005 | SIROCCO | Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
| 2002 | ICALP | Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. | Tomasz Radzik |
| 1995 | SODA | Fast Deterministic Approximation for the Multicommodity Flow Problem. | Tomasz Radzik |
| 1994 | SODA | Shortest Paths Algorithms: Theory and Experimental Evaluation. | Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik |
| 1993 | FOCS | Faster Algorithms for the Generalized Network Flow Problem | Tomasz Radzik |
| 1992 | FOCS | Newton's Method for Fractional Combinatorial Optimization | Tomasz Radzik |
| 1992 | SODA | Minimizing Capacity Violations in a Transshipment Network. | Tomasz Radzik |
| 1991 | SODA | Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. | Tomasz Radzik, Andrew V. Goldberg |
| 1990 | SPAA | Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. | Torben Hagerup, Tomasz Radzik |
| 1989 | FCT | New Simulations between CRCW PRAMs. | Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik |
| 1988 | MFCS | Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. | Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik |
| 1988 | MFCS | Testing Isomorphism of Outerplanar Graphs in Parallel. | Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik |