Follow
Tomasz Radzik
Tomasz Radzik
Verified email at kcl.ac.uk
Title
Cited by
Cited by
Year
Shortest paths algorithms: Theory and experimental evaluation
BV Cherkassky, AV Goldberg, T Radzik
Mathematical programming 73 (2), 129-174, 1996
14311996
Detection of known and unknown DDoS attacks using Artificial Neural Networks
A Saied, RE Overill, T Radzik
Neurocomputing 172, 385-393, 2016
3522016
A heuristic improvement of the Bellman-Ford algorithm
A Goldberg, T Radzik
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1993
2201993
Multiple random walks in random regular graphs
C Cooper, A Frieze, T Radzik
SIAM Journal on Discrete Mathematics 23 (4), 1738-1761, 2010
1462010
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
1241991
Fractional combinatorial optimization
T Radzik
Handbook of Combinatorial Optimization: Volume1–3, 429-478, 1998
971998
Fast deterministic approximation for the multicommodity flow problem
T Radzik
Mathematical Programming 78, 43-58, 1996
931996
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
902014
Newton's method for fractional combinatorial optimization
T Radzik
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1992
881992
Parametric flows, weighted means of cuts, and fractional combinatorial optimization
T Radzik
Complexity in numerical optimization, 351-386, 1993
861993
The power of two choices in distributed voting
C Cooper, R Elsässer, T Radzik
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
792014
Searching for black-hole faults in a network using multiple agents
C Cooper, R Klasing, T Radzik
Principles of Distributed Systems: 10th International Conference, OPODIS …, 2006
752006
Computing all efficient solutions of the biobjective minimum spanning tree problem
S Steiner, T Radzik
Computers & Operations Research 35 (1), 198-211, 2008
702008
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
682013
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
662007
Approximation bounds for black hole search problems
R Klasing, E Markou, T Radzik, F Sarracco
Networks: An International Journal 52 (4), 216-226, 2008
612008
On the wake-up problem in radio networks
BS Chlebus, L Gąsieniec, DR Kowalski, T Radzik
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
602005
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
572011
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
522004
Locating and repairing faults in a network with mobile agents
C Cooper, R Klasing, T Radzik
Theoretical Computer Science 411 (14-15), 1638-1647, 2010
482010
The system can't perform the operation now. Try again later.
Articles 1–20