The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tomasz Radzik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Tomasz Radzik
    Newton's Method for Fractional Combinatorial Optimization [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:659-669 [Conf]
  3. Tomasz Radzik
    Faster Algorithms for the Generalized Network Flow Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:438-448 [Conf]
  4. Arjuna Sathiaseelan, Tomasz Radzik
    RD-TCP: Reorder Detecting TCP. [Citation Graph (0, 0)][DBLP]
    HSNMC, 2003, pp:471-480 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Tomasz Radzik
    Minimizing Capacity Violations in a Transshipment Network. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:185-194 [Conf]
  17. Tomasz Radzik
    Fast Deterministic Approximation for the Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:486-492 [Conf]
  18. 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]
  19. 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]
  20. 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]
  21. Susanne Albers, Tomasz Radzik
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:1-2 [Journal]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
    Tree exploration with logarithmic memory. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:585-594 [Conf]
  31. 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]
  32. 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]

  33. Multiple Random Walks and Interacting Particle Systems. [Citation Graph (, )][DBLP]


  34. Robustness of the Rotor-router Mechanism. [Citation Graph (, )][DBLP]


  35. Locating and Repairing Faults in a Network with Mobile Agents. [Citation Graph (, )][DBLP]


  36. Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP]


  37. Memory Efficient Anonymous Graph Exploration. [Citation Graph (, )][DBLP]


  38. Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. [Citation Graph (, )][DBLP]


  39. Many-to-Many Communication in Radio Networks. [Citation Graph (, )][DBLP]


  40. Computing all efficient solutions of the biobjective minimum spanning tree problem. [Citation Graph (, )][DBLP]


Search in 0.102secs, Finished in 0.104secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002