The following pages link to Alberto Marchetti-Spaccamela (Q216126):
Displaying 50 items.
- (Q198215) (redirect page) (← links)
- Assigning sporadic tasks to unrelated machines (Q494326) (← links)
- The distributed wireless gathering problem (Q627160) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- An approximation algorithm for the wireless gathering problem (Q957364) (← links)
- The complexity of existential quantification in concept languages. (Q989170) (← links)
- Improved multiprocessor global schedulability analysis (Q993508) (← links)
- Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
- (Q1029343) (redirect page) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- The largest tree in a random graph (Q1050116) (← links)
- Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Probabilistic analysis of the minimum weighted flowtime scheduling problem (Q1197880) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- Semidynamic algorithms for maintaining single-source shortest path trees (Q1273931) (← links)
- On learning monotone DNF formulae under uniform distributions (Q1322465) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- Maintaining a topological order under edge insertions (Q1847369) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
- A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
- Efficient token-based control in rings. (Q2583556) (← links)
- On-line Randomized Call Control Revisited (Q2719132) (← links)
- (Q2766665) (← links)
- Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems (Q2796402) (← links)
- Assigning Sporadic Tasks to Unrelated Parallel Machines (Q2843291) (← links)
- Universal Sequencing on an Unreliable Machine (Q2910853) (← links)
- Scheduling over Scenarios on Two Machines (Q2920492) (← links)
- Latency-constrained aggregation in sensor networks (Q2930288) (← links)
- Algorithms and complexity for periodic real-time scheduling (Q2933634) (← links)
- Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems (Q2989519) (← links)
- (Q3041238) (← links)
- Mixed-Criticality Scheduling of Sporadic Task Systems (Q3092260) (← links)
- Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks (Q3092275) (← links)
- Average case analysis of fully dynamic reachability for directed graphs (Q3124401) (← links)
- (Q3138872) (← links)
- Minimizing flow time in the wireless gathering problem (Q3189016) (← links)
- Comparison of methods for logic-query implementation (Q3210150) (← links)
- (Q3326854) (← links)
