


default search action
Tomasz Radzik
Person information
- affiliation: King's College London, UK
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [c59]Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga:
Asynchronous 3-Majority Dynamics with Many Opinions. SODA 2025: 4095-4131 - 2024
- [j38]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: 103476 (2024) - [j37]Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik
, Kathleen Steinhöfel:
New bounds for single-machine time-dependent scheduling with uniform deterioration. Theor. Comput. Sci. 1006: 114673 (2024) - [c58]Colin Cooper, Nan Kang, Tomasz Radzik
, Ngoc Vu:
A Simple Model of Influence: Details and Variants of Dynamics. WAW 2024: 32-46 - [i17]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting on Expanders. CoRR abs/2409.12615 (2024) - [i16]Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga:
Asynchronous 3-Majority Dynamics with Many Opinions. CoRR abs/2410.11172 (2024) - 2023
- [c57]Colin Cooper, Tomasz Radzik
, Takeharu Shiraga:
Discrete Incremental Voting. OPODIS 2023: 10:1-10:22 - [c56]Petra Berenbrink
, Colin Cooper
, Cristina Gava
, David Kohan Marzagão
, Frederik Mallmann-Trenn
, Tomasz Radzik
, Nicolas Rivera
:
Distributed Averaging in Opinion Dynamics. PODC 2023: 211-221 - [c55]Colin Cooper
, Tomasz Radzik
, Takeharu Shiraga
:
Brief Announcement: Discrete Incremental Voting. PODC 2023: 278-281 - [c54]Colin Cooper, Nan Kang, Tomasz Radzik:
A Simple Model of Influence. WAW 2023: 164-178 - [i15]Colin Cooper, Nan Kang, Tomasz Radzik:
A simple model of influence. CoRR abs/2305.07604 (2023) - [i14]Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting. CoRR abs/2305.15632 (2023) - [i13]Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik, Kathleen Steinhöfel:
New Bounds for Time-Dependent Scheduling with Uniform Deterioration. CoRR abs/2307.00627 (2023) - 2022
- [j36]Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
:
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica 84(10): 3103-3106 (2022) - [c53]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: 159-169 - [i12]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - [i11]Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik:
Distributed Averaging in Population Protocols. CoRR abs/2211.17125 (2022) - 2021
- [j35]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): 91-111 (2021) - [e3]Leszek Gasieniec
, Ralf Klasing, Tomasz Radzik:
Algorithms for Sensor Systems - 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, Proceedings. Lecture Notes in Computer Science 12961, Springer 2021, ISBN 978-3-030-89239-5 [contents] - [i10]Angelos Gkikas, Tomasz Radzik:
Servicing Timed Requests on a Line. CoRR abs/2111.15434 (2021) - 2020
- [j34]Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth:
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020) - [e2]Leszek Gasieniec, Ralf Klasing, Tomasz Radzik:
Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12126, Springer 2020, ISBN 978-3-030-48965-6 [contents]
2010 – 2019
- 2019
- [j33]Colin Cooper, Tomasz Radzik
, Nicolas Rivera:
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. 6(3): 16:1-16:24 (2019) - [c52]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: 174-186 - [c51]Petra Berenbrink, Dominik Kaaser, Tomasz Radzik
:
On Counting the Population Size. PODC 2019: 43-52 - [i9]Petra Berenbrink, Dominik Kaaser, Tomasz Radzik:
On Counting the Population Size. CoRR abs/1905.11962 (2019) - 2018
- [j32]Robert Elsässer, Tomasz Radzik:
Recent Results in Population Protocols for Exact Majority and Leader Election. Bull. EATCS 126 (2018) - [j31]Colin Cooper, Andrew McDowell, Tomasz Radzik
, Nicolas Rivera, Takeharu Shiraga:
Dispersion processes. Random Struct. Algorithms 53(4): 561-585 (2018) - [c50]Aris Pagourtzis, Tomasz Radzik
:
Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. MFCS 2018: 80:1-80:13 - [c49]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: 10:1-10:18 - [i8]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Majority & Stabilization in Population Protocols. CoRR abs/1805.04586 (2018) - [i7]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states. CoRR abs/1805.05157 (2018) - 2017
- [j30]Evangelos Bampas
, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
:
Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895 (2017) - [c48]Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
:
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. PODC 2017: 451-453 - [c47]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: 229-240 - [c46]Colin Cooper, Tomasz Radzik
, Nicolas Rivera:
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA 2017: 305-312 - [c45]Colin Cooper, Tomasz Radzik
, Nicolas Rivera, Takeharu Shiraga:
Fast Plurality Consensus in Regular Expanders. DISC 2017: 13:1-13:16 - [i6]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 abs/1705.01146 (2017) - [i5]Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Dispersion processes. CoRR abs/1712.03389 (2017) - 2016
- [j29]Alan Saied, Richard E. Overill, Tomasz Radzik
:
Detection of known and unknown DDoS attacks using Artificial Neural Networks. Neurocomputing 172: 385-393 (2016) - [j28]Colin Cooper, Tomasz Radzik
, Yiannis Siantos:
Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet Math. 12(4): 221-238 (2016) - [j27]Jakub Radoszewski, Tomasz Radzik
:
2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW). J. Discrete Algorithms 37: 1-2 (2016) - [c44]Colin Cooper, Tomasz Radzik
, Nicolas Rivera:
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC 2016: 461-467 - [i4]Colin Cooper, Tomasz Radzik, Nicolas Rivera:
The coalescing-branching random walk on expanders and the dual epidemic process. CoRR abs/1602.05768 (2016) - [i3]Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast plurality consensus in regular expanders. CoRR abs/1605.08403 (2016) - 2015
- [c43]Colin Cooper, Tomasz Radzik
, Nicolas Rivera, Takeharu Shiraga:
Coalescing Walks on Rotor-Router Systems. SIROCCO 2015: 444-458 - [c42]Colin Cooper, Robert Elsässer, Tomasz Radzik
, Nicolas Rivera, Takeharu Shiraga:
Fast Consensus for Voting on General Expander Graphs. DISC 2015: 248-262 - 2014
- [j26]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): 137-161 (2014) - [j25]Colin Cooper, Tomasz Radzik
, Yiannis Siantos:
Estimating network parameters using random walks. Soc. Netw. Anal. Min. 4(1): 168 (2014) - [c41]Colin Cooper, Robert Elsässer, Tomasz Radzik
:
The Power of Two Choices in Distributed Voting. ICALP (2) 2014: 435-446 - [c40]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: 309-320 - [c39]Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik
, Yiannis Siantos:
Random walks in recommender systems: exact computation and simulations. WWW (Companion Volume) 2014: 811-816 - [i2]Colin Cooper, Robert Elsässer, Tomasz Radzik:
The Power of Two Choices in Distributed Voting. CoRR abs/1404.7479 (2014) - 2013
- [j24]Colin Cooper, Robert Elsässer, Hirotaka Ono
, Tomasz Radzik
:
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27(4): 1748-1758 (2013) - [j23]Colin Cooper, Alan M. Frieze
, Tomasz Radzik
:
The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. 509: 51-69 (2013) - [c38]Sang-Hyuk Lee, Tomasz Radzik
:
Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks. IWOCA 2013: 283-296 - [c37]Colin Cooper, Tomasz Radzik
, Yiannis Siantos:
Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW 2013: 130-143 - 2012
- [j22]Tomasz Radzik, German Tischler:
Editorial. J. Discrete Algorithms 11: 1-2 (2012) - [j21]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: 223-231 (2012) - [c36]Sang-Hyuk Lee, Tomasz Radzik
:
Improved Approximation Bounds for Maximum Lifetime Problems in Wireless Ad-Hoc Network. ADHOC-NOW 2012: 14-27 - [c35]Colin Cooper, Tomasz Radzik
, Yiannis Siantos:
Estimating network parameters using random walks. CASoN 2012: 33-40 - [c34]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
:
Coalescing random walks and voting on graphs. PODC 2012: 47-56 - [c33]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: 165-178 - [c32]Colin Cooper, Tomasz Radzik
, Yiannis Siantos:
A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) 2012: 1007-1016 - [i1]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. CoRR abs/1204.4106 (2012) - 2011
- [j20]Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik
, Xiaohui Zhang:
Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2): 17:1-17:21 (2011) - [c31]Colin Cooper, Alan M. Frieze, Tomasz Radzik
:
The Cover Times of Random Walks on Hypergraphs. SIROCCO 2011: 210-221 - 2010
- [j19]Colin Cooper, Ralf Klasing, Tomasz Radzik
:
Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411(14-15): 1638-1647 (2010) - [c30]Tomás Dvorák
, Jirí Fink
, Petr Gregor
, Václav Koubek, Tomasz Radzik:
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA 2010: 181-191 - [c29]Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik:
The Cover Time of Cartesian Product Graphs. IWOCA 2010: 377-389 - [c28]Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald:
Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435 - [p1]David Peleg, Tomasz Radzik:
Time-Efficient Broadcast in Radio Networks. Graphs and Algorithms in Communication Networks 2010: 311-334
2000 – 2009
- 2009
- [j18]Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
:
Many-to-Many Communication in Radio Networks. Algorithmica 54(1): 118-139 (2009) - [j17]Colin Cooper, Alan M. Frieze
, Tomasz Radzik
:
Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. 23(4): 1738-1761 (2009) - [c27]Colin Cooper, Alan M. Frieze, Tomasz Radzik:
Multiple Random Walks and Interacting Particle Systems. ICALP (2) 2009: 399-410 - [c26]Evangelos Bampas
, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
:
Robustness of the Rotor-router Mechanism. OPODIS 2009: 345-358 - [r1]Tomasz Radzik:
Fractional Combinatorial Optimization. Encyclopedia of Optimization 2009: 1077-1080 - 2008
- [j16]Sarah Steiner, Tomasz Radzik
:
Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35(1): 198-211 (2008) - [j15]Ralf Klasing, Euripides Markou, Tomasz Radzik
, Fabiano Sarracco:
Approximation bounds for Black Hole Search problems. Networks 52(4): 216-226 (2008) - [j14]Colin Cooper, Ralf Klasing, Tomasz Radzik:
A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406(3): 248-262 (2008) - [c25]Colin Cooper, Ralf Klasing, Tomasz Radzik
:
Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32 - [c24]Leszek Gasieniec, Tomasz Radzik
:
Memory Efficient Anonymous Graph Exploration. WG 2008: 14-29 - 2007
- [j13]Leszek Gasieniec, Aris Pagourtzis
, Igor Potapov, Tomasz Radzik
:
Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007) - [j12]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): 201-221 (2007) - [c23]Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
Tree exploration with logarithmic memory. SODA 2007: 585-594 - 2006
- [j11]Susanne Albers, Tomasz Radzik
:
Foreword. Algorithmica 45(1): 1-2 (2006) - [j10]Arjuna Sathiaseelan, Tomasz Radzik
:
Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN). Int. J. Commun. Syst. 19(6): 659-678 (2006) - [j9]Tomasz Radzik:
Guest Editor's Foreword. J. Graph Algorithms Appl. 10(1): 3-4 (2006) - [c22]Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
:
On Many-to-Many Communication in Packet Radio Networks. OPODIS 2006: 260-274 - [c21]Colin Cooper, Ralf Klasing, Tomasz Radzik
:
Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332 - 2005
- [c20]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik
:
On the Wake-Up Problem in Radio Networks. ICALP 2005: 347-359 - [c19]Arjuna Sathiaseelan, Tomasz Radzik:
Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks. ICN (2) 2005: 250-257 - [c18]Ralf Klasing, Euripides Markou, Tomasz Radzik
, Fabiano Sarracco:
Approximation Bounds for Black Hole Search Problems. OPODIS 2005: 261-274 - [c17]Sarah Steiner, Tomasz Radzik:
Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. OR 2005: 373-378 - [c16]Ralf Klasing, Euripides Markou, Tomasz Radzik
, Fabiano Sarracco:
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO 2005: 200-215 - 2004
- [j8]Tomasz Radzik
:
Improving time bounds on maximum generalised flow computations by contracting the network. Theor. Comput. Sci. 312(1): 75-97 (2004) - [c15]Arjuna Sathiaseelan, Tomasz Radzik:
Improving the Performance of TCP in the Case of Packet Reordering. HSNMC 2004: 63-73 - [c14]Leszek Gasieniec, Tomasz Radzik, Qin Xin:
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. SWAT 2004: 397-407 - [e1]Susanne Albers, Tomasz Radzik:
Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3221, Springer 2004, ISBN 3-540-23025-4 [contents] - 2003
- [c13]Arjuna Sathiaseelan, Tomasz Radzik:
RD-TCP: Reorder Detecting TCP. HSNMC 2003: 471-480 - 2002
- [c12]Tomasz Radzik:
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. ICALP 2002: 611-622
1990 – 1999
- 1998
- [j7]Tomasz Radzik:
Implementation of Dynamic Trees with In-Subtree Operations. ACM J. Exp. Algorithmics 3: 9 (1998) - [j6]Tomasz Radzik:
Faster Algorithms for the Generalized Network Flow Problem. Math. Oper. Res. 23(1): 69-100 (1998) - 1997
- [j5]Tomasz Radzik:
Fast deterministic approximation for the multicommodity flow problem. Math. Program. 77: 43-58 (1997) - [c11]Tomasz Radzik:
Implementations of Dynamic Tree Collections Based on Splay Trees. WAE 1997: 11-21 - 1996
- [j4]Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73: 129-174 (1996) - 1995
- [c10]Tomasz Radzik:
Fast Deterministic Approximation for the Multicommodity Flow Problem. SODA 1995: 486-492 - 1994
- [j3]Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11(3): 226-242 (1994) - [c9]Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA 1994: 516-525 - 1993
- [c8]Tomasz Radzik:
Faster Algorithms for the Generalized Network Flow Problem. FOCS 1993: 438-448 - 1992
- [b1]Tomasz Radzik:
Algorithms for some linear and fractional combinatorial optimization problems. Stanford University, USA, 1992 - [c7]Tomasz Radzik:
Newton's Method for Fractional Combinatorial Optimization. FOCS 1992: 659-669 - [c6]Tomasz Radzik:
Minimizing Capacity Violations in a Transshipment Network. SODA 1992: 185-194 - 1991
- [j2]Marek Chrobak, Howard J. Karloff, Tomasz Radzik:
Connectivity vs. Reachability. Inf. Comput. 91(2): 177-188 (1991) - [j1]P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena:
Improved Deterministic Parallel Integer Sorting. Inf. Comput. 94(1): 29-47 (1991) - [c5]Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA 1991: 110-119 - 1990
- [c4]Torben Hagerup, Tomasz Radzik:
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA 1990: 117-124
1980 – 1989
- 1989
- [c3]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
New Simulations between CRCW PRAMs. FCT 1989: 95-104 - 1988
- [c2]Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik:
Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS 1988: 220-230 - [c1]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239