110 search results - page 10 / 22 » A Self-Routing Permutation Network |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
Collisions in overlapping channels are becoming an increasingly important problem in the deployment of high-speed wireless networks. In this paper, we present Remap, a simple, nov...
ENTCS
2006
13 years 7 months ago
2006
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
ICPP
1992
IEEE
13 years 11 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...