Sciweavers

19 search results - page 2 / 4
» Low-Power Properties of the Logarithmic Number System
Sort
View
FOCS
2002
IEEE
13 years 10 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
EUROPAR
2004
Springer
13 years 10 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
ISCAS
2006
IEEE
77views Hardware» more  ISCAS 2006»
13 years 11 months ago
A parallel search algorithm for CLNS addition optimization
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...
Panagiotis D. Vouzis, Mark G. Arnold
IPPS
2006
IEEE
13 years 11 months ago
Node-disjoint paths in hierarchical hypercube networks
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 5 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...