Articles dans des revues sans comité de lecture (5)
  1. 4. Bose, P., Cardinael, J.-P., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Competitive Online Search Trees on Trees. arXiv.org.
  2. 5. Iacono, J., Karsin, B., & Koumoutsos, G. (2019). External Memory Planar Point Location with Fast Updates. arXiv.org.
    3.   Communications publiées lors de congrès ou colloques nationaux et internationaux (10)
  3. 1. Christou, D., Fotakis, D., & Koumoutsos, G. (2021). Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. International Workshop on Approximation and Online Algorithms - WAOA(2020)
  4. 2. Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., & Langerman, S. (2020). Competitive Online Search Trees on Trees. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1878-1891) Philadelphia: SIAM. doi:10.1137/1.9781611975994.115
  5. 3. Fotakis, D., Kavouras, L., Koumoutsos, G., Skoulakis, S., & Vardas, M. (2020). The Online Min-Sum Set Cover Problem. (pp. 51:1-51:16) International Colloquium on Automata, Languages, Processing - ICALP(2020). doi:10.4230/LIPIcs.ICALP.2020.51
  6. 4. Demaine, E., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Belga B-Trees. (pp. 93-105) International Computer Science Symposium in Russia - CSR(2019). doi:10.1007/978-3-030-19955-5_9
  7. 5. Iacono, J., Karsin, B., & Koumoutsos, G. (2019). External Memory Planar Point Location with Fast Updates. (pp. 58:1-58:18) International Symposium on Algorithms and Computation - ISAAC(2019). doi:10.4230/LIPIcs.ISAAC.2019.58
  8. 6. Bansal, N., Böhm, M., Eliáš, M., Koumoutsos, G., & Umboh, S. W. (2018). Nested Convex Bodies are Chaseable. (pp. 1253-1260) ACM-SIAM Symposium on Discrete Algorithms - SODA(2018). doi:10.1137/1.9781611975031.81
  9. 7. Bansal, N., Eliáš, M., Koumoutsos, G., & Nederlof, J. (2018). Competitive Algorithms for Generalized k-Server in Uniform Metrics. (pp. 992-1001) ACM-SIAM Symposium on Discrete Algorithms - SODA(2018). doi:10.1137/1.9781611975031.64
  10. 8. Bansal, N., Eliáš, M., Jez, L., & Koumoutsos, G. (2017). The (h,k)-Server Problem on Bounded Depth Trees. (pp. 1022-1037) ACM-SIAM Symposium on Discrete Algorithms - SODA(2017).
  11. 9. Bansal, N., Eliáš, M., & Koumoutsos, G. (2017). Weighted k-Server Bounds via Combinatorial Dichotomies. (pp. 493-504) IEEE Symposium on Foundations of Computer Science - FOCS(2017). doi:10.1109/FOCS.2017.52
  12. 10. Bansal, N., Eliáš, M., Jez, L., Koumoutsos, G., & Pruhs, K. (2015). Tight Bounds for Double Coverage Against Weak Adversaries. Workshop on Approximation and Online Algorithms - WAOA (pp. 47-58) (2015). doi:10.1007/978-3-319-28684-6_5
    13. << Précédent 1 2 3 Suivant >>