Sciweavers

247 search results - page 50 / 50
» Ideals without CCC
Sort
View
SPAA
2009
ACM
14 years 7 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
CCR
2005
103views more  CCR 2005»
13 years 7 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...