58 search results - page 11 / 12 » Resolution Proof Systems with Weak Transformation Rules |
JAL
2002
13 years 6 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
POPL
2012
ACM
12 years 1 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
CLIMA
2004
13 years 7 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...