• Publications
  • Influence
The parallel complexity of the subgraph connectivity problem
It is shown that the problem of testing whether a graph G contains a vertex- (edge-) connected induced subgraph of cardinality k is P-complete for any fixed k>or=3. Moreover, it is shown thatExpand
  • 18
  • 1
  • PDF
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback
In this paper, we study contention resolution protocols from a game-theoretic perspective. In a recent work, we considered acknowledgment-based protocols, where a user gets feedback from the channelExpand
  • 3
  • 1
  • PDF
Radiocoloring Graphs via the Probabilistic Method ∗
We employ here the Probabilistic Method, a way of reasoning which shows existence of combinatorial structures and properties to prove refute conjectures. The radiocoloring problem (RCP) is theExpand
  • 3
FIFO is Unstable at Arbitrarily Low Rates ( Even in Planar Networks ) ∗
We prove that the FIFO (First-In-First-Out) protocol is unstable in the standard model of Adversarial Queueing Theory [7] for arbitrarily low rates of packet injection. In order to prove this, weExpand
  • 6
Direct Routing
Direct routing is a special case of bufferless routing in which packets are not allowed to conflict with each other. The task is to compute the injection times of the packets so that they don’tExpand
  • 2
  • PDF
An Interactive Cooperative Teleworking Environment-Tηλε μ αθεια ∗
In this paper we present the design and the implementation of an interactive environment for cooperative teleworking. Telemathea offers tools that support the communication and the teleworkingExpand
  • 5
  • PDF
Dss: a Tool for Simulation of Distributed Systems and Protocols through Communicating Finite State Machines
Environment-based simulation tools have a signiicant contribution to the simulation of large and complex concurrent and distributed systems. The users do not require sophisticated expertise in theExpand
  • 3
Weighted Random Sampling
  • 3
Car-sharing between two locations
In this paper, we consider an on-line scheduling problem that is motivated by applications such as car sharing, in which users submit ride requests, and the scheduler aims to accept requests ofExpand
  • 1
  • PDF