The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michele Flammini" ( http://dblp.L3S.de/Authors/Michele_Flammini )

URL (Homepage):  http://www.di.univaq.it/di/home.php?users_username=flammini  Author page on DBLP  Author page in RDF  Community of Michele Flammini in ASPL-2

Publication years (Num. hits)
1992-1997 (18) 1998-2001 (16) 2002-2004 (18) 2005-2006 (18) 2007-2008 (18) 2009-2011 (23)
Publication types (Num. hits)
article(50) inproceedings(60) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 97 occurrences of 50 keywords

Results
Found 111 publication records. Showing 111 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli On the performances of Nash equilibria in isolation games. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Optimizing regenerator cost in traffic grooming. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini Extending the notion of rationality of selfish agents: Second Order Nash equilibria. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli Tight Bounds for Selfish and Greedy Load Balancing. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli Graphical Congestion Games. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks On the complexity of the regenerator placement problem in optical networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli Performance of One-Round Walks in Linear Congestion Games. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gianni Amati, Alessandro Celi, Cesidio Di Nicola, Michele Flammini, Daniela Pavone Improved Stable Retrieval in Noisy Collections. Search on Bibsonomy ICTIR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Search on Bibsonomy OPODIS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti Social Context Congestion Games. Search on Bibsonomy SIROCCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli When ignorance helps: Graphical multicast cost sharing games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks Minimizing total busy time in parallel scheduling with application to optical networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Angelo Fanelli, Michele Flammini, Luca Moscardelli On the Convergence of Multicast Games in Directed Networks. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gaia Nicosia On the bicriteria k-server problem. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  BibTeX  RDF
1Angelo Fanelli, Michele Flammini, Luca Moscardelli Stackelberg Strategies for Network Design Games. Search on Bibsonomy WINE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). Search on Bibsonomy OPODIS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Mordechai Shalom, Shmuel Zaks On minimizing the number of ADMs in a general topology optical network. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alfredo Navarra Layouts for mobility management in wireless ATM networks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks Minimizing total busy time in parallel scheduling with application to optical networks. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli Performances of One-Round Walks in Linear Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks On the complexity of the regenerator placement problem in optical networks. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, complexity, optical networks, wavelength division multiplexing (wdm), regenerators
1Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli On the Performances of Nash Equilibria in Isolation Games. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes Tightening the upper bound for the minimum energy broadcasting. Search on Bibsonomy Wireless Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Minimums panning tree, Ad hoc networks, Multi-hop, Approximation factor
1Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli On Nash equilibria for multicast transmissions in ad-hoc wireless networks. Search on Bibsonomy Wireless Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cost sharing methods, Energy saving, Price of anarchy, Nash equilibria
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the traffic grooming problem in tree and star networks. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Selfishness, collusion and power of local search for the ADMs minimization problem. Search on Bibsonomy Computer Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes Asymptotically Optimal Solutions for Small World Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Oblivious diameter, Social networks, Small world graph
1Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the traffic grooming problem. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Search on Bibsonomy Euro-Par The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Optical Add-Drop Multiplexer(OADM), Path and Ring Networks, Optical Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli Graphical Congestion Games. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Nash Equilibrium, Price of Anarchy, Congestion Games, Algorithmic Game Theory, Price of Stability, Social Knowledge
1Angelo Fanelli, Michele Flammini, Luca Moscardelli The Speed of Convergence in Congestion Games under Best-Response Dynamics. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli When Ignorance Helps: Graphical Multicast Cost Sharing Games. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli Graphical congestion games with linear latencies. Search on Bibsonomy SPAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF nash equilibrium, price of anarchy, congestion games, algorithmic game theory, price of stability, social knowledge
1Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes Improved Approximation Results for the Minimum Energy Broadcasting Problem. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ad hoc networks, Broadcasting, Energy conservation
1Michele Flammini, Mordechai Shalom, Shmuel Zaks On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. Search on Bibsonomy WINE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Price of Collusion, Game Theory, Optical Networks, Price of Anarchy, Wavelength Division Multiplexing (WDM), Nash Equilibria, Add-Drop Multiplexer (ADM)
1Ioannis Caragiannis, Michele Flammini, Luca Moscardelli An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli Experimental Evaluations of Algorithms for IP Table Minimization. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF IP protocol, lookup times, optimal and approximation algorithms, Routing, compression
1Angelo Fanelli, Michele Flammini, Luca Moscardelli On the convergence of multicast games in directed networks. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF limited number of best-response moves, multicast games, price of anarchy
1Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra Sharing the cost of multicast transmissions in wireless networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini, Luca Moscardelli Pareto approximations for the bicriteria scheduling problem. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gaia Nicosia Competitive algorithms for the bicriteria k-server problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alfredo Navarra, Stephane Perennes The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Ad-hoc networks, broadcast, spanning tree, energy saving
1Michele Flammini, Alfredo Navarra, Gaia Nicosia Efficient offline algorithms for the bicriteria k-server problem and online applications. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the Traffic Grooming Problem in Tree and Star Networks. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Optical Networks, Tree Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli Tight Bounds for Selfish and Greedy Load Balancing. Search on Bibsonomy ICALP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF limited number of best responses, Multicast, price of anarchy, Nash equilibria
1Marco Autili, Michele Flammini, Paola Inverardi, Alfredo Navarra, Massimo Tivoli Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems. Search on Bibsonomy EWSA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Mordechai Shalom, Shmuel Zaks On Minimizing the Number of ADMs in a General Topology Optical Network. Search on Bibsonomy DISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Optical Networks, Wavelength Assignment, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1Michele Flammini, Mordechai Shalom, Shmuel Zaks On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. Search on Bibsonomy CAAN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Optical Networks, Wavelength Assignment, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1Michele Flammini, Giorgio Gambosi, Alfredo Navarra Wireless ATM Layouts for Chain Networks. Search on Bibsonomy MONET The full citation details ... 2005 DBLP  DOI  BibTeX  RDF wireless networks, ATM networks, capacity planning, mobile users, chains
1Michele Flammini, Alfredo Navarra, Andrzej Proskurowski On routing of wavebands for all-to-all communications in all-optical paths and cycles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Stéphane Pérennes Lower bounds on systolic gossip. Search on Bibsonomy Inf. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini, Luca Moscardelli On Nash Equilibria in Non-cooperative All-Optical Networks. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alfredo Navarra, Stéphane Pérennes The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes Asymptotically Optimal Solutions for Small World Graphs. Search on Bibsonomy DISC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks Approximating the Traffic Grooming Problem. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Optical Networks, Wavelength Assignment, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1Vittorio Bilò, Michele Flammini, Roberto Giovannelli Experimental analysis of online algorithms for the bicriteria scheduling problem. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Stéphane Pérennes Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini On the IP Routing Tables Minimization with Addresses Reassignment. Search on Bibsonomy IPDPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini, Luca Moscardelli Pareto Approximations for the Bicriteria Scheduling Problem. Search on Bibsonomy IPDPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo Sharing the cost of multicast transmissions in wireless networks. Search on Bibsonomy SPAA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximate budget balanceness, multicast cost sharing, strategy-proof mechanisms, wireless networks, efficiency
1Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes Improved approximation results for the minimum energy broadcasting problem. Search on Bibsonomy DIALM-POMC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF ad hoc networks, broadcasting, energy conservation
1Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes Deadlock Prevention by Acyclic Orientations. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Claudio Arbib, Michele Flammini, Fabrizio Marinelli Minimum Flow Time Graph Ordering. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Giorgio Gambosi, Alessandro Gasparini, Alfredo Navarra Dynamic Layouts for Wireless ATM. Search on Bibsonomy Euro-Par The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Giorgio Gambosi, Alfredo Navarra Wireless ATM Layouts for Chain Networks. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF wireless networks, ATM networks, mobile users, chains
1Vittorio 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. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Michele Flammini, Roberto Giovannelli Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. Search on Bibsonomy WEA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Alfredo Navarra, Andrzej Proskurowski On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. Search on Bibsonomy SIROCCO The full citation details ... 2003 DBLP  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Static and dynamic low-congested interval routing schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Claudio Arbib, Michele Flammini On the upper chromatic number of (v3, b2)-configurations. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking Routing and Communication in Interconnection Networks. Search on Bibsonomy Euro-Par The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Adriano Di Pasquale, Michele Flammini, Enrico Nardelli Allocation Problems in Scalable Distributed Data Structures. Search on Bibsonomy WDAS The full citation details ... 2002 DBLP  BibTeX  RDF
1Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan Characterization results of all shortest paths interval routing schemes. Search on Bibsonomy Networks The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Stephane Perennes On the Optimality of General Lower Bounds for Broadcasting and Gossiping. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Enrico Nardelli, Guido Proietti ATM layouts with bounded hop count and congestion. Search on Bibsonomy Distributed Computing The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Edge and node congestion, Routing, Computational complexity, ATM networks
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Low-congested interval routing schemes for hypercubelike networks. Search on Bibsonomy Networks The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Claudio Arbib, Michele Flammini, Enrico Nardelli How to Survive While Visiting a Graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Gaia Nicosia On Multicriteria Online Problems. Search on Bibsonomy ESA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis (eds.) SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000 Search on Bibsonomy SIROCCO The full citation details ... 2000 DBLP  BibTeX  RDF
1Michele Flammini Deadlock-free interval routing schemes. Search on Bibsonomy Networks The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Christian Scheideler Simple, Efficient Routing Schemes for All-Optical Networks. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. Search on Bibsonomy SIROCCO The full citation details ... 1999 DBLP  BibTeX  RDF
1Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan Multidimensional Interval Routing Schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Tamar Eilam, Michele Flammini, Shmuel Zaks A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1998 DBLP  BibTeX  RDF
1Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela The Complexity of Interval Routing on Random Graphs. Search on Bibsonomy Comput. J. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Static and Dynamic Low-Congested Interval Routing Schemes. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan Characterization results of all shortest paths interval routing schemes. Search on Bibsonomy SIROCCO The full citation details ... 1998 DBLP  BibTeX  RDF
1Michele Flammini, Giorgio Gambosi On Devising Boolean Routing Schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Michele Flammini On the Hardness of Devising Interval Routing Schemes. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1997 DBLP  BibTeX  RDF
1Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF communication in interconnection networks, routing, parallel algorithms, graph theory, computational and structural complexity
1Tamar 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). Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Stephane Perennes Lower Bounds on Systolic Gossip. (PDF / PS) Search on Bibsonomy IPPS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Michele Flammini Deadlock-Free Interval Routing Schemes. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Michele Flammini, Enrico Nardelli, Guido Proietti ATM Layouts with Bounded Hop Count and Congestion. Search on Bibsonomy WDAG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 111 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.