38 search results - page 3 / 8 » Asymptotic analysis of (3, 2, 1)-shell sort |
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
MSWIM
2004
ACM
14 years 29 days ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We study a fixed point formalisation of the well known analysis of Bianchi [3]. We provide a significant simplification and generalisation of the analysis. In this more gene...
JCB
2008
13 years 7 months ago
2008
In this paper, we study k-noncrossing, -canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T OE4 k; .n/ denote the number of these structure...
SPAA
2003
ACM
14 years 24 days ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...