Search Results for author: Andreas Pavlogiannis

Found 3 papers, 0 papers with code

Invasion Dynamics in the Biased Voter Process

no code implementations20 Jan 2022 Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec

We show that the problem is NP-hard for both $r>1$ and $r<1$, while the latter case is also inapproximable within any multiplicative factor.

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

no code implementations26 Oct 2015 Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time.

Programming Languages Data Structures and Algorithms F.3.2

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks

no code implementations8 Sep 2014 Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid

We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w. r. t.

Data Structures and Algorithms Systems and Control

Cannot find the paper you are looking for? You can Submit a new open access paper.