170 search results - page 27 / 34 » k-Wise Independent Random Graphs |
101
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
86
Voted
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
IACR
2011
13 years 9 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
SIAMDM
2008
14 years 9 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...