Publications of E. Nardelli

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  1999, with author Nardelli E., in the category Articles in Collections and Proceedings (or show them all):   (Items found: 5)

1999  [top]
  • Di Pasquale A., Nardelli E.: Balanced and Distributed Search Trees, in the Proceedings of 2nd International Workshop on Distributed Data and Structures {(WDAS'99)}, Breitbart Y., Das S., Santoro N., Widmayer P. eds., Proceedings in Informatics, 6, Carleton-Scientific Princeton, NJ, 1999
  • Forlizzi L., Nardelli E.: An On-Line Algorithm for the MacNeille Completion of a Poset, in the Proceedings of Algorithms, Order and Applications (ORDAL'99), 1999
  • Nardelli E., Guido Proietti: S$^*$-tree: an Improved S$^+$-tree for Colored Images, in the Proceedings of 3rd East European Conference on Advances in Databases and Information Systems {(ADBIS'99)}, Eder J., Rozman I., Welzer T. eds., Lecture Notes in Computer Science, 1691, Springer-Verlag Maribor, Slovenia, 156-167, 1999
  • Nardelli E., Guido Proietti, Widmayer P.: How to Swap a Failing Edge of a Single Source Shortest Paths Tree, in the Proceedings of 5th International Conference on Computing and Combinatorics {(COCOON'99)}, Asano T., Imai H., Lee D.T., Nakano S., Tokuyama T. eds., Lecture Notes in Computer Science, 1627, Springer-Verlag Tokyo, Japan, 144-153, 1999
  • Nardelli E., Talamo M., Vocca P.: Efficient Searching for Multidimensional Data Made Simple, in the Proceedings of 7th Annual European Symposium on Algorithms {(ESA'99)}, Lecture Notes in Computer Science, Springer-Verlag Prague, Czech Republic, 1999
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -