Chryssis Georgiou

According to our database1, Chryssis Georgiou
  • authored at least 98 papers between 2000 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation.
Future Generation Comp. Syst., 2018

2017
Adaptive packet scheduling over a wireless channel under constrained jamming.
Theor. Comput. Sci., 2017

Coordinated cooperative task computing using crash-prone processors with unreliable multicast.
J. Parallel Distrib. Comput., 2017

Self-stabilizing Reconfiguration.
Proceedings of the Networked Systems - 5th International Conference, 2017

Competition: Dynamic Alternative Path Selection in Wireless Sensor Networks.
Proceedings of the 2017 International Conference on Embedded Wireless Systems and Networks, 2017

2016
Measuring the impact of adversarial errors on packet scheduling strategies.
J. Scheduling, 2016

Traceable Objects: Consistent Versioning for Concurrent Objects.
CoRR, 2016

Self-stabilizing Reconfiguration.
CoRR, 2016

Internet Computing: Using Reputation to Select Workers from a Pool.
CoRR, 2016

Multi-round Master-Worker Computing: A Repeated Game Approach.
Proceedings of the 35th IEEE Symposium on Reliable Distributed Systems, 2016

Internet Computing: Using Reputation to Select Workers from a Pool.
Proceedings of the Networked Systems - 4th International Conference, 2016

Cover-ability: Consistent versioning in asynchronous, fail-prone, message-passing environments.
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

Self-stabilizing Reconfiguration.
Proceedings of the Posters and Demos Session of the 17th International Middleware Conference, 2016

2015
Online parallel scheduling of non-uniform tasks: Trading failures for energy.
Theor. Comput. Sci., 2015

On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts.
J. Parallel Distrib. Comput., 2015

Practically Stabilizing Virtual Synchrony.
CoRR, 2015

Multi-round Master-Worker Computing: a Repeated Game Approach.
CoRR, 2015

Self-stabilizing Virtual Synchrony.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation.
Proceedings of the Adaptive Resource Management and Scheduling for Cloud Computing, 2015

Packet Scheduling over a Wireless Channel: AQT-Based Constrained Jamming.
Proceedings of the Networked Systems - Third International Conference, 2015

Risk Modeling and Analysis of Interdependencies of Critical Infrastructures Using Colored Timed Petri Nets.
Proceedings of the Human Aspects of Information Security, Privacy, and Trust, 2015

Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing.
IEEE Trans. Computers, 2014

Coordinated Cooperative Work Using Undependable Processors with Unreliable Broadcast.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

2013
Asynchronous gossip.
J. ACM, 2013

Reputation-based Mechanisms for Evolutionary Master-Worker Computing.
CoRR, 2013

Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion.
CoRR, 2013

Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy.
CoRR, 2013

Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies.
CoRR, 2013

Applying the dynamics of evolution to achieve reliability in master-worker computing.
Concurrency and Computation: Practice and Experience, 2013

Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies.
Proceedings of the Structural Information and Communication Complexity, 2013

A distributed algorithm for gathering many fat mobile robots in the plane.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Reputation-Based Mechanisms for Evolutionary Master-Worker Computing.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Tempo-Toolkit: Tempo to Java Translation Module.
Proceedings of the 2013 IEEE 12th International Symposium on Network Computing and Applications, 2013

Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Reliable Internet-Based Master-Worker Computing in the Presence of Malicious Workers.
Parallel Processing Letters, 2012

A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane
CoRR, 2012

The Role of Twitter in YouTube Videos Diffusion.
Proceedings of the Web Information Systems Engineering - WISE 2012, 2012

Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

On the Practicality of Atomic MWMR Register Implementations.
Proceedings of the 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, 2012

Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011
Cooperative Task-Oriented Computing: Algorithms and Complexity
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2011

Meeting the deadline: on the complexity of fault-tolerant continuous gossip.
Distributed Computing, 2011

On the Practicality of Atomic MWMR Register Implementations
CoRR, 2011

Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

Confidential Gossip.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

2010
Meeting the deadline: on the complexity of fault-tolerant continuous gossip.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

On the Automated Implementation of Time-Based Paxos Using the IOA Compiler.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Developing a Consistent Domain-Oriented Distributed Object Service.
IEEE Trans. Parallel Distrib. Syst., 2009

Automated implementation of complex distributed algorithms specified in the IOA language.
STTT, 2009

Game-theoretic aspects of distributed computing.
SIGACT News, 2009

Selfish Routing in the Presence of Network Uncertainty.
Parallel Processing Letters, 2009

Fault-tolerant semifast implementations of atomic read/write registers.
J. Parallel Distrib. Comput., 2009

On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

2008
Metadata Ranking and Pruning for Failure Detection in Grids.
Parallel Processing Letters, 2008

A Hybrid Fault-Tolerant Algorithm for MPLS Networks.
Proceedings of the Wired/Wireless Internet Communications, 6th International Conference, 2008

On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On the robustness of (semi) fast quorum-based implementations of atomic shared memory.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

On the complexity of asynchronous gossip.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Identifying Failures in Grids through Monitoring and Ranking.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Designing Mechanisms for Reliable Internet-based Computing.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity.
Springer, ISBN: 978-0-387-30918-7, 2008

2007
Long-lived Rambo: Trading knowledge for communication.
Theor. Comput. Sci., 2007

Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency.
Parallel Processing Letters, 2007

A formal treatment of an abstract channel implementation using java sockets and TCP.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Failrank: Towards a Unified Grid Failure Monitoring and Ranking System.
Proceedings of the Making Grids Work: Proceedings of the CoreGRID Workshop on Programming Models Grid and P2P System Architecture Grid Systems, 2007

2006
A Report from DISC 2005, the 19th International Symposium on Distributed Computing.
Bulletin of the EATCS, 2006

Eight Open Problems in Distributed Computing.
Bulletin of the EATCS, 2006

Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Reliably Executing Tasks in the Presence of Untrusted Entities.
Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), 2006

Fault-tolerant semifast implementations of atomic read/write registers.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Network uncertainty in selfish routing.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
Efficient gossip and robust distributed computation.
Theor. Comput. Sci., 2005

The Do-All problem with Byzantine processor failures.
Theor. Comput. Sci., 2005

Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups.
SIAM J. Comput., 2005

Reliably Executing Tasks in the Presence of Malicious Processors.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Developing a Consistent Domain-Oriented Distributed Object Service.
Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications (NCA 2005), 2005

Automated Implementation of Complex Distributed Algorithms Specified in the IOA Language.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004
Analysis of memory access concurrency in robust parallel algorithms.
Stud. Inform. Univ., 2004

The complexity of synchronous iterative Do-All with crashes.
Distributed Computing, 2004

Long-Lived Rambo: Trading Knowledge for Communication.
Proceedings of the Structural Information and Communication Complexity, 2004

2003
Cooperative computing with fragmentable and mergeable groups.
J. Discrete Algorithms, 2003

Efficient Gossip and Robust Distributed Computation.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Work-competitive scheduling for cooperative computing with dynamic groups.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

The Do-All Problem with Byzantine Processor Failures.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Distributed Cooperation and Adversity: Complexity Trade-Offs.
Proceedings of the PCK50, 2003

2002
Optimally work-competitive scheduling for cooperative computing with merging groups.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Failure sensitive analysis for parallel algorithm with controlled memory access concurrency.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2001
The Complexity of Synchronous Iterative Do-All with Crashes.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Cooperative computing with fragmentable and mergeable groups.
Proceedings of the SIROCCO 7, 2000

The Complexity of Distributed Cooperation in the Presence of Failures.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000


  Loading...