4541 search results - page 7 / 909 » Cache-Oblivious Algorithms and Data Structures |
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
SIGCSE
1999
ACM
14 years 22 days ago
1999
ACM
We describe an approach for incorporating randomization in the teaching of data structures and algorithms. The proofs we include are quite simple and can easily
IV
2002
IEEE
14 years 1 months ago
2002
IEEE
from Abstract Data to Naturalistic Visual Structure A. Loizides and M.Slater Department of Computer Science, University College London (UCL), London, UK This paper demonstrates a ...
Book
"This book is about the fundamentals of data structures and algorithms--the basic elements from which large and complex software artifacts are built. To develop a solid unders...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...