There are p heterogeneous objects to be assigned to n competing agents (n > p)
each with unit demand. It is required to design a Groves mechanism for this assignment problem
s...
"Even the material of this book, even my own dreams, defaced by time or superseded, by means of which I have demonstrated the rules of dream-interpretation, revealed, when I c...
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
This paper presents a graph transformation based approach to design pattern evolution. An evolution of a design pattern includes modifications of pattern elements, such as classes...