Orestis Konstantinidis

Papers

Total Citations

H-Index

About

Orestis Konstantinidis is a computer scientist whose research focuses on distributed computing, fault tolerance, and algorithmic game theory. His work addresses fundamental challenges in coordinating multiple agents in adversarial environments, particularly where Byzantine faults—arbitrary failures or malicious behaviors—can disrupt system reliability. His most-cited paper, "Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle" (2023), introduces novel protocols that enable a group of agents to safely evacuate a circular region even when up to f agents may act maliciously. This contribution bridges theoretical distributed algorithms with real-world applications in robotics, autonomous systems, and emergency response. While his citation count is still growing, the paper’s 2 citations reflect its early-stage impact within a niche but critical area. Konstantinidis’s work is notable for its rigorous mathematical foundations and practical implications, offering scalable solutions to coordination problems under uncertainty. His research continues to advance the design of resilient multi-agent systems, making him a rising voice in the field of fault-tolerant distributed protocols.