Articles dans des revues sans comité de lecture (47)
  1. 46. El-Khechen, D., Iacono, J., Fevens, T. T., & Rote, G. (2008). Partitioning a Polygon into Two Mirror Congruent Pieces. Proceedings of the annual ACM Symposium on Computational Geometry.
  2. 47. Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2005). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. arXiv.org.
    3.   Communications publiées lors de congrès ou colloques nationaux et internationaux (47)
  3. 1. Dallant, J., & Iacono, J. (2022). Conditional Lower Bounds for Dynamic Geometric Measure Problems. Leibniz international proceedings in informatics. Vol. 244 ESA 2022(September 5, 2022 - September 9, 2022: Potsdam, Germany).
  4. 2. Das, R., Iacono, J., & Nekrich, Y. (2022). External-Memory Dictionaries with Worst-Case Update Cost. 33rd International Symposium on Algorithms and Computation. Vol. 248 (pp. 1-21) 33rd International Symposium on Algorithms and Computation(December 19-21, 2022: Seoul, Korea).
  5. 3. Dallant, J., & Iacono, J. (2022). How Fast Can We Play Tetris Greedily with Rectangular Pieces? Leibniz international proceedings in informatics, v226,13(ISSN:1868-8969). Vol. 226 11th International Conference on Fun with Algorithms (FUN 2022)(May 30 to June 3, 2022: Island of Favignana, Sicily, Italy). doi:10.4230/LIPIcs.FUN.2022.13
  6. 4. Afshani, P., Iacono, J., Varunkumar Jayapaul, V., Karsin, B., & Sitchinava, N. (2022). Locality-of-Reference Optimality of Cache-Oblivious Algorithms. 3rd Symposium on Algorithmic Principles of Computer Systems, APOCS (pp. 31-45) 3rd Symposium on Algorithmic Principles of Computer Systems, APOCS(January 12, 2022: Virtual Conference / Alexandria, Virginia, USA).
  7. 5. Cardinal, J., Dallant, J., & Iacono, J. (2021). An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. Leibniz International Proceedings in Informatics. Vol. 204 29th Annual European Symposium on Algorithms (ESA 2021)(September 6-10, 2021). doi:10.4230/LIPIcs.ESA.2021.24
  8. 6. Cardinal, J., & Iacono, J. (2021). Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. In H. Viet Le & V. King (Eds.), 4th Symposium on Simplicity in Algorithms (pp. 45-56) SIAM. doi:10.1137/1.9781611976496.5
  9. 7. Cardinal, J., Dallant, J., & Iacono, J. (2021). Approximability of (Simultaneous) Class Cover for Boxes. Proceedings of the 33rd Canadian Conference on Computational Geometry
  10. 8. 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
  11. 9. 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
  12. 10. 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
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>