The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
Background: Complex biological database systems have become key computational tools used daily by scientists and researchers. Many of these systems must be capable of executing on...
Marko Srdanovic, Ulf Schenk, Michael Schwieger, Fa...
Abstract— Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimi...
Jeffrey Shneidman, Peter R. Pietzuch, Matt Welsh, ...