No. Title Author Year
1 Optimal Sorting with Persistent Comparison Errors Geissmann, Barbara et al. 2019
2 Resilient Dictionaries for Randomly Unreliable Memory Leucci, Stefano et al. 2019
3 Efficient Oracles and Routing Schemes for Replacement Paths BilÚ, Davide et al. 2018
4 On the Complexity of Two Dots for Narrow Boards and Few Colors BilÚ, Davide et al. 2018
5 On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games BilÚ, Davide et al. 2018
6 Optimal Dislocation with Persistent Errors in Subquadratic Time Geissmann, Barbara et al. 2018
7 Tracks from hell - when finding a proof may be easier than checking it Almanza, Matteo et al. 2018
8 An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner BilÚ, Davide et al. 2017
9 Sorting with Recurrent Comparison Errors Geissmann, Barbara et al. 2017
10 Compact and Fast Sensitivity Oracles for Single-Source Distances Bilo, Davide et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 13


DROPS-Home | Imprint | Privacy Published by LZI