The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chryssis Georgiou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chryssis Georgiou, Nancy A. Lynch, Panayiotis Mavrommatis, Joshua A. Tauber
    Automated Implementation of Complex Distributed Algorithms Specified in the IOA Language. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:128-134 [Conf]
  2. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Distributed Cooperation and Adversity: Complexity Trade-Offs. [Citation Graph (0, 0)][DBLP]
    PCK50, 2003, pp:60-71 [Conf]
  3. Chryssis Georgiou, Theophanis Pavlides, Anna Philippou
    Network uncertainty in selfish routing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  4. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Developing a Consistent Domain-Oriented Distributed Object Service. [Citation Graph (0, 0)][DBLP]
    NCA, 2005, pp:149-158 [Conf]
  5. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Complexity of Distributed Cooperation in the Presence of Failures. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2000, pp:245-264 [Conf]
  6. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Failure sensitive analysis for parallel algorithm with controlled memory access concurrency. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2002, pp:125-136 [Conf]
  7. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Optimally work-competitive scheduling for cooperative computing with merging groups. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:132- [Conf]
  8. Antonio Fernández, Chryssis Georgiou
    The Do-All Problem with Byzantine Processor Failures. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:117-132 [Conf]
  9. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Long-Lived Rambo: Trading Knowledge for Communication. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:185-196 [Conf]
  10. Chryssis Georgiou, Alexander A. Shvartsman
    Cooperative computing with fragmentable and mergeable groups. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:141-156 [Conf]
  11. Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman
    Fault-tolerant semifast implementations of atomic read/write registers. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:281-290 [Conf]
  12. Antonio Fernández, Luis López, Agustín Santos, Chryssis Georgiou
    Reliably Executing Tasks in the Presence of Untrusted Entities. [Citation Graph (0, 0)][DBLP]
    SRDS, 2006, pp:39-50 [Conf]
  13. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Work-competitive scheduling for cooperative computing with dynamic groups. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:251-258 [Conf]
  14. Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman
    Efficient Gossip and Robust Distributed Computation. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:224-238 [Conf]
  15. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Complexity of Synchronous Iterative Do-All with Crashes. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:151-165 [Conf]
  16. Antonio Fernández, Chryssis Georgiou, Luis López, Agustín Santos
    Reliably Executing Tasks in the Presence of Malicious Processors. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:490-492 [Conf]
  17. Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman
    Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:537-539 [Conf]
  18. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The complexity of synchronous iterative Do-All with crashes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2004, v:17, n:1, pp:47-63 [Journal]
  19. Chryssis Georgiou, Alexander A. Shvartsman
    Cooperative computing with fragmentable and mergeable groups. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:2, pp:211-235 [Journal]
  20. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:848-862 [Journal]
  21. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Analysis of memory access concurrency in robust parallel algorithms. [Citation Graph (0, 0)][DBLP]
    Stud. Inform. Univ., 2004, v:3, n:2, pp:125-150 [Journal]
  22. Antonio Fernández, Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Do-All problem with Byzantine processor failures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:433-454 [Journal]
  23. Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman
    Efficient gossip and robust distributed computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:130-166 [Journal]
  24. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger
    A formal treatment of an abstract channel implementation using java sockets and TCP. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:334-335 [Conf]
  25. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Long-lived Rambo: Trading knowledge for communication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:59-85 [Journal]

  26. Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network. [Citation Graph (, )][DBLP]


  27. On the Application of Formal Methods for Specifying and Verifying Distributed Protocols. [Citation Graph (, )][DBLP]


  28. Identifying Failures in Grids through Monitoring and Ranking. [Citation Graph (, )][DBLP]


  29. An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets. [Citation Graph (, )][DBLP]


  30. Designing Mechanisms for Reliable Internet-based Computing. [Citation Graph (, )][DBLP]


  31. On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. [Citation Graph (, )][DBLP]


  32. On the complexity of asynchronous gossip. [Citation Graph (, )][DBLP]


  33. On the robustness of (semi) fast quorum-based implementations of atomic shared memory. [Citation Graph (, )][DBLP]


  34. Meeting the deadline: on the complexity of fault-tolerant continuous gossip. [Citation Graph (, )][DBLP]


  35. On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. [Citation Graph (, )][DBLP]


  36. A Hybrid Fault-Tolerant Algorithm for MPLS Networks. [Citation Graph (, )][DBLP]


Search in 0.081secs, Finished in 0.082secs
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