Kinetic Algorithms Via Self-adjusting Computation

Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we describe a technique for syntactically transforming static algorithms into kinetic algorithms, which compute properties of moving objects. The technique o

• Type: Conference
• Year: 2006
• Where: ESA
• Authors: Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes
• Keywords: Algorithms, ESA 2006, Kinetic Algorithms, Static Algorithms, Technique O«ers Capabilities