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
12031996
Shortest path algorithms: an evaluation using real road networks
FB Zhan, CE Noon
Transportation science 32 (1), 65-73, 1998
7471998
Detection of known and unknown DDoS attacks using Artificial Neural Networks
A Saied, RE Overill, T Radzik
Neurocomputing 172, 385-393, 2016
2602016
A heuristic improvement of the Bellman-Ford algorithm
A Goldberg, T Radzik
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1993
1991993
Shortest paths algorithms: Theory and experimental evaluation
BV Cherkassky, AV Goldberg, T Radzik
Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 516-525, 1994
1781994
Multiple random walks in random regular graphs
C Cooper, A Frieze, T Radzik
SIAM Journal on Discrete Mathematics 23 (4), 1738-1761, 2010
1382010
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
1161991
Fast deterministic approximation for the multicommodity flow problem
T Radzik
Mathematical Programming 78 (1), 43-58, 1996
901996
Parametric flows, weighted means of cuts, and fractional combinatorial optimization
T Radzik
Complexity in numerical optimization, 351-386, 1993
861993
Newton's method for fractional combinatorial optimization
T Radzik
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1992
811992
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
722006
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
692014
Computing all efficient solutions of the biobjective minimum spanning tree problem
S Steiner, T Radzik
Computers & Operations Research 35 (1), 198-211, 2008
672008
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
652014
Fractional combinatorial optimization
T Radzik
Handbook of combinatorial optimization, 429-478, 1998
651998
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
642013
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
602007
Approximation bounds for black hole search problems
R Klasing, E Markou, T Radzik, F Sarracco
Networks: An International Journal 52 (4), 216-226, 2008
582008
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
552011
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
542005
The system can't perform the operation now. Try again later.
Articles 1–20