We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...