Sciweavers

1027 search results - page 180 / 206
» Opening Up The Enterprise
Sort
View
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
INFOCOM
2002
IEEE
15 years 4 months ago
Avoiding Instability during Graceful Shutdown of OSPF
Abstract—Many recent router architectures decouple the routing engine from the forwarding engine, so that packet forwarding can continue even when the routing process is not acti...
Aman Shaikh, Rohit Dube, Anujan Varma
IPPS
2002
IEEE
15 years 4 months ago
Can User-Level Protocols Take Advantage of Multi-CPU NICs?
Modern high speed interconnects such as Myrinet and Gigabit Ethernet have shifted the bottleneck in communication from the interconnect to the messaging software at the sending an...
Piyush Shivam, Pete Wyckoff, Dhabaleswar K. Panda
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 4 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
FOCS
2000
IEEE
15 years 4 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk