| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics | Klootwijk, Stefan et al. | 2020 |
| 2 | Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) | Manthey, Bodo et al. | 2017 |
| 3 | Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372) | Balcan, Marina-Florina et al. | 2015 |
| 4 | On Approximating Multi-Criteria TSP | Manthey, Bodo | 2009 |
| 5 | Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise | Manthey, Bodo et al. | 2007 |
| 6 | Approximability of Minimum AND-Circuits | Arpe, Jan et al. | 2006 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |