412 search results - page 5 / 83 » Categories for the working mathematician: making the impossi... |
EUROCRYPT
2004
Springer
14 years 1 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)...
OPODIS
2008
13 years 9 months ago
2008
We consider asynchronous deterministic broadcasting in radio networks. An execution of a broadcasting protocol is a series of events, each of which consists of simultaneous transm...
SPAA
2010
ACM
14 years 22 days ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
PODC
1999
ACM
14 years 7 days ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...