No. Title Author Year
1 Crystal Structure Prediction via Oblivious Local Search Antypov, Dmytro et al. 2020
2 Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle Deligkas, Argyrios et al. 2020
3 Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem Deligkas, Argyrios et al. 2019
4 How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? Akrida, Eleni C. et al. 2019
5 Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time Doty, David et al. 2018
6 Temporal Vertex Cover with a Sliding Time Window Akrida, Eleni C. et al. 2018
7 The Price of Stability of Weighted Congestion Games Christodoulou, George et al. 2018
8 Binary Search in Graphs Revisited Deligkas, Argyrios et al. 2017
9 Deterministic Population Protocols for Exact Majority and Plurality Gasieniec, Leszek et al. 2017
10 On the Transformation Capability of Feasible Mechanisms for Programmable Matter Michail, Othon et al. 2017
11 Stably Computing Order Statistics with Arithmetic Population Protocols Mertzios, George B. et al. 2016
12 A Cost Mechanism for Fair Pricing of Resource Usage Mavronicolas, Marios et al. 2006
13 Cost Sharing Mechanisms for Fair Pricing of Resources Usage Mavronicolas, Marios et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 13


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