Subhash Suri

Subhash Suri

Auto-generated profile, based on publicly available information

Subhash Suri

Department of Computer Science, University of California, Santa Barbara, USA

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2006 in Algorithmica
Verified
Journal Article
Closed access
PDF file
SSSubhash Suri
Subhash Suri
CTCsaba D. Toth
Csaba D. Toth
YZYunhong Zhou
Yunhong Zhou

18 November 2012 in Algorithmica
Verified
Journal Article
Closed access
PDF file
LFLuca Foschini
Luca Foschini
JHJohn Hershberger
John Hershberger
SSSubhash Suri
Subhash Suri

1 April 2003 in Algorithmica
Verified
Journal Article
Closed access
PDF file
SSSubhash Suri
Subhash Suri
TSTuomas Sandholm
Tuomas Sandholm
PWPriyank Warkhede
Priyank Warkhede

31 March 2005 in Decision Support Systems
Verified
Journal Article
Closed access
AKAnshul Kothari
Anshul Kothari
DPDavid C. Parkes
David C. Parkes
SSSubhash Suri
Subhash Suri

30 November 1996 in Journal of Algorithms
Verified
Journal Article
Closed access
JHJohn Hershberger
John Hershberger
SSSubhash Suri
Subhash Suri

1 April 2007
Verified
Conference Paper
Closed access
CBChiranjeeb Buragohain
Chiranjeeb Buragohain
NSNisheeth Shrivastava
Nisheeth Shrivastava
SSSubhash Suri
Subhash Suri
We propose new algorithms for constructing maximum error (L ∞ ) histograms in the data stream model. Our first algorithm (Min-Merge) achieves the following performance guarantee: using O(B) memory, it constructs a 2B-bucket histogram whose approximation error is at most the error of the optimal B-bucket histogram. Our second algorithm (Min-Increment) achieves a (1 + ε)-approximation of a B-bucket histogram using O(ε -1 B log U) space, where U is the size of the domain for data values. The memory requirements of these algorithms are a significant improvement over the previous best schemes for constructing near-optimal histograms in the data stream model, making them ideal for data summary applications where memory is at a premium, such as wireless sensor networks. Our Min-Increment algorithm also extends to the sliding window model without any asymptotic increase in space. Finally, using synthetic and real-world data, we show that our algorithms are indeed as space-efficient in practice as their theoretical analysis predicts - compared to previous best algorithms, they require two or more orders of magnitude less memory for the same approximation error.