Search the dblp DataBase
Michele Flammini :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Michele Flammini , Mordechai Shalom , Shmuel Zaks On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. [Citation Graph (0, 0)][DBLP ] CAAN, 2006, pp:72-85 [Conf ] Michele Flammini , Alberto Marchetti-Spaccamela , Ludek Kucera Learning DNF Formulae Under Classes of Probability Distributions. [Citation Graph (0, 0)][DBLP ] COLT, 1992, pp:85-92 [Conf ] Michele Flammini , Alfredo Navarra , Ralf Klasing , Stéphane Pérennes Improved approximation results for the minimum energy broadcasting problem. [Citation Graph (0, 0)][DBLP ] DIALM-POMC, 2004, pp:85-91 [Conf ] Michele Flammini , Gaia Nicosia On Multicriteria Online Problems. [Citation Graph (0, 0)][DBLP ] ESA, 2000, pp:191-201 [Conf ] Michele Flammini , Giorgio Gambosi , Alessandro Gasparini , Alfredo Navarra Dynamic Layouts for Wireless ATM. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2003, pp:1056-1063 [Conf ] Michele Flammini , Bruce M. Maggs , Jop F. Sibeyn , Berthold Vöcking Routing and Communication in Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2002, pp:735- [Conf ] Marco Autili , Michele Flammini , Paola Inverardi , Alfredo Navarra , Massimo Tivoli Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems. [Citation Graph (0, 0)][DBLP ] EWSA, 2006, pp:17-32 [Conf ] Ioannis Caragiannis , Michele Flammini , Christos Kaklamanis , Panagiotis Kanellopoulos , Luca Moscardelli Tight Bounds for Selfish and Greedy Load Balancing. [Citation Graph (0, 0)][DBLP ] ICALP (1), 2006, pp:311-322 [Conf ] Serafino Cicerone , Gabriele Di Stefano , Michele Flammini Static and Dynamic Low-Congested Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:592-603 [Conf ] Tamar Eilam , Michele Flammini , Shmuel Zaks A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:527-537 [Conf ] Vittorio Bilò , Michele Flammini On the IP Routing Tables Minimization with Addresses Reassignment. [Citation Graph (0, 0)][DBLP ] IPDPS, 2004, pp:- [Conf ] Vittorio Bilò , Michele Flammini , Luca Moscardelli Pareto Approximations for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP ] IPDPS, 2004, pp:- [Conf ] Vittorio Bilò , Adriano Di Pasquale , Fabio Fioravanti , Michele Flammini , Luca Forlizzi , Francesco Lo Presti , Giovanna Melideo , Enrico Nardelli , Alfredo Navarra , Guido Proietti Quality of Service in Wireless Networks. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:224- [Conf ] Michele Flammini , Giorgio Gambosi , Alfredo Navarra Wireless ATM Layouts for Chain Networks. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:220- [Conf ] Michele Flammini , Stephane Perennes Lower Bounds on Systolic Gossip. [Citation Graph (0, 0)][DBLP ] IPPS, 1997, pp:517-521 [Conf ] Vittorio Bilò , Michele Flammini , Giovanna Melideo , Luca Moscardelli On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:172-183 [Conf ] Michele Flammini , Luca Moscardelli , Mordechai Shalom , Shmuel Zaks Approximating the Traffic Grooming Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:915-924 [Conf ] Angelo Fanelli , Michele Flammini , Giovanna Melideo , Luca Moscardelli Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. [Citation Graph (0, 0)][DBLP ] MFCS, 2006, pp:363-374 [Conf ] Michele Flammini , Jan van Leeuwen , Alberto Marchetti-Spaccamela The Complexity of Interval Routing on Random Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 1995, pp:37-49 [Conf ] Michele Flammini , Giorgio Gambosi , Umberto Nanni , Richard B. Tan Characterization results of all shortest paths interval routing schemes. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1998, pp:201-213 [Conf ] Michele Flammini , Giorgio Gambosi , Sandro Salomone Interval Labeling Scheme for Chordal Rings. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1994, pp:111-124 [Conf ] Michele Flammini , Alfredo Navarra , Andrzej Proskurowski On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2003, pp:133-145 [Conf ] Serafino Cicerone , Gabriele Di Stefano , Michele Flammini Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1999, pp:62-77 [Conf ] Miriam Di Ianni , Michele Flammini , Rossella Flammini , Sandro Salomone Systolic Acyclic Orientations for Deadlock Prevention. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1995, pp:1-12 [Conf ] Vittorio Bilò , Chiara Di Francescomarino , Michele Flammini , Giovanna Melideo Sharing the cost of multicast transmissions in wireless networks. [Citation Graph (0, 0)][DBLP ] SPAA, 2004, pp:180-187 [Conf ] Michele Flammini , Christian Scheideler Simple, Efficient Routing Schemes for All-Optical Networks. [Citation Graph (0, 0)][DBLP ] SPAA, 1997, pp:170-179 [Conf ] Vittorio Bilò , Michele Flammini , Luca Moscardelli On Nash Equilibria in Non-cooperative All-Optical Networks. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:448-459 [Conf ] Michele Flammini Deadlock-Free Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] STACS, 1997, pp:351-362 [Conf ] Michele Flammini , Giorgio Gambosi , Sandro Salomone Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] STACS, 1995, pp:279-290 [Conf ] Michele Flammini , Giorgio Gambosi , Umberto Nanni , Richard B. Tan Multi-Dimensional Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] WDAG, 1995, pp:131-144 [Conf ] Michele Flammini , Giorgio Gambosi , Sandro Salomone Boolean Routing. [Citation Graph (0, 0)][DBLP ] WDAG, 1993, pp:219-233 [Conf ] Michele Flammini , Luca Moscardelli , Alfredo Navarra , Stéphane Pérennes Asymptotically Optimal Solutions for Small World Graphs. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:414-428 [Conf ] Michele Flammini , Enrico Nardelli , Guido Proietti ATM Layouts with Bounded Hop Count and Congestion. [Citation Graph (0, 0)][DBLP ] WDAG, 1997, pp:52-65 [Conf ] Michele Flammini , Mordechai Shalom , Shmuel Zaks On Minimizing the Number of ADMs in a General Topology Optical Network. [Citation Graph (0, 0)][DBLP ] DISC, 2006, pp:459-473 [Conf ] Adriano Di Pasquale , Michele Flammini , Enrico Nardelli Allocation Problems in Scalable Distributed Data Structures. [Citation Graph (0, 0)][DBLP ] WDAS, 2002, pp:133-142 [Conf ] Vittorio Bilò , Michele Flammini , Roberto Giovannelli Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP ] WEA, 2003, pp:33-46 [Conf ] Michele Flammini , Alfredo Navarra , Stéphane Pérennes The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. [Citation Graph (0, 0)][DBLP ] WEA, 2005, pp:22-31 [Conf ] Jean-Claude Bermond , Miriam Di Ianni , Michele Flammini , Stephane Perennes Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:52-64 [Conf ] Claudio Arbib , Michele Flammini , Fabrizio Marinelli Minimum Flow Time Graph Ordering. [Citation Graph (0, 0)][DBLP ] WG, 2003, pp:23-33 [Conf ] Michele Flammini , Giorgio Gambosi , Sandro Salomone On Devising Boolean Routing Schemes. [Citation Graph (0, 0)][DBLP ] WG, 1995, pp:222-236 [Conf ] Michele Flammini , Gianpiero Monaco , Luca Moscardelli , Mordechai Shalom , Shmuel Zaks Approximating the Traffic Grooming Problem in Tree and Star Networks. [Citation Graph (0, 0)][DBLP ] WG, 2006, pp:147-158 [Conf ] Michele Flammini , Giorgio Gambosi , Sandro Salomone Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:16, n:6, pp:549-568 [Journal ] Michele Flammini , Jan van Leeuwen , Alberto Marchetti-Spaccamela The Complexity of Interval Routing on Random Graphs. [Citation Graph (0, 0)][DBLP ] Comput. J., 1998, v:41, n:1, pp:16-25 [Journal ] Claudio Arbib , Michele Flammini On the upper chromatic number of (v3 , b2 )-configurations. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:3-12 [Journal ] Claudio Arbib , Michele Flammini , Enrico Nardelli How to Survive While Visiting a Graph. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:279-293 [Journal ] Jean-Claude Bermond , Miriam Di Ianni , Michele Flammini , Stephane Perennes Deadlock Prevention by Acyclic Orientations. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:129, n:1, pp:31-47 [Journal ] Michele Flammini , Gaia Nicosia Competitive algorithms for the bicriteria k-server problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:15, pp:2117-2127 [Journal ] Michele Flammini , Enrico Nardelli , Guido Proietti ATM layouts with bounded hop count and congestion. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2001, v:14, n:2, pp:65-73 [Journal ] Michele Flammini , Stéphane Pérennes Lower bounds on systolic gossip. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2005, v:196, n:2, pp:71-94 [Journal ] Michele Flammini On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:52, n:3, pp:167-173 [Journal ] Michele Flammini , Alfredo Navarra , Gaia Nicosia Efficient offline algorithms for the bicriteria k -server problem and online applications. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2006, v:4, n:3, pp:414-432 [Journal ] Michele Flammini , Alfredo Navarra , Stephane Perennes The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal ] Vittorio Bilò , Michele Flammini , Roberto Giovannelli Experimental analysis of online algorithms for the bicriteria scheduling problem. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2004, v:64, n:9, pp:1086-1100 [Journal ] Serafino Cicerone , Gabriele Di Stefano , Michele Flammini Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2001, v:61, n:10, pp:1472-1488 [Journal ] Vittorio Bilò , Michele Flammini , Luca Moscardelli Pareto approximations for the bicriteria scheduling problem. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2006, v:66, n:3, pp:393-402 [Journal ] Michele Flammini , Giorgio Gambosi , Alfredo Navarra Wireless ATM Layouts for Chain Networks. [Citation Graph (0, 0)][DBLP ] MONET, 2005, v:10, n:1-2, pp:35-45 [Journal ] Michele Flammini , Christian Scheideler Simple, Efficient Routing Schemes for All-Optical Networks. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1999, v:32, n:3, pp:387-420 [Journal ] Serafino Cicerone , Gabriele Di Stefano , Michele Flammini Low-congested interval routing schemes for hypercubelike networks. [Citation Graph (0, 0)][DBLP ] Networks, 2000, v:36, n:3, pp:191-201 [Journal ] Michele Flammini Deadlock-free interval routing schemes. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:1, pp:47-60 [Journal ] Michele Flammini , Giorgio Gambosi , Umberto Nanni , Richard B. Tan Characterization results of all shortest paths interval routing schemes. [Citation Graph (0, 0)][DBLP ] Networks, 2001, v:37, n:4, pp:225-232 [Journal ] Tamar Eilam , Michele Flammini , Shmuel Zaks A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1998, v:8, n:2, pp:207-220 [Journal ] Michele Flammini On the Hardness of Devising Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1997, v:7, n:1, pp:39-47 [Journal ] Michele Flammini , Stephane Perennes On the Optimality of General Lower Bounds for Broadcasting and Gossiping. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:2, pp:267-282 [Journal ] Michele Flammini , Stéphane Pérennes Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:4, pp:521-540 [Journal ] Serafino Cicerone , Gabriele Di Stefano , Michele Flammini Static and dynamic low-congested interval routing schemes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:276, n:1-2, pp:315-354 [Journal ] Michele Flammini , Giorgio Gambosi On Devising Boolean Routing Schemes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:186, n:1-2, pp:171-198 [Journal ] Michele Flammini , Giorgio Gambosi , Umberto Nanni , Richard B. Tan Multidimensional Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:205, n:1-2, pp:115-133 [Journal ] Michele Flammini , Alfredo Navarra , Andrzej Proskurowski On routing of wavebands for all-to-all communications in all-optical paths and cycles. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:333, n:3, pp:401-413 [Journal ] Vittorio Bilò , Michele Flammini , Giovanna Melideo , Luca Moscardelli , Alfredo Navarra Sharing the cost of multicast transmissions in wireless networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:369, n:1-3, pp:269-284 [Journal ] Ioannis Caragiannis , Michele Flammini , Luca Moscardelli An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 2007, pp:447-458 [Conf ] Vittorio Bilò , Michele Flammini Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:621-632 [Conf ] Angelo Fanelli , Michele Flammini , Luca Moscardelli On the convergence of multicast games in directed networks. [Citation Graph (0, 0)][DBLP ] SPAA, 2007, pp:330-338 [Conf ] Angelo Fanelli , Michele Flammini , Domenico Mango , Giovanna Melideo , Luca Moscardelli Experimental Evaluations of Algorithms for IP Table Minimization. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:324-337 [Conf ] Michele Flammini , Mordechai Shalom , Shmuel Zaks On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2007, v:67, n:4, pp:448-455 [Journal ] On the Performances of Nash Equilibria in Isolation Games. [Citation Graph (, )][DBLP ] Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. [Citation Graph (, )][DBLP ] The Speed of Convergence in Congestion Games under Best-Response Dynamics. [Citation Graph (, )][DBLP ] Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP ] When Ignorance Helps: Graphical Multicast Cost Sharing Games. [Citation Graph (, )][DBLP ] Graphical congestion games with linear latencies. [Citation Graph (, )][DBLP ] On the complexity of the regenerator placement problem in optical networks. [Citation Graph (, )][DBLP ] Graphical Congestion Games. [Citation Graph (, )][DBLP ] Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. [Citation Graph (, )][DBLP ] Performances of One-Round Walks in Linear Congestion Games. [Citation Graph (, )][DBLP ] Improved Approximation Results for the Minimum Energy Broadcasting Problem. [Citation Graph (, )][DBLP ] On the Convergence of Multicast Games in Directed Networks. [Citation Graph (, )][DBLP ] Selfishness, collusion and power of local search for the ADMs minimization problem. [Citation Graph (, )][DBLP ] Layouts for mobility management in wireless ATM networks. [Citation Graph (, )][DBLP ] On minimizing the number of ADMs in a general topology optical network. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.458secs