32 search results - page 4 / 7 » On permutations with bounded drop size |
SPDP
1991
IEEE
13 years 9 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
AB
2007
Springer
13 years 9 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
COCO
2010
Springer
13 years 7 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
TIT
2010
13 years 6 days ago
2010
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...