Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore online convex paging algorithms in this 57-minute conference talk presented at the International Centre for Theoretical Sciences. Learn about the intersection of geometric, probabilistic, and algorithmic approaches to solving paging problems in online settings. Discover how convex optimization techniques can be applied to memory management and caching strategies where pages must be loaded and evicted from limited memory without knowledge of future requests. Examine theoretical foundations and practical implications of online algorithms that maintain competitive ratios while handling convex cost functions. Gain insights into how this research contributes to the broader field of theoretical computer science, particularly in areas where geometric intuition enhances algorithmic design for online optimization problems.
