Alberto Marchetti-Spaccamela

According to our database1, Alberto Marchetti-Spaccamela authored at least 144 papers between 1980 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
A Generalized Parallel Task Model for Recurrent Real-Time Processes.
TOPC, 2019

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors.
J. Scheduling, 2019

2018
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling.
IEEE Trans. Computers, 2017

Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems.
IEEE Trans. Computers, 2017

Minimizing worst-case and average-case makespan over scenarios.
J. Scheduling, 2017

Performance improvements for search systems using an integrated cache of lists + intersections.
Inf. Retr. Journal, 2017

A scheduling model inspired by control theory.
Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017

Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Flow Time Minimization.
Encyclopedia of Algorithms, 2016

Enumeration of minimal stoichiometric precursor sets in metabolic networks.
Algorithms for Molecular Biology, 2016

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities.
Proceedings of the 28th Euromicro Conference on Real-Time Systems, 2016

ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors.
Proceedings of the 28th Euromicro Conference on Real-Time Systems, 2016

2015
Assigning sporadic tasks to unrelated machines.
Math. Program., 2015

Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems.
J. ACM, 2015

Memory-processor co-scheduling in fixed priority systems.
Proceedings of the 23rd International Conference on Real Time Networks and Systems, 2015

Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems.
Proceedings of the 27th Euromicro Conference on Real-Time Systems, 2015

The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks.
Proceedings of the 27th Euromicro Conference on Real-Time Systems, 2015

2014
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinformatics, 2014

Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections.
Proceedings of the String Processing and Information Retrieval, 2014

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Scheduling over Scenarios on Two Machines.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks.
Proceedings of the IEEE 34th Real-Time Systems Symposium, 2013

Feasibility Analysis in the Sporadic DAG Task Model.
Proceedings of the 25th Euromicro Conference on Real-Time Systems, 2013

Algorithms for Secure Communication.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci., 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks.
Bioinformatics, 2012

A Generalized Parallel Task Model for Recurrent Real-time Processes.
Proceedings of the 33rd IEEE Real-Time Systems Symposium, 2012

Assigning Sporadic Tasks to Unrelated Parallel Machines.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems.
Proceedings of the 24th Euromicro Conference on Real-Time Systems, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Recommending items in pervasive scenarios: models and experimental analysis.
Knowl. Inf. Syst., 2011

Structures and Hyperstructures in Metabolic Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks.
Proceedings of the Algorithms - ESA 2011, 2011

Mixed-Criticality Scheduling of Sporadic Task Systems.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Improved multiprocessor global schedulability analysis.
Real-Time Systems, 2010

Graph-Based Analysis of the Metabolic Exchanges between Two Co-Resident Intracellular Symbionts, Baumannia cicadellinicola and Sulcia muelleri, with Their Insect Host, Homalodisca coagulata.
PLoS Computational Biology, 2010

A note on the complexity of finding and enumerating elementary modes.
Biosystems, 2010

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Algorithms and Complexity for Periodic Real-Time Scheduling.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Scheduling Real-Time Mixed-Criticality Jobs.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.
Proceedings of the Algorithms, 2010

Data Gathering in Wireless Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Latency-constrained aggregation in sensor networks.
ACM Trans. Algorithms, 2009

Modes and cuts in metabolic networks: Complexity and algorithms.
Biosystems, 2009

Nonclairvoyant Speed Scaling for Flow and Energy.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

On the complexity of the regenerator placement problem in optical networks.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Implementation of a Speedup-Optimal Global EDF Schedulability Test.
Proceedings of the 21st Euromicro Conference on Real-Time Systems, 2009

2008
Flow Time Minimization.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Enumerating Precursor Sets of Target Metabolites in a Metabolic Network.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Minimizing Flow Time in the Wireless Gathering Problem.
Proceedings of the STACS 2008, 2008

Self-Adaptive Recommendation Systems: Models and Experimental Analysis.
Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
Proceedings of the Algorithms, 2008

Minimizing Average Flow Time in Sensor Data Gathering.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

The Distributed Wireless Gathering Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Prize-Collecting Traveling Salesman and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs.
Proceedings of the Structural Information and Communication Complexity, 2007

2006
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.
Math. Oper. Res., 2006

Preface.
J. Discrete Algorithms, 2006

An Approximation Algorithm for the Wireless Gathering Problem.
Proceedings of the Algorithm Theory, 2006

Counting triangles in data streams.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Balanced Cut Approximation in Random Geometric Graphs.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Latency Constrained Aggregation in Sensor Networks.
Proceedings of the Algorithms, 2006

2005
Parallel scheduling problems in next generation wireless networks.
Networks, 2005

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Preface.
Electr. Notes Theor. Comput. Sci., 2004

Scheduling against an adversarial network.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

2003
Fully dynamic shortest paths in digraphs with arbitrary arc weights.
J. Algorithms, 2003

Foreword.
Discrete Applied Mathematics, 2003

Scheduling to Minimize Flow Time Metrics.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Semi-clairvoyant Scheduling.
Proceedings of the Algorithms, 2003

2002
Parallel scheduling problems in next generation wireless networks.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Preface.
Theor. Comput. Sci., 2001

Dynamic algorithms for classes of constraint satisfaction problems.
Theor. Comput. Sci., 2001

On-line Randomized Call Control Revisited .
SIAM J. Comput., 2001

A Broadcasting Protocol in Line Digraphs.
J. Parallel Distrib. Comput., 2001

Online Weighted Flow Time and Deadline Scheduling.
Proceedings of the Approximation, 2001

2000
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees.
J. Algorithms, 2000

Approximating Call-Scheduling Makespan in All-Optical Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.
Proceedings of the Algorithm Engineering, 2000

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Timestamping Algorithms: A Characterization and a Few Properties.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

On Salesmen, Repairmen, Spiders, and Other Traveling Agents.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Computing Surveys' Electronic Symposium on the Theory of Computation.
ACM Comput. Surv., 1999

On-Line Resource Management with Application to Routing and Scheduling.
Algorithmica, 1999

Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
Efficient Token-Based Control in Rings.
Inf. Process. Lett., 1998

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.
Algorithmica, 1998

On-Line Routing Problems for Broadband Networks.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

On-line Randomized Call Control Revisited.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights.
Proceedings of the Algorithms, 1998

1997
On the Embedding of Refinements of 2-dimensional Grids.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.
ITA, 1996

Maintaining a Topological Order Under Edge Insertions.
Inf. Process. Lett., 1996

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Multiprocessor Scheduling with Rejection.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Efficient Token-Based Control in Rings (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Induced Broadcasting Algorithms in Iterated Line Digraphs.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Stochastic on-line knapsack problems.
Math. Program., 1995

The Complexity of Interval Routing on Random Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

On-line Resource Management with Applications to Routing and Scheduling.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
On Learning Monotone DNF Formulae under Uniform Distributions
Inf. Comput., April, 1994

Incremental Algorithms for the Single-Source Shortest Path Problem.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993
The Weighted List Update Problem and the Lazy Adversary.
Theor. Comput. Sci., 1993

On-line Graph Algorithms for Incremental Compilation.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Memory Paging for Connectivity and Path Problems in Graphs.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
On-Line Computation of Minimal and Maximal Length Paths.
Theor. Comput. Sci., 1992

Probabilistic analysis of the minimum weighted flowtime scheduling problem.
Oper. Res. Lett., 1992

The Complexity of Existential Quantification in Concept Languages.
Artif. Intell., 1992

Learning DNF Formulae Under Classes of Probability Distributions.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
Comparison of Methods for Logic-Query Implementation.
J. Log. Program., 1991

Dynamic Algorithms for Shortest Paths in Planar Graphs.
Proceedings of the 17th International Workshop, 1991

Competitive Algorithms for the Weighted List Update Problem.
Proceedings of the Algorithms and Data Structures, 1991

1990
Incremental Algorithms for Minimal Length Paths.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989

Learning Under Uniform Distribution.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
On the Estimate of a Directed Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Dynamic Maintenance of Paths and Path Expressions on Graphs.
Proceedings of the Symbolic and Algebraic Computation, 1988

On the Learnability of DNF Formulae.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
New Protocols for the Election of a Leader in a Ring.
Theor. Comput. Sci., 1987

Worst Case Analysis of Two Heuristics for The Set Partitioning Problem.
ITA, 1987

Worst-case Complexity Analysis of Methods for Logic Query Implementation.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
On Different Approximation Criteria for Subset Product Problems.
Inf. Process. Lett., 1985

New Protocols for the Election od a Leader in a Ring.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

1984
Hierarchical vehicle routing problems.
Networks, 1984

A Probabilistic Analysis of Multidimensional Bin Packing Problems
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

On Finding the Exact Solution of a Zero-One Knapsack Problem
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
The Largest Tree in a Random Graph.
Theor. Comput. Sci., 1983

Probabilistic Analysis of Two Euclidean Location Problems.
ITA, 1983

Probabilistic Analysis of Graph Colouring Algorithms.
Proceedings of the CAAP'83, 1983

1982
Analysis of a Class of Graph Partitioning Problems.
ITA, 1982

1981
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.
Proceedings of the Fundamentals of Computation Theory, 1981

Full Approximatibility of a Class of Problems over Power Sets.
Proceedings of the CAAP '81, 1981

1980
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.
Theor. Comput. Sci., 1980


  Loading...