MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Tomasz Radzik" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

Implementation of Dynamic Trees with In-Subtree Operations
by Tomasz Radzik — 1998 — ACM Journal of Experimental Algorithms
…Implementation of Dynamic Trees with In-Subtree Operations Tomasz Radzik Department of Computer…
Cited by 6 (0 self) – Add To MetaCart

Experimental Study of a Solution Method for Multicommodity Flow Problems
by Tomasz Radzik — 2000
…Experimental study of a solution method for multicommodity ow problems Tomasz Radzik King…
Cited by 1 (0 self) – Add To MetaCart

Solving the biobjective minimum spanning tree problem using a k-best algorithm
by Sarah Steiner, Tomasz Radzik — 2003
… ⋆ and Tomasz Radzik {sarah,radzik}@(email omitted); Department of Computer Science King’s College London Strand…
Cited by 1 (0 self) – Add To MetaCart

Improving the Performance of TCP in the Case of Packet Reordering
by Arjuna Sathiaseelan, Tomasz Radzik — 2004 — In Proc. IEEE HSNMC
…Improving the performance of TCP in the case of packet reordering Arjuna Sathiaseelan and Tomasz…
Cited by 3 (0 self) – Add To MetaCart

RD-TCP: Reorder Detecting TCP
by Arjuna Sathiaseelan, Tomasz Radzik — 2003 — Proceedings of the 6th IEEE International Conference on High Speed Networks and Multimedia Communications HSNMC’03
…RD-TCP : Reorder Detecting TCP Arjuna Sathiaseelan and Tomasz Radzik Department of Computer…
Cited by 1 (0 self) – Add To MetaCart

Using remote memory paging for handheld devices in a pervasive computing environment
by Arjuna Sathiaseelan, Tomasz Radzik — 2003 — Asian Journal of Information Technology
… Sathiaseelan and Tomasz Radzik Department of Computer Science, King’s College London, Strand, London WC2R 2LS…
Cited by 2 (0 self) – Add To MetaCart

A Heuristic Improvement Of The Bellman-Ford Algorithm
by Andrew V. Goldberg, Tomasz Radzik — 1993
… DEPARTMENT, STANFORD UNIVERSITY, STANFORD, CA 94305 AND TOMASZ RADZIK SORIE, CORNELL UNIVERSITY, ITHACA, NY…
Cited by 13 (2 self) – Add To MetaCart

Hardness and approximation results for black hole search in arbitrary graphs
by Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco — 2005 — In Proc. 12th Coll. on Structural Information and Communication complexity (SIROCCO’05
… ⋆⋆ , Euripides Markou ⋆ ⋆ ⋆ , Tomasz Radzik † , and Fabiano Sarracco ‡ Abstract. A black hole is a highly harmful…
Cited by 11 (3 self) – Add To MetaCart

Approximation bounds for Black Hole Search problems
by Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco — 2005 — in "Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005)", Lecture Notes in Computer Science
… ⋆ ⋆ ⋆ , Tomasz Radzik † , Fabiano Sarracco ‡ Abstract. A black hole is a highly harmful stationary process…
Cited by 3 (1 self) – Add To MetaCart

Faster deterministic gossiping in directed ad-hoc radio networks
by Leszek Gasieniec , Tomasz Radzik, Qin Xin — 2004
… Faster deterministic gossiping in directed ad-hoc radio networks Leszek Ga,sieniec1, Tomasz…
Cited by 5 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB