1888 search results - page 118 / 378 » Proof theory and computational analysis |
102
click to vote
PODC
2010
ACM
15 years 2 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
98
Voted
DCC
2008
IEEE
16 years 5 days ago
2008
IEEE
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
SOFSEM
2009
Springer
15 years 9 months ago
2009
Springer
Microcontroller software typically consists of a few hundred lines of code only, but it is rather different from standard application code. The software is highly hardware and pla...
100
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
98
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...