Chryssis Georgiou

Orcid: 0000-0003-4360-0260

Affiliations:
  • University of Cyprus, Nicosia, Cyprus


According to our database1, Chryssis Georgiou authored at least 115 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Atomic Appends in Asynchronous Byzantine Distributed Ledgers.
J. Parallel Distributed Comput., December, 2023

Self-stabilizing Byzantine-Tolerant Recycling.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

2022
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions.
Theory Comput. Syst., 2022

Implementing three exchange read operations for distributed atomic storage.
J. Parallel Distributed Comput., 2022

Validated Objects: Specification, Implementation, and Applications.
CoRR, 2022

A Survey on Mobility in Wireless Sensor Networks.
Ad Hoc Networks, 2022

A Decentralized Node Placement Algorithm for WSNs and IoT Networks.
Proceedings of the 8th IEEE World Forum on Internet of Things, 2022

Fragmented ARES: Dynamic Storage for Large Objects.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

A Centralized Node Placement Algorithm in WSNs and IoT Networks.
Proceedings of the Global Information Infrastructure and Networking Symposium, 2022

Utilizing Carriers for the Energy Node Placement Algorithm in WSNs and IoT Networks.
Proceedings of the 18th International Conference on Distributed Computing in Sensor Systems, 2022

2021
Principles of Blockchain Systems
Synthesis Lectures on Computer Science, Morgan & Claypool Publishers, ISBN: 978-3-031-01807-7, 2021

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values.
Theor. Comput. Sci., 2021

The CoronaSurveys System for COVID-19 Incidence Data Collection and Processing.
Frontiers Comput. Sci., 2021

Estimating Active Cases of COVID-19.
CoRR, 2021

Fragmented Objects: Boosting Concurrency of SharedLarge Objects.
CoRR, 2021

Fragmented Objects: Boosting Concurrency of Shared Large Objects.
Proceedings of the Structural Information and Communication Complexity, 2021

Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems.
Proceedings of the Networked Systems - 9th International Conference, 2021

Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications.
Proceedings of the 4th International Symposium on Foundations and Applications of Blockchain 2021, 2021

Energy Efficient Mechanism for Reusing Mobile Nodes in WSN and IoT Networks.
Proceedings of the 17th International Conference on Distributed Computing in Sensor Systems, 2021

2020
Confidential gossip.
Distributed Comput., 2020

A Self-stabilizing Control Plane for the Edge and Fog Ecosystems.
CoRR, 2020

(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations.
CoRR, 2020

CoronaSurveys: Using Surveys with Indirect Reporting to Estimate the Incidence and Evolution of Epidemics.
CoRR, 2020

Appending Atomically in Byzantine Distributed Ledgers.
CoRR, 2020

A Self-stabilizing Control Plane for Fog Ecosystems.
Proceedings of the 13th IEEE/ACM International Conference on Utility and Cloud Computing, 2020

Atomic Appends in Asynchronous Byzantine Distributed Ledgers.
Proceedings of the 16th European Dependable Computing Conference, 2020

2019
Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems.
CoRR, 2019

Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Atomic Appends: Selling Cars and Coordinating Armies with Multiple Distributed Ledgers.
Proceedings of the International Conference on Blockchain Economics, 2019

Utilizing Mobile Nodes for Congestion Control in Wireless Sensor Networks.
Proceedings of the 30th IEEE Annual International Symposium on Personal, 2019

Self-stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems.
Proceedings of the Networked Systems - 7th International Conference, 2019

Self-stabilization Overhead: A Case Study on Coded Atomic Storage.
Proceedings of the Networked Systems - 7th International Conference, 2019

2018
Formalizing and Implementing Distributed Ledger Objects.
SIGACT News, 2018

Practically-self-stabilizing virtual synchrony.
J. Comput. Syst. Sci., 2018

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

Self-stabilization Overhead: an Experimental Case Study on Coded Atomic Storage.
CoRR, 2018

Session details: Session 2D: Consensus.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Unleashing and Speeding Up Readers in Atomic Object Implementations.
Proceedings of the Networked Systems - 6th International Conference, 2018

Self-stabilizing Byzantine Tolerant Replicated State Machine Based on Failure Detectors.
Proceedings of the Cyber Security Cryptography and Machine Learning, 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 Distributed 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. Sched., 2016

Traceable Objects: Consistent Versioning for Concurrent Objects.
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

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 Distributed Comput., 2015

Practically Stabilizing Virtual Synchrony.
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

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

Applying the dynamics of evolution to achieve reliability in master-worker computing.
Concurr. Comput. Pract. Exp., 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

2012
Reliable Internet-Based Master-Worker Computing in the Presence of Malicious Workers.
Parallel Process. Lett., 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, ISBN: 978-3-031-02005-6, 2011

Meeting the deadline: on the complexity of fault-tolerant continuous gossip.
Distributed Comput., 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

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 Distributed Syst., 2009

Automated implementation of complex distributed algorithms specified in the IOA language.
Int. J. Softw. Tools Technol. Transf., 2009

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

Selfish Routing in the Presence of Network Uncertainty.
Parallel Process. Lett., 2009

Fault-tolerant semifast implementations of atomic read/write registers.
J. Parallel Distributed 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 Process. Lett., 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 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 Process. Lett., 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.
Bull. EATCS, 2006

Eight Open Problems in Distributed Computing.
Bull. 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

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

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

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

2003
Cooperative computing with fragmentable and mergeable groups.
J. Discrete Algorithms, 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

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...