Sciweavers

3991 search results - page 744 / 799
» Bounding homogeneous models
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
WINE
2005
Springer
146views Economy» more  WINE 2005»
14 years 1 months ago
A Cost Mechanism for Fair Pricing of Resource Usage
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
Marios Mavronicolas, Panagiota N. Panagopoulou, Pa...
WINE
2005
Springer
109views Economy» more  WINE 2005»
14 years 1 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ASM
2004
ASM
14 years 1 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy