No. |
Title |
Author |
Year |
---|

1 |
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem |
Deligkas, Argyrios et al. |
2019 |

2 |
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? |
Akrida, Eleni C. et al. |
2019 |

3 |
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time |
Doty, David et al. |
2018 |

4 |
Temporal Vertex Cover with a Sliding Time Window |
Akrida, Eleni C. et al. |
2018 |

5 |
The Price of Stability of Weighted Congestion Games |
Christodoulou, George et al. |
2018 |

6 |
Binary Search in Graphs Revisited |
Deligkas, Argyrios et al. |
2017 |

7 |
Deterministic Population Protocols for Exact Majority and Plurality |
Gasieniec, Leszek et al. |
2017 |

8 |
On the Transformation Capability of Feasible Mechanisms for Programmable Matter |
Michail, Othon et al. |
2017 |

9 |
Stably Computing Order Statistics with Arithmetic Population Protocols |
Mertzios, George B. et al. |
2016 |

10 |
A Cost Mechanism for Fair Pricing of Resource Usage |
Mavronicolas, Marios et al. |
2006 |