The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alberto Marchetti-Spaccamela: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà
    Worst-case Complexity Analysis of Methods for Logic Query Implementation. [Citation Graph (9, 8)][DBLP]
    PODS, 1987, pp:294-301 [Conf]
  2. Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà
    Comparison of Methods for Logic-Query Implementation. [Citation Graph (3, 0)][DBLP]
    J. Log. Program., 1991, v:10, n:1/2/3&4, pp:333-360 [Journal]
  3. Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Bernhard Hollunder, Werner Nutt, Alberto Marchetti-Spaccamela
    The Complexity of Existential Quantification in Concept Languages. [Citation Graph (2, 0)][DBLP]
    Artif. Intell., 1992, v:53, n:2-3, pp:309-327 [Journal]
  4. Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela
    A Probabilistic Analysis of Multidimensional Bin Packing Problems [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:289-298 [Conf]
  5. Esteban Feuerstein, Alberto Marchetti-Spaccamela
    Dynamic Algorithms for Shortest Paths in Planar Graphs. [Citation Graph (1, 0)][DBLP]
    WG, 1991, pp:187-197 [Conf]
  6. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for Minimal Length Paths. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:615-638 [Journal]
  7. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    On-Line Computation of Minimal and Maximal Length Paths. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:95, n:2, pp:245-261 [Journal]
  8. Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie
    Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:200-214 [Conf]
  9. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
    Full Approximatibility of a Class of Problems over Power Sets. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:76-87 [Conf]
  10. Alberto Marchetti-Spaccamela, Maurizio Talamo
    Probabilistic Analysis of Graph Colouring Algorithms. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:332-340 [Conf]
  11. Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
    On Salesmen, Repairmen, Spiders, and Other Traveling Agents. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:1-16 [Conf]
  12. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:136-151 [Conf]
  13. 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]
  14. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
    Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  15. Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti
    Latency Constrained Aggregation in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:88-99 [Conf]
  16. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
    Semi-clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:67-77 [Conf]
  17. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:320-331 [Conf]
  18. Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
    Induced Broadcasting Algorithms in Iterated Line Digraphs. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:313-324 [Conf]
  19. Giovanna Melideo, Marco Mechelli, Roberto Baldoni, Alberto Marchetti-Spaccamela
    Timestamping Algorithms: A Characterization and a Few Properties. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:609-616 [Conf]
  20. Fabrizio d'Amore, Luca Becchetti, Sergei L. Bezrukov, Alberto Marchetti-Spaccamela, M. Ottaviani, Robert Preis, Markus Röttger, Ulf-Peter Schroeder
    On the Embedding of Refinements of 2-dimensional Grids. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:950-957 [Conf]
  21. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
    Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:24-33 [Conf]
  22. Alberto Marchetti-Spaccamela, Marco Protasi
    Learning Under Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:327-338 [Conf]
  23. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
    Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:462-471 [Conf]
  24. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:201-212 [Conf]
  25. Alberto Marchetti-Spaccamela
    New Protocols for the Election od a Leader in a Ring. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:101-115 [Conf]
  26. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for the Single-Source Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:113-124 [Conf]
  27. Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti
    Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:409-420 [Conf]
  28. Alberto Marchetti-Spaccamela, Carlo Vercellis
    Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:445-456 [Conf]
  29. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
    On the Learnability of DNF Formulae. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:347-361 [Conf]
  30. Stefano Leonardi, Alberto Marchetti-Spaccamela
    On-line Resource Management with Applications to Routing and Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:303-314 [Conf]
  31. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer
    Scheduling to Minimize Flow Time Metrics. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:223- [Conf]
  32. Josep Diaz, Fabrizio Grandoni, Alberto Marchetti-Spaccamela
    Balanced Cut Approximation in Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:527-536 [Conf]
  33. Esteban Feuerstein, Alberto Marchetti-Spaccamela
    Memory Paging for Connectivity and Path Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:416-425 [Conf]
  34. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamic Maintenance of Paths and Path Expressions on Graphs. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:1-12 [Conf]
  35. 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]
  36. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo
    Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:501-511 [Conf]
  37. Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
    Efficient Token-Based Control in Rings (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:154- [Conf]
  38. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler
    Counting triangles in data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:253-262 [Conf]
  39. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
    Online Weighted Flow Time and Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:36-47 [Conf]
  40. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Incremental Algorithms for Minimal Length Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:12-21 [Conf]
  41. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
    Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:95-103 [Conf]
  42. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:212-221 [Conf]
  43. Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
    On-line Randomized Call Control Revisited. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:323-332 [Conf]
  44. Alberto Marchetti-Spaccamela
    On-Line Routing Problems for Broadband Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:167- [Conf]
  45. Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti
    Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:238-247 [Conf]
  46. Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide
    Scheduling against an adversarial network. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:151-159 [Conf]
  47. Andrew V. Goldberg, Alberto Marchetti-Spaccamela
    On Finding the Exact Solution of a Zero-One Knapsack Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:359-368 [Conf]
  48. Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
    An Approximation Algorithm for the Wireless Gathering Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:328-338 [Conf]
  49. Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:352-372 [Conf]
  50. Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
    Competitive Algorithms for the Weighted List Update Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:240-248 [Conf]
  51. Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:218-229 [Conf]
  52. Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie
    On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:258-269 [Conf]
  53. Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer
    Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:87-98 [Conf]
  54. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximating Call-Scheduling Makespan in All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:13-22 [Conf]
  55. Alberto Marchetti-Spaccamela
    On the Estimate of a Directed Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:317-326 [Conf]
  56. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    On-line Graph Algorithms for Incremental Compilation. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:70-86 [Conf]
  57. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:3, pp:250-274 [Journal]
  58. Stefano Leonardi, Alberto Marchetti-Spaccamela
    On-Line Resource Management with Application to Routing and Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:1, pp:29-49 [Journal]
  59. 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]
  60. Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela, Peter Wegner
    Computing Surveys' Electronic Symposium on the Theory of Computation. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3, pp:223-226 [Journal]
  61. Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:1, pp:1- [Journal]
  62. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
    On Learning Monotone DNF Formulae under Uniform Distributions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:84-95 [Journal]
  63. Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
    Efficient Token-Based Control in Rings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:175-180 [Journal]
  64. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    Maintaining a Topological Order Under Edge Insertions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:53-58 [Journal]
  65. Alberto Marchetti-Spaccamela, G. Romano
    On Different Approximation Criteria for Subset Product Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:4, pp:213-218 [Journal]
  66. Paola Bertolazzi, M. Lucertini, Alberto Marchetti-Spaccamela
    Analysis of a Class of Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    ITA, 1982, v:16, n:3, pp:255-261 [Journal]
  67. Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela
    Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:4, pp:305-318 [Journal]
  68. Alberto Marchetti-Spaccamela, Antonella Pelaggi
    Worst Case Analysis of Two Heuristics for The Set Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:1, pp:11-23 [Journal]
  69. Alberto Marchetti-Spaccamela, Maurizio Talamo
    Probabilistic Analysis of Two Euclidean Location Problems. [Citation Graph (0, 0)][DBLP]
    ITA, 1983, v:17, n:4, pp:387-395 [Journal]
  70. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:251-281 [Journal]
  71. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Fully dynamic shortest paths in digraphs with arbitrary arc weights. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:86-113 [Journal]
  72. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximating call-scheduling makespan in all-optical networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:501-515 [Journal]
  73. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
    Online weighted flow time and deadline scheduling. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:339-352 [Journal]
  74. Giuseppe F. Italiano, Alberto Marchetti-Spaccamela
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:337-338 [Journal]
  75. Esteban Feuerstein, Alberto Marchetti-Spaccamela
    Memory Paging for Connectivity and Path Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  76. Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
    A Broadcasting Protocol in Line Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:8, pp:1013-1032 [Journal]
  77. Alberto Marchetti-Spaccamela, Carlo Vercellis
    Stochastic on-line knapsack problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:73-104 [Journal]
  78. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal
    Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:1, pp:9-22 [Journal]
  79. Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
    On-line Randomized Call Control Revisited . [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:86-112 [Journal]
  80. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
    Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:1, pp:64-78 [Journal]
  81. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
    Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:83-96 [Journal]
  82. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximation algorithms for routing and call scheduling in all-optical chains and rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:429-448 [Journal]
  83. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
    Semi-clairvoyant scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:325-335 [Journal]
  84. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamic algorithms for classes of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:287-305 [Journal]
  85. Stefano Leonardi, Alberto Marchetti-Spaccamela
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:1- [Journal]
  86. Alberto Marchetti-Spaccamela
    New Protocols for the Election of a Leader in a Ring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:53-64 [Journal]
  87. Alberto Marchetti-Spaccamela, Marco Protasi
    The Largest Tree in a Random Graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:23, n:, pp:273-286 [Journal]
  88. Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
    The Weighted List Update Problem and the Lazy Adversary. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:108, n:2, pp:371-384 [Journal]
  89. Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti
    Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:139-150 [Conf]

  90. The Distributed Wireless Gathering Problem. [Citation Graph (, )][DBLP]


  91. Minimizing Average Flow Time in Sensor Data Gathering. [Citation Graph (, )][DBLP]


  92. Implementation of a Speedup-Optimal Global EDF Schedulability Test. [Citation Graph (, )][DBLP]


  93. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. [Citation Graph (, )][DBLP]


  94. Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. [Citation Graph (, )][DBLP]


  95. Universal Sequencing on a Single Machine. [Citation Graph (, )][DBLP]


  96. Scheduling Real-Time Mixed-Criticality Jobs. [Citation Graph (, )][DBLP]


  97. Algorithms and Complexity for Periodic Real-Time Scheduling. [Citation Graph (, )][DBLP]


  98. On the complexity of the regenerator placement problem in optical networks. [Citation Graph (, )][DBLP]


  99. Minimizing Flow Time in the Wireless Gathering Problem. [Citation Graph (, )][DBLP]


  100. Nonclairvoyant Speed Scaling for Flow and Energy. [Citation Graph (, )][DBLP]


  101. Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. [Citation Graph (, )][DBLP]


  102. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. [Citation Graph (, )][DBLP]


  103. Self-Adaptive Recommendation Systems: Models and Experimental Analysis. [Citation Graph (, )][DBLP]


  104. Minimizing Flow Time in the Wireless Gathering Problem [Citation Graph (, )][DBLP]


  105. Nonclairvoyant Speed Scaling for Flow and Energy [Citation Graph (, )][DBLP]


  106. Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems [Citation Graph (, )][DBLP]


  107. Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks [Citation Graph (, )][DBLP]


Search in 0.199secs, Finished in 0.205secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002