Articles dans des revues sans comité de lecture (47)

  1. 41. Iacono, J. (2011). Improved Upper Bounds for Pairing Heaps. arXiv.org.
  2. 42. Iacono, J., & Özkan, Ö. (2010). Mergeable Dictionaries. arXiv.org.
  3. 43. Elmasry, A., Farzan, A., & Iacono, J. (2010). Priority Queues with Multiple Time Fingers. arXiv.org.
  4. 44. Demaine, E. D., Demaine, M. L., Hart, V., Iacono, J., Langerman, S., & O'Rourke, J. (2009). Continuous Blooming of Convex Polyhedra. arXiv.org.
  5. 45. Aloupis, G., Demaine, E. D., Demaine, M. L., Dujmović, V. V., & Iacono, J. (2009). Minimum feature size preserving decompositions. arXiv.org.
  6. 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.
  7. 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.
  8.   Communications publiées lors de congrès ou colloques nationaux et internationaux (49)

  9. 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).
  10. 2. Aronov, B. B., Cardinal, J., Dallant, J., & Iacono, J. (2024). A General Technique for Searching in Implicit Sets via Function Inversion. In 2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024 2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024 (pp. 215-223) SIAM. doi:10.1137/1.9781611977936.20
  11. 3. Collette, S., & Iacono, J. (2024). Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024 Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024 (pp. 2657-2678) SIAM. doi:10.1137/1.9781611977912.95
  12. 4. 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).
  13. 5. 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

  14. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Suivant >>