🎉 Clément and Yun's paper "Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them" is accepted at RANDOM 2025! Paper: arxiv.org/abs/2504.01543
🔗More about RANDOM: randomconference.com
👤
@ccanonne.github.io
#algorithms #sublinearalgorithms #distributedalgorithms
🔗More about RANDOM: randomconference.com
👤
@ccanonne.github.io
#algorithms #sublinearalgorithms #distributedalgorithms
Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
Local Computation Algorithms (LCA), as introduced by Rubinfeld, Tamir, Vardi, and Xie (2011), are a type of ultra-efficient algorithms which, given access to a (large) input for a given computational ...
arxiv.org
July 3, 2025 at 2:37 AM
🎉 Clément and Yun's paper "Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them" is accepted at RANDOM 2025! Paper: arxiv.org/abs/2504.01543
🔗More about RANDOM: randomconference.com
👤
@ccanonne.github.io
#algorithms #sublinearalgorithms #distributedalgorithms
🔗More about RANDOM: randomconference.com
👤
@ccanonne.github.io
#algorithms #sublinearalgorithms #distributedalgorithms