Sciweavers

1616 search results - page 190 / 324
» Robust game theory
Sort
View
211
Voted
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
15 years 5 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh
223
Voted
DFG
1992
Springer
15 years 11 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
FCT
2003
Springer
16 years 5 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
DIGRA
2005
Springer
16 years 14 days ago
/hide: The aesthetics of group and solo play
In this essay, I examine differences between individual and social play and, in particular, the differences between individual and social play within digital media forms designed ...
David Myers
INFOCOM
2003
IEEE
16 years 7 days ago
Sensor-Centric Quality of Routing in Sensor Networks
Abstract— Standard embeded sensor nework models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two ...
Rajgopal Kannan, Sudipta Sarangi, S. Sitharama Iye...