Sciweavers

ECCC
2010
98views more  ECCC 2010»
14 years 11 days ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
ITSL
2008
14 years 1 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu