No. Title Author Year
1 Crystal Structure Prediction via Oblivious Local Search Antypov, Dmytro et al. 2020
2 Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem Deligkas, Argyrios et al. 2019
3 How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? Akrida, Eleni C. et al. 2019
4 Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time Doty, David et al. 2018
5 Front Matter, Table of Contents, Preface, Conference Organization Potapov, Igor et al. 2018
6 LIPIcs, Volume 117, MFCS'18, Complete Volume Potapov, Igor et al. 2018
7 Temporal Vertex Cover with a Sliding Time Window Akrida, Eleni C. et al. 2018
8 The Price of Stability of Weighted Congestion Games Christodoulou, George et al. 2018
9 Binary Search in Graphs Revisited Deligkas, Argyrios et al. 2017
10 Deterministic Population Protocols for Exact Majority and Plurality Gasieniec, Leszek et al. 2017
11 On the Transformation Capability of Feasible Mechanisms for Programmable Matter Michail, Othon et al. 2017
12 Stably Computing Order Statistics with Arithmetic Population Protocols Mertzios, George B. et al. 2016
13 Strategic Contention Resolution with Limited Feedback Christodoulou, George et al. 2016
14 On the Fairness of Probabilistic Schedulers for Population Protocols Chatzigiannakis, Ioannis et al. 2010
15 A Cost Mechanism for Fair Pricing of Resource Usage Mavronicolas, Marios et al. 2006
16 Cost Sharing Mechanisms for Fair Pricing of Resources Usage Mavronicolas, Marios et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 16


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI