169 search results - page 9 / 34 » Balanced Two-sided Matching |
VLDB
2005
ACM
14 years 8 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
HPCA
2008
IEEE
14 years 8 months ago
2008
IEEE
Interconnection networks-on-chip (NOCs) are rapidly replacing other forms of interconnect in chip multiprocessors and system-on-chip designs. Existing interconnection networks use...
FOCS
2002
IEEE
14 years 19 days ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
RSA
1998
13 years 7 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...