10304 search results - page 391 / 2061 » Computer science with the sciences: an emphasis in computati... |
178
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(
186
click to vote
TCS
2011
15 years 1 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) .
173
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet
172
click to vote
TAICPART
2006
IEEE
16 years 25 days ago
2006
IEEE
ract: Problem Statement and Hypothetical Solutions Shaukat Ali Verification and Testing Group (VT) Department of Computer Science University of Sheffield