Sciweavers

1816 search results - page 14 / 364
» Trace oblivious computation
Sort
View
PODC
2012
ACM
12 years 7 days ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
WG
2010
Springer
13 years 8 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
ENTCS
2011
134views more  ENTCS 2011»
13 years 1 months ago
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
Sam Lindley, Philip Wadler, Jeremy Yallop
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
14 years 4 months ago
Oblivious equilibrium for large-scale stochastic games with unbounded costs
— We study stochastic dynamic games with a large number of players, where players are coupled via their cost functions. A standard solution concept for stochastic games is Markov...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
IACR
2011
107views more  IACR 2011»
12 years 9 months ago
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
Jan Camenisch, Kristiyan Haralambiev, Markulf Kohl...