Sciweavers

287 search results - page 58 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
POPL
2010
ACM
14 years 8 days ago
Lightweight asynchrony using parasitic threads
Message-passing is an attractive thread coordination mechanism because it cleanly delineates points in an execution when threads communicate, and unifies synchronization and comm...
K. C. Sivaramakrishnan, Lukasz Ziarek, Raghavendra...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen