43 search results - page 3 / 9 » tcs 2011 |
144
click to vote
TCS
2011
14 years 11 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
127
click to vote
TCS
2011
14 years 11 months ago
2011
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...