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
10971996
A heuristic improvement of the Bellman-Ford algorithm
A Goldberg, T Radzik
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1993
1761993
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
1651994
Detection of known and unknown DDoS attacks using Artificial Neural Networks
A Saied, RE Overill, T Radzik
Neurocomputing 172, 385-393, 2016
1612016
Multiple random walks in random regular graphs
C Cooper, A Frieze, T Radzik
SIAM Journal on Discrete Mathematics 23 (4), 1738-1761, 2010
1212010
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
1141991
Fast deterministic approximation for the multicommodity flow problem
T Radzik
Mathematical Programming 78 (1), 43-58, 1996
841996
Parametric flows, weighted means of cuts, and fractional combinatorial optimization
T Radzik
Complexity in numerical optimization, 351-386, 1993
791993
Newton's method for fractional combinatorial optimization
T Radzik
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1992
741992
Fractional combinatorial optimization
T Radzik
Handbook of combinatorial optimization, 429-478, 1998
721998
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
702006
Computing all efficient solutions of the biobjective minimum spanning tree problem
S Steiner, T Radzik
Computers & Operations Research 35 (1), 198-211, 2008
602008
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
562007
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
552014
Approximation bounds for black hole search problems
R Klasing, E Markou, T Radzik, F Sarracco
Networks: An International Journal 52 (4), 216-226, 2008
552008
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
512011
Faster deterministic gossiping in directed ad hoc radio networks
L Gąsieniec, T Radzik, Q Xin
Scandinavian Workshop on Algorithm Theory, 397-407, 2004
512004
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
492013
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
482005
Faster algorithms for the generalized network flow problem
T Radzik
Mathematics of Operations Research 23 (1), 69-100, 1998
441998
The system can't perform the operation now. Try again later.
Articles 1–20