Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
Despite the potential of domain ontologies to provide consensual representations of domain-relevant knowledge, the open, distributed and decentralized nature of the Semantic Web me...
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
Web services are open, interoperable, easy to integrate and reuse, and are extensively used in many application domains. Research and best practices have produced excellent support...
Leen Lambers, Leonardo Mariani, Hartmut Ehrig, Mau...