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
2001, with author ALL, in the category Articles in Collections
(or show them all): (Items found: 10)
2001 [top]
- Arcieri F., Cappadozzi E., Melideo G., Nardelli E., Naggar P., Talamo M.: A formal model for data coherence maintenance, Lecture Notes in Computer Science, Springer-Verlag, 2001
- Bielli M., Carotenuto P.: Genetic algorithms and transportation analysis: review and perspectives for bus network optimization, in: New analytical advances in transportation and spatial dynamics, Gastaldi , Reggiani eds., Ashgate Publ., 2001
- De Santis A., Germani A., Jetto L.: Space-Variant Two-Dimensional Filtering of Noisy Images, in: Advances in Imaging and Electron Physics, 119, Academic Press, 2001
- Di Pasquale A., Nardelli E.: A Very Efficient Order Preserving Scalable Distributed Data Structure, Lecture Notes in Computer Science, 2113, Springer-Verlag, 186-199, 2001
- Di Pasquale A., Nardelli E.: ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs, Lecture Notes in Computer Science, 2234, Springer-Verlag, 211-222, 2001
- Elf M., Gutwenger C., Jünger M., Giovanni Rinaldi: Branch-and-Cut Algorithms for Combinatorial Optimization and their Implementation in ABACUS, Jünger M., Naddef D. eds., Lecture Notes in Computer Science, 2241, Springer-Verlag, 157-222, 2001
- Fioravanti F., Alberto Pettorossi, Maurizio Proietti: Automated Strategies for Specializing Constraint Logic Programs, Lecture Notes in Computer Science, 2042, Springer-Verlag, 124-146, 2001
- Anna Galluccio, Guido Proietti: Polynomial-time algorithms for edge-connectivity augmentation of Hamiltonian paths, Lecture Notes in Computer Science, 2223, Springer-Verlag, 345-354, 2001
- Nardelli E., Guido Proietti, Widmayer P.: Finding the Most Vital Node of a Shortest Path, Lecture Notes in Computer Science, 2108, Springer-Verlag, 278-287, 2001
- Pirillo G.: A curious characteristic property of standard Sturmian words, in: Algebraic combinatorics and computer science, Springer Italia, Milan, 541-546, 2001
|
