Tomasz Radzik

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 40

Top Venues

Publications

Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139 (2024)
Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik, Kathleen Steinhöfel
New bounds for single-machine time-dependent scheduling with uniform deterioration. Theor. Comput. Sci. 1006 (2024)
Colin Cooper, Nan Kang, Tomasz Radzik, Ngoc Vu
A Simple Model of Influence: Details and Variants of Dynamics. WAW (2024)
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Brief Announcement: Discrete Incremental Voting. PODC (2023)
Colin Cooper, Nan Kang, Tomasz Radzik
A Simple Model of Influence. WAW (2023)
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Discrete Incremental Voting. CoRR (2023)
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Discrete Incremental Voting. OPODIS (2023)
Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik, Kathleen Steinhöfel
New Bounds for Time-Dependent Scheduling with Uniform Deterioration. CoRR (2023)
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera
Distributed Averaging in Opinion Dynamics. PODC (2023)
Colin Cooper, Nan Kang, Tomasz Radzik
A simple model of influence. CoRR (2023)
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik
Distributed Averaging in Population Protocols. CoRR (2022)
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Perpetual maintenance of machines with different urgency requirements. CoRR (2022)
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik
On early extinction and the effect of travelling in the SIR model. UAI (2022)
Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica 84 (10) (2022)
Angelos Gkikas, Tomasz Radzik
Servicing Timed Requests on a Line. CoRR (2021)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
Time-space trade-offs in population protocols for the majority problem. Distributed Comput. 34 (2) (2021)
Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020)
Petra Berenbrink, Dominik Kaaser, Tomasz Radzik
On Counting the Population Size. PODC (2019)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. 6 (3) (2019)
Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC (2019)
Petra Berenbrink, Dominik Kaaser, Tomasz Radzik
On Counting the Population Size. CoRR (2019)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
n) stabilization time and asymptotically optimal number of states. CoRR (2018)
Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Dispersion processes. Random Struct. Algorithms 53 (4) (2018)
Aris Pagourtzis, Tomasz Radzik
Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. MFCS (2018)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
Majority & Stabilization in Population Protocols. CoRR (2018)
Robert Elsässer, Tomasz Radzik
Recent Results in Population Protocols for Exact Majority and Leader Election. Bull. EATCS 126 (2018)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC (2018)
Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Dispersion processes. CoRR (2017)
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
Robustness of the Rotor-Router Mechanism. Algorithmica 78 (3) (2017)
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM (2017)
Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
) Convergence Time. PODC (2017)
Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR (2017)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA (2017)
Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast Plurality Consensus in Regular Expanders. DISC (2017)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
The coalescing-branching random walk on expanders and the dual epidemic process. CoRR (2016)
Jakub Radoszewski, Tomasz Radzik
2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW). J. Discrete Algorithms 37 (2016)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC (2016)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet Math. 12 (4) (2016)
Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast plurality consensus in regular expanders. CoRR (2016)
Alan Saied, Richard E. Overill, Tomasz Radzik
Detection of known and unknown DDoS attacks using Artificial Neural Networks. Neurocomputing 172 (2016)
Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast Consensus for Voting on General Expander Graphs. DISC (2015)
Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Coalescing Walks on Rotor-Router Systems. SIROCCO (2015)
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. CoRR (2014)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. Internet Math. 10 (1-2) (2014)
Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik, Yiannis Siantos
Random walks in recommender systems: exact computation and simulations. WWW (Companion Volume) (2014)
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. ICALP (2) (2014)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Estimating network parameters using random walks. Soc. Netw. Anal. Min. 4 (1) (2014)
Alan Saied, Richard E. Overill, Tomasz Radzik
Artificial Neural Networks in the Detection of Known and Unknown DDoS Attacks: Proof-of-Concept. PAAMS (Workshops) (2014)
Sang-Hyuk Lee, Tomasz Radzik
Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks. IWOCA (2013)
Colin Cooper, Alan M. Frieze, Tomasz Radzik
The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. 509 (2013)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27 (4) (2013)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW (2013)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Estimating network parameters using random walks. CASoN (2012)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) (2012)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing random walks and voting on graphs. PODC (2012)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms 14 (2012)
Tomasz Radzik, German Tischler
Editorial. J. Discrete Algorithms 11 (2012)
Sang-Hyuk Lee, Tomasz Radzik
Improved Approximation Bounds for Maximum Lifetime Problems in Wireless Ad-Hoc Network. ADHOC-NOW (2012)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. WAW (2012)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing random walks and voting on graphs CoRR (2012)
Colin Cooper, Alan M. Frieze, Tomasz Radzik
The Cover Times of Random Walks on Hypergraphs. SIROCCO (2011)
Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
Tree exploration with logarithmic memory. ACM Trans. Algorithms 7 (2) (2011)
Colin Cooper, Ralf Klasing, Tomasz Radzik
Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411 (14-15) (2010)
Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
Speeding Up Random Walks with Neighborhood Exploration. SODA (2010)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA (2010)
Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik
The Cover Time of Cartesian Product Graphs. IWOCA (2010)
Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
Many-to-Many Communication in Radio Networks. Algorithmica 54 (1) (2009)
Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
Robustness of the Rotor-router Mechanism. OPODIS (2009)
Colin Cooper, Alan M. Frieze, Tomasz Radzik
Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. 23 (4) (2009)
Colin Cooper, Alan M. Frieze, Tomasz Radzik
Multiple Random Walks and Interacting Particle Systems. ICALP (2) (2009)
Sarah Steiner, Tomasz Radzik
Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35 (1) (2008)
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Approximation bounds for Black Hole Search problems. Networks 52 (4) (2008)
Colin Cooper, Ralf Klasing, Tomasz Radzik
A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406 (3) (2008)
Leszek Gasieniec, Tomasz Radzik
Memory Efficient Anonymous Graph Exploration. WG (2008)
Colin Cooper, Ralf Klasing, Tomasz Radzik
Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO (2008)
Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
Tree exploration with logarithmic memory. SODA (2007)
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384 (2-3) (2007)
Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik
Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47 (1) (2007)
Susanne Albers, Tomasz Radzik
Foreword. Algorithmica 45 (1) (2006)
Colin Cooper, Ralf Klasing, Tomasz Radzik
Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS (2006)
Arjuna Sathiaseelan, Tomasz Radzik
Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN). Int. J. Commun. Syst. 19 (6) (2006)
Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
On Many-to-Many Communication in Packet Radio Networks. OPODIS (2006)
Tomasz Radzik
Guest Editor's Foreword. J. Graph Algorithms Appl. 10 (1) (2006)
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO (2005)
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Approximation Bounds for Black Hole Search Problems. OPODIS (2005)
Sarah Steiner, Tomasz Radzik
Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. OR (2005)
Arjuna Sathiaseelan, Tomasz Radzik
Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks. ICN (2) (2005)
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik
On the Wake-Up Problem in Radio Networks. ICALP (2005)
Arjuna Sathiaseelan, Tomasz Radzik
Improving the Performance of TCP in the Case of Packet Reordering. HSNMC (2004)
Tomasz Radzik
Improving time bounds on maximum generalised flow computations by contracting the network. Theor. Comput. Sci. 312 (1) (2004)
Leszek Gasieniec, Tomasz Radzik, Qin Xin
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. SWAT (2004)
Arjuna Sathiaseelan, Tomasz Radzik
RD-TCP: Reorder Detecting TCP. HSNMC (2003)
Tomasz Radzik
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. ICALP (2002)
Tomasz Radzik
Implementation of Dynamic Trees with In-Subtree Operations. ACM J. Exp. Algorithmics 3 (1998)
Tomasz Radzik
Faster Algorithms for the Generalized Network Flow Problem. Math. Oper. Res. 23 (1) (1998)
Tomasz Radzik
Fast deterministic approximation for the multicommodity flow problem. Math. Program. 77 (1997)
Tomasz Radzik
Implementations of Dynamic Tree Collections Based on Splay Trees. WAE (1997)
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73 (1996)
Tomasz Radzik
Fast Deterministic Approximation for the Multicommodity Flow Problem. SODA (1995)
Tomasz Radzik, Andrew V. Goldberg
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11 (3) (1994)

Tomasz Radzik.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tomasz Radzik