Search the dblp DataBase
Tomasz Radzik :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Bogdan S. Chlebus , Krzysztof Diks , Torben Hagerup , Tomasz Radzik New Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP ] FCT, 1989, pp:95-104 [Conf ] Tomasz Radzik Newton's Method for Fractional Combinatorial Optimization [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:659-669 [Conf ] Tomasz Radzik Faster Algorithms for the Generalized Network Flow Problem [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:438-448 [Conf ] Arjuna Sathiaseelan , Tomasz Radzik RD-TCP: Reorder Detecting TCP. [Citation Graph (0, 0)][DBLP ] HSNMC, 2003, pp:471-480 [Conf ] Arjuna Sathiaseelan , Tomasz Radzik Improving the Performance of TCP in the Case of Packet Reordering. [Citation Graph (0, 0)][DBLP ] HSNMC, 2004, pp:63-73 [Conf ] Bogdan S. Chlebus , Leszek Gasieniec , Dariusz R. Kowalski , Tomasz Radzik On the Wake-Up Problem in Radio Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:347-359 [Conf ] Tomasz Radzik Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:611-622 [Conf ] Arjuna Sathiaseelan , Tomasz Radzik Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks. [Citation Graph (0, 0)][DBLP ] ICN (2), 2005, pp:250-257 [Conf ] Bogdan S. Chlebus , Krzysztof Diks , Torben Hagerup , Tomasz Radzik Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:231-239 [Conf ] Bogdan S. Chlebus , Krzysztof Diks , Tomasz Radzik Testing Isomorphism of Outerplanar Graphs in Parallel. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:220-230 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski , Tomasz Radzik On Many-to-Many Communication in Packet Radio Networks. [Citation Graph (0, 0)][DBLP ] OPODIS, 2006, pp:260-274 [Conf ] Colin Cooper , Ralf Klasing , Tomasz Radzik Searching for Black-Hole Faults in a Network Using Multiple Agents. [Citation Graph (0, 0)][DBLP ] OPODIS, 2006, pp:320-332 [Conf ] Ralf Klasing , Euripides Markou , Tomasz Radzik , Fabiano Sarracco Approximation Bounds for Black Hole Search Problems. [Citation Graph (0, 0)][DBLP ] OPODIS, 2005, pp:261-274 [Conf ] Ralf Klasing , Euripides Markou , Tomasz Radzik , Fabiano Sarracco Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2005, pp:200-215 [Conf ] Boris V. Cherkassky , Andrew V. Goldberg , Tomasz Radzik Shortest Paths Algorithms: Theory and Experimental Evaluation. [Citation Graph (0, 0)][DBLP ] SODA, 1994, pp:516-525 [Conf ] Tomasz Radzik Minimizing Capacity Violations in a Transshipment Network. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:185-194 [Conf ] Tomasz Radzik Fast Deterministic Approximation for the Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1995, pp:486-492 [Conf ] Tomasz Radzik , Andrew V. Goldberg Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. [Citation Graph (0, 0)][DBLP ] SODA, 1991, pp:110-119 [Conf ] Torben Hagerup , Tomasz Radzik Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. [Citation Graph (0, 0)][DBLP ] SPAA, 1990, pp:117-124 [Conf ] Leszek Gasieniec , Tomasz Radzik , Qin Xin Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:397-407 [Conf ] Susanne Albers , Tomasz Radzik Foreword. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:45, n:1, pp:1-2 [Journal ] Tomasz Radzik , Andrew V. Goldberg Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1994, v:11, n:3, pp:226-242 [Journal ] P. C. P. Bhatt , Krzysztof Diks , Torben Hagerup , V. C. Prasad , Tomasz Radzik , Sanjeev Saxena Improved Deterministic Parallel Integer Sorting [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:94, n:1, pp:29-47 [Journal ] Marek Chrobak , Howard J. Karloff , Tomasz Radzik Connectivity vs. Reachability [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:91, n:2, pp:177-188 [Journal ] Tomasz Radzik Implementation of Dynamic Trees with In-Subtree Operations. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:9- [Journal ] Boris V. Cherkassky , Andrew V. Goldberg , Tomasz Radzik Shortest paths algorithms: Theory and experimental evaluation. [Citation Graph (0, 0)][DBLP ] Math. Program., 1996, v:73, n:, pp:129-174 [Journal ] Tomasz Radzik Fast deterministic approximation for the multicommodity flow problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1997, v:77, n:, pp:43-58 [Journal ] Tomasz Radzik Improving time bounds on maximum generalised flow computations by contracting the network. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:312, n:1, pp:75-97 [Journal ] Arjuna Sathiaseelan , Tomasz Radzik Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN). [Citation Graph (0, 0)][DBLP ] Int. J. Communication Systems, 2006, v:19, n:6, pp:659-678 [Journal ] Leszek Gasieniec , Andrzej Pelc , Tomasz Radzik , Xiaohui Zhang Tree exploration with logarithmic memory. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:585-594 [Conf ] Leszek Gasieniec , Aris Pagourtzis , Igor Potapov , Tomasz Radzik Deterministic Communication in Radio Networks with Large Labels. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:47, n:1, pp:97-117 [Journal ] Ralf Klasing , Euripides Markou , Tomasz Radzik , Fabiano Sarracco Hardness and approximation results for Black Hole Search in arbitrary networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:384, n:2-3, pp:201-221 [Journal ] Multiple Random Walks and Interacting Particle Systems. [Citation Graph (, )][DBLP ] Robustness of the Rotor-router Mechanism. [Citation Graph (, )][DBLP ] Locating and Repairing Faults in a Network with Mobile Agents. [Citation Graph (, )][DBLP ] Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP ] Memory Efficient Anonymous Graph Exploration. [Citation Graph (, )][DBLP ] Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. [Citation Graph (, )][DBLP ] Many-to-Many Communication in Radio Networks. [Citation Graph (, )][DBLP ] Computing all efficient solutions of the biobjective minimum spanning tree problem. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.303secs