Sciweavers

2576 search results - page 168 / 516
» The Complexity of Zero Knowledge
Sort
View
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
15 years 11 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
GLOBECOM
2007
IEEE
15 years 11 months ago
Initialization Techniques for Improved Convergence of LMS DFEs in Strong Interference Environments
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...
Arun Batra, James R. Zeidler, Aloysius A. Beex
164
Voted
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 5 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
168
Voted
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 5 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...