| Shortest paths algorithms: Theory and experimental evaluation BV Cherkassky, AV Goldberg, T Radzik Mathematical programming 73 (2), 129-174, 1996 | 1306 | 1996 |
| Detection of known and unknown DDoS attacks using Artificial Neural Networks A Saied, RE Overill, T Radzik Neurocomputing 172, 385-393, 2016 | 416 | 2016 |
| A heuristic improvement of the Bellman-Ford algorithm AV Goldberg, T Radzik Stanford University, Department of Computer Science, 1993 | 250 | 1993 |
| Shortest paths algorithms: Theory and experimental evaluation BV Cherkassky, AV Goldberg, T Radzik Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994 | 179 | 1994 |
| Multiple random walks in random regular graphs C Cooper, A Frieze, T Radzik SIAM Journal on Discrete Mathematics 23 (4), 1738-1761, 2010 | 151 | 2010 |
| Improved deterministic parallel integer sorting PCP Bhatt, K Diks, T Hagerup, VC Prasad, T Radzik, S Saxena Information and Computation 94 (1), 29-47, 1991 | 128 | 1991 |
| Random walks in recommender systems: exact computation and simulations C Cooper, SH Lee, T Radzik, Y Siantos Proceedings of the 23rd international conference on world wide web, 811-816, 2014 | 102 | 2014 |
| Fast deterministic approximation for the multicommodity flow problem T Radzik Mathematical Programming 78, 43-58, 1996 | 95 | 1996 |
| Newton's method for fractional combinatorial optimization T Radzik Department of Computer Science, Stanford University, 1992 | 92 | 1992 |
| Parametric flows, weighted means of cuts, and fractional combinatorial optimization T Radzik Complexity in numerical optimization, 351-386, 1993 | 90 | 1993 |
| The power of two choices in distributed voting C Cooper, R Elsässer, T Radzik International Colloquium on Automata, Languages, and Programming, 435-446, 2014 | 89 | 2014 |
| Fractional combinatorial optimization T Radzik Handbook of Combinatorial Optimization: Volume1–3, 429-478, 1998 | 85 | 1998 |
| Coalescing random walks and voting on connected graphs C Cooper, R Elsasser, H Ono, T Radzik SIAM Journal on Discrete Mathematics 27 (4), 1748-1758, 2013 | 82 | 2013 |
| Computing all efficient solutions of the biobjective minimum spanning tree problem S Steiner, T Radzik Computers & Operations Research 35 (1), 198-211, 2008 | 81 | 2008 |
| Searching for black-hole faults in a network using multiple agents C Cooper, R Klasing, T Radzik International Conference On Principles Of Distributed Systems, 320-332, 2006 | 79 | 2006 |
| Hardness and approximation results for black hole search in arbitrary networks R Klasing, E Markou, T Radzik, F Sarracco Theoretical Computer Science 384 (2-3), 201-221, 2007 | 68 | 2007 |
| Approximation bounds for black hole search problems R Klasing, E Markou, T Radzik, F Sarracco Networks: An International Journal 52 (4), 216-226, 2008 | 63 | 2008 |
| On the wake-up problem in radio networks BS Chlebus, L Gąsieniec, DR Kowalski, T Radzik International Colloquium on Automata, Languages, and Programming, 347-359, 2005 | 61 | 2005 |
| Tree exploration with logarithmic memory C Ambühl, L Gąsieniec, A Pelc, T Radzik, X Zhang ACM Transactions on Algorithms (TALG) 7 (2), 1-21, 2011 | 56 | 2011 |
| Faster deterministic gossiping in directed ad hoc radio networks L Gąsieniec, T Radzik, Q Xin Algorithm Theory-SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory …, 2004 | 55 | 2004 |
