Tomasz Radzik - RankMe

125 papers A* 18A 5B 17C 10Journal 59Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A random forest process with a variable number of giant components in the threshold window. Discret. Appl. Math. Colin Cooper, Tomasz Radzik
2026	J	`jnl`	Discrete incremental voting on expanders. Discret. Math. Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2026	J	`jnl`	Undecided State Dynamics with Many Opinions. CoRR Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga
2025	A*	`conf`	Asynchronous 3-Majority Dynamics with Many Opinions. SODA Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga
2025	A*	`conf`	ReFuzzer: Feedback-Driven Approach to Enhance Validity of LLM-Generated Test Programs. ASE Iti Shree, Karine Even-Mendoza, Tomasz Radzik
2025	J	`jnl`	ReFuzzer: Feedback-Driven Approach to Enhance Validity of LLM-Generated Test Programs. CoRR Iti Shree, Karine Even-Mendoza, Tomasz Radzik
2024	C	`conf`	A Simple Model of Influence: Details and Variants of Dynamics. WAW Colin Cooper, Nan Kang, Tomasz Radzik, Ngoc Vu
2024	J	`jnl`	Asynchronous 3-Majority Dynamics with Many Opinions. CoRR Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga
2024	J	`jnl`	Discrete Incremental Voting on Expanders. CoRR Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2024	J	`jnl`	New bounds for single-machine time-dependent scheduling with uniform deterioration. Theor. Comput. Sci. Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik, Kathleen Steinhöfel
2024	J	`jnl`	Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2023	C	`conf`	A Simple Model of Influence. WAW Colin Cooper, Nan Kang, Tomasz Radzik
2023	J	`jnl`	A simple model of influence. CoRR Colin Cooper, Nan Kang, Tomasz Radzik
2023	A*	`conf`	Brief Announcement: Discrete Incremental Voting. PODC Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2023	B	`conf`	Discrete Incremental Voting. OPODIS Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2023	J	`jnl`	Discrete Incremental Voting. CoRR Colin Cooper, Tomasz Radzik, Takeharu Shiraga
2023	A*	`conf`	Distributed Averaging in Opinion Dynamics. PODC Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera
2023	J	`jnl`	New Bounds for Time-Dependent Scheduling with Uniform Deterioration. CoRR Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik, Kathleen Steinhöfel
2022	J	`jnl`	Distributed Averaging in Population Protocols. CoRR Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik
2022	A	`conf`	On early extinction and the effect of travelling in the SIR model. UAI Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik
2022	J	`jnl`	Perpetual maintenance of machines with different urgency requirements. CoRR Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2022	J	`jnl`	Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
2021	C	`ed.`	Algorithms for Sensor Systems - 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, Proceedings ALGOSENSORS Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
2021	J	`jnl`	Servicing Timed Requests on a Line. CoRR Angelos Gkikas, Tomasz Radzik
2021	J	`jnl`	Time-space trade-offs in population protocols for the majority problem. Distributed Comput. Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
2020	C	`ed.`	Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings IWOCA Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
2020	J	`jnl`	IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth
2019	C	`conf`	Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak
2019	J	`jnl`	New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. Colin Cooper, Tomasz Radzik, Nicolas Rivera
2019	A*	`conf`	On Counting the Population Size. PODC Petra Berenbrink, Dominik Kaaser, Tomasz Radzik
2019	J	`jnl`	On Counting the Population Size. CoRR Petra Berenbrink, Dominik Kaaser, Tomasz Radzik
2018	A	`conf`	A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
2018	J	`jnl`	A population protocol for exact majority with O(\log CoRR Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
2018	J	`jnl`	Dispersion processes. Random Struct. Algorithms Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2018	J	`jnl`	Majority & Stabilization in Population Protocols. CoRR Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
2018	J	`jnl`	Recent Results in Population Protocols for Exact Majority and Leader Election. Bull. EATCS Robert Elsässer, Tomasz Radzik
2018	B	`conf`	Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. MFCS Aris Pagourtzis, Tomasz Radzik
2017	B	`conf`	Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2017	A*	`conf`	Brief Announcement: Population Protocols for Leader Election and Exact Majority with PODC Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
2017	J	`jnl`	Dispersion processes. CoRR Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2017	A	`conf`	Fast Plurality Consensus in Regular Expanders. DISC Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2017	B	`conf`	Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA Colin Cooper, Tomasz Radzik, Nicolas Rivera
2017	J	`jnl`	Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
2017	J	`jnl`	Robustness of the Rotor-Router Mechanism. Algorithmica Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
2016	J	`jnl`	2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW). J. Discrete Algorithms Jakub Radoszewski, Tomasz Radzik
2016	J	`jnl`	Detection of known and unknown DDoS attacks using Artificial Neural Networks. Neurocomputing Alan Saied, Richard E. Overill, Tomasz Radzik
2016	J	`jnl`	Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet Math. Colin Cooper, Tomasz Radzik, Yiannis Siantos
2016	J	`jnl`	Fast plurality consensus in regular expanders. CoRR Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2016	A*	`conf`	The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC Colin Cooper, Tomasz Radzik, Nicolas Rivera
2016	J	`jnl`	The coalescing-branching random walk on expanders and the dual epidemic process. CoRR Colin Cooper, Tomasz Radzik, Nicolas Rivera
2015	B	`conf`	Coalescing Walks on Rotor-Router Systems. SIROCCO Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2015	A	`conf`	Fast Consensus for Voting on General Expander Graphs. DISC Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
2014	J	`jnl`	A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. Internet Math. Colin Cooper, Tomasz Radzik, Yiannis Siantos
2014	—	`conf`	Artificial Neural Networks in the Detection of Known and Unknown DDoS Attacks: Proof-of-Concept. PAAMS (Workshops) Alan Saied, Richard E. Overill, Tomasz Radzik
2014	J	`jnl`	Estimating network parameters using random walks. Soc. Netw. Anal. Min. Colin Cooper, Tomasz Radzik, Yiannis Siantos
2014	—	`conf`	Random walks in recommender systems: exact computation and simulations. WWW (Companion Volume) Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik, Yiannis Siantos
2014	—	`conf`	The Power of Two Choices in Distributed Voting. ICALP (2) Colin Cooper, Robert Elsässer, Tomasz Radzik
2014	J	`jnl`	The Power of Two Choices in Distributed Voting. CoRR Colin Cooper, Robert Elsässer, Tomasz Radzik
2013	C	`conf`	Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks. IWOCA Sang-Hyuk Lee, Tomasz Radzik
2013	J	`jnl`	Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2013	C	`conf`	Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW Colin Cooper, Tomasz Radzik, Yiannis Siantos
2013	J	`jnl`	The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. Colin Cooper, Alan M. Frieze, Tomasz Radzik
2012	C	`conf`	A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. WAW Colin Cooper, Tomasz Radzik, Yiannis Siantos
2012	—	`conf`	A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) Colin Cooper, Tomasz Radzik, Yiannis Siantos
2012	J	`jnl`	Coalescing random walks and voting on graphs CoRR Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012	A*	`conf`	Coalescing random walks and voting on graphs. PODC Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
2012	J	`jnl`	Editorial. J. Discrete Algorithms Tomasz Radzik, German Tischler
2012	—	`conf`	Estimating network parameters using random walks. CASoN Colin Cooper, Tomasz Radzik, Yiannis Siantos
2012	—	`conf`	Improved Approximation Bounds for Maximum Lifetime Problems in Wireless Ad-Hoc Network. ADHOC-NOW Sang-Hyuk Lee, Tomasz Radzik
2012	J	`jnl`	Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
2011	B	`conf`	The Cover Times of Random Walks on Hypergraphs. SIROCCO Colin Cooper, Alan M. Frieze, Tomasz Radzik
2011	J	`jnl`	Tree exploration with logarithmic memory. ACM Trans. Algorithms Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2010	C	`conf`	Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
2010	J	`jnl`	Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. Colin Cooper, Ralf Klasing, Tomasz Radzik
2010	A*	`conf`	Speeding Up Random Walks with Neighborhood Exploration. SODA Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
2010	C	`conf`	The Cover Time of Cartesian Product Graphs. IWOCA Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik
2010	—	`ch.`	Time-Efficient Broadcast in Radio Networks. Graphs and Algorithms in Communication Networks David Peleg, Tomasz Radzik
2009	—	`ch.`	Fractional Combinatorial Optimization. Encyclopedia of Optimization Tomasz Radzik
2009	J	`jnl`	Many-to-Many Communication in Radio Networks. Algorithmica Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
2009	—	`conf`	Multiple Random Walks and Interacting Particle Systems. ICALP (2) Colin Cooper, Alan M. Frieze, Tomasz Radzik
2009	J	`jnl`	Multiple Random Walks in Random Regular Graphs. SIAM J. Discret. Math. Colin Cooper, Alan M. Frieze, Tomasz Radzik
2009	B	`conf`	Robustness of the Rotor-router Mechanism. OPODIS Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
2008	J	`jnl`	A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. Colin Cooper, Ralf Klasing, Tomasz Radzik
2008	J	`jnl`	Approximation bounds for Black Hole Search problems. Networks Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2008	J	`jnl`	Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. Sarah Steiner, Tomasz Radzik
2008	B	`conf`	Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO Colin Cooper, Ralf Klasing, Tomasz Radzik
2008	B	`conf`	Memory Efficient Anonymous Graph Exploration. WG Leszek Gasieniec, Tomasz Radzik
2007	J	`jnl`	Deterministic Communication in Radio Networks with Large Labels. Algorithmica Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik
2007	J	`jnl`	Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2007	A*	`conf`	Tree exploration with logarithmic memory. SODA Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2006	J	`jnl`	Foreword. Algorithmica Susanne Albers, Tomasz Radzik
2006	J	`jnl`	Guest Editor's Foreword. J. Graph Algorithms Appl. Tomasz Radzik
2006	B	`conf`	On Many-to-Many Communication in Packet Radio Networks. OPODIS Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
2006	J	`jnl`	Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN). Int. J. Commun. Syst. Arjuna Sathiaseelan, Tomasz Radzik
2006	B	`conf`	Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS Colin Cooper, Ralf Klasing, Tomasz Radzik
2005	B	`conf`	Approximation Bounds for Black Hole Search Problems. OPODIS Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2005	B	`conf`	Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
2005	—	`conf`	Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. OR Sarah Steiner, Tomasz Radzik
2005	A*	`conf`	On the Wake-Up Problem in Radio Networks. ICALP Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik
2005	—	`conf`	Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks. ICN (2) Arjuna Sathiaseelan, Tomasz Radzik
2004	A	`ed.`	Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings ESA Susanne Albers, Tomasz Radzik
2004	—	`conf`	Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. SWAT Leszek Gasieniec, Tomasz Radzik, Qin Xin
2004	—	`conf`	Improving the Performance of TCP in the Case of Packet Reordering. HSNMC Arjuna Sathiaseelan, Tomasz Radzik
2004	J	`jnl`	Improving time bounds on maximum generalised flow computations by contracting the network. Theor. Comput. Sci. Tomasz Radzik
2003	—	`conf`	RD-TCP: Reorder Detecting TCP. HSNMC Arjuna Sathiaseelan, Tomasz Radzik
2002	A*	`conf`	Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. ICALP Tomasz Radzik
1998	J	`jnl`	Faster Algorithms for the Generalized Network Flow Problem. Math. Oper. Res. Tomasz Radzik
1998	J	`jnl`	Implementation of Dynamic Trees with In-Subtree Operations. ACM J. Exp. Algorithmics Tomasz Radzik
1997	J	`jnl`	Fast deterministic approximation for the multicommodity flow problem. Math. Program. Tomasz Radzik
1997	—	`conf`	Implementations of Dynamic Tree Collections Based on Splay Trees. WAE Tomasz Radzik
1996	J	`jnl`	Shortest paths algorithms: Theory and experimental evaluation. Math. Program. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
1995	A*	`conf`	Fast Deterministic Approximation for the Multicommodity Flow Problem. SODA Tomasz Radzik
1994	A*	`conf`	Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
1994	J	`jnl`	Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica Tomasz Radzik, Andrew V. Goldberg
1993	A*	`conf`	Faster Algorithms for the Generalized Network Flow Problem FOCS Tomasz Radzik
1992	—	`—`	Algorithms for some linear and fractional combinatorial optimization problems. Tomasz Radzik
1992	A*	`conf`	Minimizing Capacity Violations in a Transshipment Network. SODA Tomasz Radzik
1992	A*	`conf`	Newton's Method for Fractional Combinatorial Optimization FOCS Tomasz Radzik
1991	J	`jnl`	Connectivity vs. Reachability Inf. Comput. Marek Chrobak, Howard J. Karloff, Tomasz Radzik
1991	J	`jnl`	Improved Deterministic Parallel Integer Sorting Inf. Comput. P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
1991	A*	`conf`	Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA Tomasz Radzik, Andrew V. Goldberg
1990	B	`conf`	Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA Torben Hagerup, Tomasz Radzik
1989	B	`conf`	New Simulations between CRCW PRAMs. FCT Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
1988	B	`conf`	Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
1988	B	`conf`	Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik