1769 search results - page 41 / 354 » Choice in Dynamic Linking |
120
Voted
STOC
2000
ACM
15 years 8 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
131
click to vote
OPODIS
2004
15 years 5 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
133
Voted
CCCG
1994
15 years 5 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
USENIX
1993
15 years 5 months ago
1993
As an alternative to communication via messages or files, shared memory has the potential to be simpler, faster, and less wasteful of space. Unfortunately, the mechanisms availab...
128
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or ene...