Tomasz Radzik

According to our database1, Tomasz Radzik authored at least 79 papers between 1988 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
ACM Trans. Parallel Comput., 2019

On Counting the Population Size.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Dispersion processes.
Random Struct. Algorithms, 2018

Recent Results in Population Protocols for Exact Majority and Leader Election.
Bull. EATCS, 2018

A population protocol for exact majority with O(\log<sup>5/3</sup>n) stabilization time and asymptotically optimal number of states.
CoRR, 2018

Majority & Stabilization in Population Protocols.
CoRR, 2018

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time.
CoRR, 2017

Robustness of the Rotor-Router Mechanism.
Algorithmica, 2017

Fast Plurality Consensus in Regular Expanders.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Brief Announcement: Population Protocols for Leader Election and Exact Majority with <i>O</i>(log<sup>2</sup> <i>n</i>) States and <i>O</i>(log<sup>2</sup><i> n</i>) Convergence Time.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW).
J. Discrete Algorithms, 2016

Fast Low-Cost Estimation of Network Properties Using Random Walks.
Internet Math., 2016

Detection of known and unknown DDoS attacks using Artificial Neural Networks.
Neurocomputing, 2016

The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Fast Consensus for Voting on General Expander Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Coalescing Walks on Rotor-Router Systems.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
Estimating network parameters using random walks.
Soc. Netw. Anal. Min., 2014

A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence.
Internet Math., 2014

Random walks in recommender systems: exact computation and simulations.
Proceedings of the 23rd International World Wide Web Conference, 2014

Artificial Neural Networks in the Detection of Known and Unknown DDoS Attacks: Proof-of-Concept.
Proceedings of the Highlights of Practical Applications of Heterogeneous Multi-Agent Systems. The PAAMS Collection, 2014

The Power of Two Choices in Distributed Voting.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
The cover times of random walks on random uniform hypergraphs.
Theor. Comput. Sci., 2013

Coalescing Random Walks and Voting on Connected Graphs.
SIAM J. Discret. Math., 2013

Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Editorial.
J. Discrete Algorithms, 2012

Testing connectivity of faulty networks in sublinear time.
J. Discrete Algorithms, 2012

A fast algorithm to find all high degree vertices in power law graphs.
Proceedings of the 21st World Wide Web Conference, 2012

Coalescing random walks and voting on graphs.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Improved Approximation Bounds for Maximum Lifetime Problems in Wireless Ad-Hoc Network.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 11th International Conference, 2012

2011
Tree exploration with logarithmic memory.
ACM Trans. Algorithms, 2011

The Cover Times of Random Walks on Hypergraphs.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
Locating and repairing faults in a network with mobile agents.
Theor. Comput. Sci., 2010

Speeding Up Random Walks with Neighborhood Exploration.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Efficient Connectivity Testing of Hypercubic Networks with Faults.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The Cover Time of Cartesian Product Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Time-Efficient Broadcast in Radio Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Fractional Combinatorial Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Multiple Random Walks in Random Regular Graphs.
SIAM J. Discret. Math., 2009

Many-to-Many Communication in Radio Networks.
Algorithmica, 2009

Robustness of the Rotor-router Mechanism.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Multiple Random Walks and Interacting Particle Systems.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
A randomized algorithm for the joining protocol in dynamic distributed networks.
Theor. Comput. Sci., 2008

Approximation bounds for Black Hole Search problems.
Networks, 2008

Computing all efficient solutions of the biobjective minimum spanning tree problem.
Comput. Oper. Res., 2008

Memory Efficient Anonymous Graph Exploration.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007
Hardness and approximation results for Black Hole Search in arbitrary networks.
Theor. Comput. Sci., 2007

Deterministic Communication in Radio Networks with Large Labels.
Algorithmica, 2007

Tree exploration with logarithmic memory.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2006

Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN).
Int. J. Commun. Syst., 2006

Foreword.
Algorithmica, 2006

Searching for Black-Hole Faults in a Network Using Multiple Agents.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

On Many-to-Many Communication in Packet Radio Networks.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems.
Proceedings of the Operations Research Proceedings 2005, 2005

Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks.
Proceedings of the Networking, 2005

On the Wake-Up Problem in Radio Networks.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Improving time bounds on maximum generalised flow computations by contracting the network.
Theor. Comput. Sci., 2004

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.
Proceedings of the Algorithm Theory, 2004

Improving the Performance of TCP in the Case of Packet Reordering.
Proceedings of the High Speed Networks and Multimedia Communications, 2004

2003
RD-TCP: Reorder Detecting TCP.
Proceedings of the High Speed Networks and Multimedia Communications, 2003

1998
Faster Algorithms for the Generalized Network Flow Problem.
Math. Oper. Res., 1998

Implementation of Dynamic Trees with In-Subtree Operations.
ACM J. Exp. Algorithmics, 1998

1997
Fast deterministic approximation for the multicommodity flow problem.
Math. Program., 1997

1996
Shortest paths algorithms: Theory and experimental evaluation.
Math. Program., 1996

1994
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results.
Algorithmica, 1994

1992
Minimizing Capacity Violations in a Transshipment Network.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Newton's Method for Fractional Combinatorial Optimization
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Improved Deterministic Parallel Integer Sorting
Inf. Comput., September, 1991

Connectivity vs. Reachability
Inf. Comput., April, 1991

1990
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989
New Simulations between CRCW PRAMs.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Testing Isomorphism of Outerplanar Graphs in Parallel.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988


  Loading...