2899 search results - page 520 / 580 » Dynamic Trees in Practice |
SIGSOFT
2002
ACM
14 years 10 months ago
2002
ACM
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
PPOPP
2009
ACM
14 years 10 months ago
2009
ACM
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
RECOMB
2006
Springer
14 years 10 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
EUROSYS
2007
ACM
14 years 7 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...