7106 search results - page 775 / 1422 » Restricted Complexity, General Complexity |
278
click to vote
COMPGEOM
2010
ACM
16 years 14 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
186
click to vote
LICS
2002
IEEE
16 years 9 days ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
205
click to vote
SIGECOM
2010
ACM
16 years 6 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
216
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
215
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...