1696 search results - page 7 / 340 » Permuted function matching |
STOC
1993
ACM
15 years 2 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...
100
click to vote
COMBINATORICS
1999
14 years 9 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
108
click to vote
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...