156 search results - page 24 / 32 » On the Round Complexity of Covert Computation |
COLCOM
2009
IEEE
14 years 2 days ago
2009
IEEE
—Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the deve...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
NOSSDAV
2004
Springer
14 years 22 days ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
PODC
1998
ACM
13 years 11 months ago
1998
ACM
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...