Articles dans des revues avec comité de lecture (99)
  1. 37. Bose, P., Iacono, J., Douieb, K., & Langerman, S. (2014). The power and limitations of static binary search trees with lazy finger. Lecture notes in computer science, 8889, 181-192. doi:10.1007/978-3-319-13075-0_15
  2. 38. Bremner, D., Chan, T. M., Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., Pǎtraşcu, M., & Taslakian, P. (2014). Necklaces, convolutions, and X+Y. Algorithmica, 69(2), 294-314. doi:10.1007/s00453-012-9734-3
  3. 39. Davoodi, P., Fineman, J. J., Iacono, J., & Özkan, Ö. (2014). Cache-oblivious persistence. Lecture notes in computer science, 8737, 296-308. doi:10.1007/978-3-662-44777-2_25
  4. 40. Iacono, J., & Özkan, Ö. (2014). Why some heaps support constant-amortized-time decrease-key operations, and others do not. Lecture notes in computer science, 8572, 637-649. doi:10.1007/978-3-662-43948-7_53
  5. 41. Aloupis, G., Iacono, J., Langerman, S., Özkan, Ö., & Wuhrer, S. S. (2014). The Complexity of Order Type Isomorphism. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 405-415. doi:10.1137/1.9781611973402.30
  6. 42. Elmasry, A., Farzan, A., & Iacono, J. (2013). On the hierarchy of distribution-sensitive properties for data structures. Acta informatica, 50(4), 289-295. doi:10.1007/s00236-013-0180-8
  7. 43. Chen, D., Devillers, O., Iacono, J., Langerman, S., & Morin, P. P. (2013). Oja centers and centers of gravity. Computational geometry, 46(2), 140-147. doi:10.1016/j.comgeo.2012.04.004
  8. 44. Ballinger, B., Benbernou, N., Bose, P., Damian, M., Demaine, E. D., Dujmović, V. V., Flatland, R. R., Hurtado, F., Iacono, J., Lubiw, A., Morin, P., Sacristán, V., Souvaine, D., & Uehara, R. (2013). Coverage with k-transmitters in the presence of obstacles. Journal of combinatorial optimization, 25(2), 208-233. doi:10.1007/s10878-012-9475-x
  9. 45. Aloupis, G., Benbernou, N., Damian, M., Demaine, E. D., Flatland, R. R., Iacono, J., & Wuhrer, S. S. (2013). Efficient reconfiguration of lattice-based modular robots. Computational geometry, 46(8), 917-928. doi:10.1016/j.comgeo.2013.03.004
  10. 46. Demaine, E. D., Iacono, J., Langerman, S., & Özkan, Ö. (2013). Combining binary search trees. Lecture notes in computer science, 7965 LNCS(PART 1), 388-399. doi:10.1007/978-3-642-39206-1_33
  11. 47. Iacono, J. (2013). In pursuit of the dynamic optimality conjecture. Lecture notes in computer science, 8066, 236-250. doi:10.1007/978-3-642-40273-9_16
  12. 48. Grossi, R., Iacono, J., Navarro, G., Raman, R., & Rao, S. S. (2013). Encodings for range selection and top-k queries. Lecture notes in computer science, 8125, 553-564. doi:10.1007/978-3-642-40450-4_47
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>