Articles dans des revues sans comité de lecture (8)
  1. 5. Cabello, S., Cardinal, J., Iacono, J., Langerman, S., Morin, P., & Ooms, A. (2019). Encoding 3SUM. arXiv.org.
  2. 6. Cardinal, J., Joret, G., & Roland, J. (2019). Information-theoretic lower bounds for quantum sorting. arXiv.org., 1902.06473.
  3. 7. Cardinal, J., Chan, T. M., Iacono, J., Langerman, S., & Ooms, A. (2018). Subquadratic Encodings for Point Configurations. arXiv.org.
  4. 8. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2016). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. arXiv.org.
    5.   Communications publiées lors de congrès ou colloques nationaux et internationaux (37)
  5. 1. 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
  6. 2. 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
  7. 3. Cardinal, J., Dallant, J., & Iacono, J. (2021). Approximability of (Simultaneous) Class Cover for Boxes. Proceedings of the 33rd Canadian Conference on Computational Geometry
  8. 4. 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
  9. 5. 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.
  10. 6. 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
  11. 7. Cardinal, J., Iacono, J., & Ooms, A. (2016). Solving k-SUM Using Few Linear Queries. Leibniz International Proceedings in Informatics. Vol. 57.
  12. 8. Cardinal, J., & Hoffmann, U. (2015). Recognition and Complexity of Point Visibility Graphs. 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands (pp. 171-185). doi:10.4230/LIPIcs.SOCG.2015.171
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>