179 search results - page 4 / 36 » Space Bounded Computations: Review And New Separation Result... |
NJC
2000
14 years 10 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
PPAM
2005
Springer
15 years 3 months ago
2005
Springer
We propose a new framework, named Simple Interface for Library Collections (SILC), that gives users access to matrix computation libraries in a flexible and environment-independen...
86
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...