italiano | contact
PUBLICATIONS

Special Issues/Journals/Books Proceedings Chapter Technical Report

«      1   |   2   |   3   |   4      »      

1999

M. Flammini. Deadlock-Free Interval Routing Schemes, Networks (34):1, pagg. 47-60

S.Cicerone, G.Di Stefano, M.Flammini. Compact-Port Routing Models and Applications to Distance-Hereditary Graphs, 6th Colloquium on Structural Information and Communication Complexity (SIROCCO)

1998

M. Flammini, A.Marchetti Spaccamela, J.van Leeuwen. The Complexity of Interval Routing on Random Graphs, The Computer Journal (41):1, pagg. 16-25

M. Flammini, G.Gambosi, U.Nanni, R.B.Tan. Multi-dimensional Interval Routing Schemes, Theoretical Computer Science (205):1-2, pagg. 115-133

T.Eilam, M.Flammini, S.Zaks. A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load, Parallel Processing Letters (8):2, pagg. 207-220

S.Cicerone, G.Di Stefano, M.Flammini. Static and Dynamic Low-Congested Interval Routing Schemes, 25th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science

M. Flammini, G.Gambosi, U.Nanni, R.B.Tan. Characterization Results of All Shortest Paths Interval Routing Schemes, 5th Colloquium on Structural Information and Communication Complexity (SIROCCO)

1997

M. Flammini, G.Gambosi. On Devising Boolean Routing Schemes, Theoretical Computer Science (186):1-2, pagg. 171-198

M. Flammini. On the Hardness of Devising Interval Routing Schemes, Parallel Processing Letters (7):1, pagg. 39-47

M. Flammini. Deadlock-Free Interval Routing Schemes, 14th Symposium of Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science

M. Flammini, S.Perennes. Lower Bounds on Systolic Gossiping, 11th IEEE International Parallel Processing Symposium (IPPS)

M. Flammini, C.Scheideler. Simple and Efficient Routing Schemes for All-Optical Networks, 9th ACM Annual Symposium on Parallel Algorithms and Architectures (SPAA)

T.Eilam, M.Flammini, S.Zaks. A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load, 24th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science

M. Flammini, E.Nardelli, G.Proietti. ATM Layouts with Bounded Hop Count and Congestion, 11th Int. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science

J.C.Bermond, M.Di Ianni, M.Flammini, S.Perennes. Acyclic Orientations for Deadlock Prevention in Interconnection Networks, 23rd Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science

C.Arbib, M.Flammini, E.Nardelli. Graph Visitability, Twente Workshop on Graphs and Combinatorial Optimization

1996

M. Flammini, G.Gambosi, S.Salomone. Interval Routing Schemes, Algoritmica (16):6, pagg. 549-568

1995

M. Flammini, G.Gambosi, S.Salomone. Interval Routing Schemes, 12th Symposium of Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science

M. Flammini, A.Marchetti Spaccamela, J.van Leeuwen. The Complexity of Interval Routing on Random Graphs, 20th Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science

M. Flammini, G.Gambosi, S.Salomone. On Devising Boolean Routing Schemes, 21st Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science

 
 
 
 

Organization

Head of the department is Prof. Claudio Arbib (since March 1, 2008). The ...

continua ›
 
 
 
 

Publications

Numerous articles published in international scientific journals, books, and ...

continua ›
 
 
 
 

Job Postings

Consulta le offerte di lavoro pervenute dalle aziende, potrai entrare in ...

continua ›