2200 search results - page 100 / 440 » Bloch's Constant is Computable |
460
click to vote
Book
"The book is written for looking things up but do not expect all things to be present. Use your on-line manual if you do not see what you need in the book. Look for additional...
145
click to vote
DSOM
2007
Springer
16 years 17 days ago
2007
Springer
Link dimensioning is generally considered as an effective and (operationally) simple mechanism to meet (given) performance requirements. In practice, the required link capacity C...
150
click to vote
WINE
2007
Springer
16 years 15 days ago
2007
Springer
In addition to useful Economic interpretation, auction based algorithms are generally found to be efficient. In this note, we observe that the auction-based mechanism can also be u...
142
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
161
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...