2576 search results - page 52 / 516 » The Complexity of Zero Knowledge |
STOC
2005
ACM
16 years 5 days ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
CLUSTER
2006
IEEE
15 years 6 months ago
2006
IEEE
Collective MPI operations are an interesting research topic, since their implementation is complex and there are many different possible ways to improve their performance. It is no...
TJS
2008
14 years 11 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
144
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
117
click to vote
JUCS
2010
14 years 10 months ago
2010
: For many years, physical asset indicators were the main evidence of an organization’s successful performance. However, the situation has changed following the revolution of inf...