The following pages link to Michele Scquizzato (Q2121066):
Displaying 14 items.
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Efficient computation of optimal energy and fractional weighted flow trade-off schedules (Q2408929) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Toward Optimal Bounds in the Congested Clique (Q2796246) (← links)
- Chasing Convex Bodies and Functions (Q2802928) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- On the Complexity of Speed Scaling (Q2946378) (← links)
- Almost All Functions Require Exponential Energy (Q2946379) (← links)
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules (Q2965472) (← links)
- (Q2965522) (← links)
- Energy-efficient circuit design (Q2988889) (← links)
- Network-Oblivious Algorithms (Q3177760) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q5874268) (← links)
