The following pages link to Andrei Negoescu (Q495672):
Displaying 8 items.
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Engineering Efficient Paging Algorithms (Q2828192) (← links)
- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm (Q2896387) (← links)
- New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches (Q2999348) (← links)
- Online Paging for Flash Memory Devices (Q3652223) (← links)
- Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms (Q5326608) (← links)
- (Q5743508) (← links)
