10271 search results - page 397 / 2055 » Computer Science |
184
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
192
click to vote
TCS
2011
15 years 2 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) .
