59 search results - page 9 / 12 » soda 2003 |
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...