2168 search results - page 83 / 434 » Randomized Algorithms and Complexity Theory |
127
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
135
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
147
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
136
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
114
click to vote
CIE
2005
Springer
15 years 8 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...