Communications publiées lors de congrès ou colloques nationaux et internationaux (49)
  1. 6. 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).
  2. 7. 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
  3. 8. Cardinal, J., Dallant, J., & Iacono, J. (2021). Approximability of (Simultaneous) Class Cover for Boxes. Proceedings of the 33rd Canadian Conference on Computational Geometry
  4. 9. 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
  5. 10. 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
  6. 11. Iacono, J., Karsin, B., & Koumoutsos, G. (2019). External Memory Planar Point Location with Fast Updates. Leibniz international proceedings in informatics, 58:1-58:18. doi:10.4230/LIPIcs.ISAAC.2019.58
  7. 12. 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
  8. 13. Aloupis, G., JongHyokChoe,, JunYopChoe,, Iacono, J., HyonWungJo,, CholHunKim,, KwangHoKim,, YongKukKim,, Langerman, S., DokNamLee,, & HyonIlO, (2018). Covering Points with Disjoint Translates of a Triangle. Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^3$ 2018)
  9. 14. Arseneva, E., Bahoo, Y., Biniaz, A., Cano Vila, M. D. P., Chanchary, F., Iacono, J., Jain, K., Lubiw, A., Mondal, D., Sheikhan, K., & Tóth, C. C. (2018). Compatible Paths on Labelled Point Sets. Proceedings of the 30th Canadian Conference on Computational Geometry (pp. 54-60) Canadian Conference on Computational Geometry (CCCG)(30: 2018, August 8-10, 2018: Manitoba, Canada).
  10. 15. Barba, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2017). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Leibniz International Proceedings in Informatics. Vol. 77.
  11. 16. Cardinal, J., Chan, T. M., Iacono, J., Langerman, S., & Ooms, A. (2017). Subquadratic-Space Query-Efficient Data Structures for Realizable Order Types. Annual Fall Workshop on Computational Geometry
  12. 17. Aronov, B. B., Iacono, J., & Sheikhan, K. (2017). Nearest-Neighbor Search Under Uncertainty. Proceedings of the 29th Canadian Conference on Computational Geometry (pp. 89-94) (July 26-28, 2017: Ottawa).
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Suivant >>