Sciweavers

612 search results - page 61 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
DAM
2006
121views more  DAM 2006»
13 years 7 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski
ECCC
2008
108views more  ECCC 2008»
13 years 8 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
FOCS
2000
IEEE
13 years 11 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
SAC
2011
ACM
12 years 10 months ago
An empirical study on the effectiveness of time-aware test case prioritization techniques
Regression testing is often performed with a time budget and it does not allow executing all test cases. Test case prioritization techniques re-order test cases to increase the ra...
Dongjiang You, Zhenyu Chen, Baowen Xu, Bin Luo, Ch...
ICS
2010
Tsinghua U.
14 years 5 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim