STOC
1997
ACM
14 years 3 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
STOC
1997
ACM
14 years 3 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
SPAA
1997
ACM
14 years 3 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
SIGMOD
1997
ACM
14 years 3 months ago
1997
ACM
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
MM
1997
ACM
14 years 3 months ago
1997
ACM
In this paper, we address the problem of choosing a disk admission algorithm for continuous media streams where each stream may have a di erent bit rate, and more importantly, whe...
ANTS
1998
Springer
14 years 3 months ago
1998
Springer
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
ANTS
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. We provide here a complete average
DAC
1997
ACM
14 years 3 months ago
1997
ACM
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
COMPGEOM
1997
ACM
14 years 3 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
WDAG
1998
Springer
14 years 3 months ago
1998
Springer