Sciweavers

2693 search results - page 167 / 539
» On Computing Complex Navigation Functions
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
CTRSA
2006
Springer
107views Cryptology» more  CTRSA 2006»
15 years 10 months ago
A Round and Communication Efficient Secure Ranking Protocol
In this work, we initiate the study of realizing a ranking functionality (m1,
Shaoquan Jiang, Guang Gong
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 11 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
JOC
2000
95views more  JOC 2000»
15 years 6 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
FEDCSIS
2011
90views more  FEDCSIS 2011»
14 years 6 months ago
Services Composition Model for Home-Automation peer-to-peer Pervasive Computing
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
Juan A. Holgado-Terriza, Sandra Rodríguez-V...