default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSumit Ganguly
Person information
- affiliation: Indian Institute of Technology Kanpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c41]Sumit Ganguly, David P. Woodruff:
High Probability Frequency Moment Sketches. ICALP 2018: 58:1-58:15- [e2]Sumit Ganguly, Paritosh K. Pandya:
38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India. LIPIcs 122, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-093-4 [contents] - [i8]Sumit Ganguly, David P. Woodruff:
High Probability Frequency Moment Sketches. CoRR abs/1805.10885 (2018) - 2017
- [j12]Sumit Ganguly, Ramesh Krishnamurti:
Preface: CALDAM 2015. Discret. Appl. Math. 228: 1-2 (2017) - 2015
- [c40]Sumit Ganguly:
Taylor Polynomial Estimator for Estimating Frequency Moments. ICALP (1) 2015: 542-553 - [e1]Sumit Ganguly, Ramesh Krishnamurti:
Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Lecture Notes in Computer Science 8959, Springer 2015, ISBN 978-3-319-14973-8 [contents] - [i7]Sumit Ganguly:
Taylor Polynomial Estimator for Estimating Frequency Moments. CoRR abs/1506.01442 (2015) - 2012
- [j11]Sumit Ganguly, Mohit Bansal, Shruti Dube:
Estimating hybrid frequency moments of data streams. J. Comb. Optim. 23(3): 373-394 (2012) - [c39]Sumit Ganguly:
Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams. ISAAC 2012: 64-74 - [i6]Sumit Ganguly:
A Lower Bound for Estimating High Moments of a Data Stream. CoRR abs/1201.0253 (2012) - 2011
- [i5]Sumit Ganguly:
Polynomial Estimators for High Frequency Moments. CoRR abs/1104.4552 (2011) - 2010
- [j10]Sumit Ganguly:
Distributing Frequency-Dependent Data Stream Computations. Chic. J. Theor. Comput. Sci. 2010 (2010) - [i4]Sumit Ganguly, Purushottam Kar:
On Estimating the First Frequency Moment of Data Streams. CoRR abs/1005.0809 (2010)
2000 – 2009
- 2009
- [j9]Sumit Ganguly, Lakshminath Bhuvanagiri:
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams. Algorithmica 53(4): 549-582 (2009) - [c38]Sumit Ganguly:
A Note on Estimating Hybrid Frequency Moment of Data Streams. AAIM 2009: 202-211 - [c37]Sumit Ganguly:
Distributing Frequency-Dependent Data Stream Computations. CATS 2009: 161-167 - [c36]Sumit Ganguly:
Deterministically Estimating Data Stream Frequencies. COCOA 2009: 301-312 - [c35]Sumit Ganguly, Christian Sohler:
d-Dimensional Knapsack in the Streaming Model. ESA 2009: 468-479 - 2008
- [j8]Sumit Ganguly, Anirban Majumder:
Deterministic K-set structure. Inf. Process. Lett. 109(1): 27-31 (2008) - [c34]Sumit Ganguly:
Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract). CSR 2008: 204-215 - [c33]Sumit Ganguly, Pushpraj Shukla:
An approach to QoS aware resource scheduling in data stream systems. SSPS 2008: 23-28 - [c32]Sumit Ganguly, Mohit Bansal, Shruti Dube:
Estimating Hybrid Frequency Moments of Data Streams. FAW 2008: 55-66 - [c31]Sumit Ganguly:
Data Stream Algorithms via Expander Graphs. ISAAC 2008: 52-63 - [c30]Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar:
Finding Frequent Items over General Update Streams. SSDBM 2008: 204-221 - [i3]Sumit Ganguly:
Lower bound for estimating frequency for update data streams. Sublinear Algorithms 2008 - 2007
- [j7]Sumit Ganguly:
Counting distinct items over update streams. Theor. Comput. Sci. 378(3): 211-222 (2007) - [c29]Sumit Ganguly, Graham Cormode
:
On Estimating Frequency Moments of Data Streams. APPROX-RANDOM 2007: 479-493 - [c28]Sumit Ganguly, Anirban Majumder:
CR-precis: A Deterministic Summary Structure for Update Data Streams. ESCAPE 2007: 48-59 - [c27]Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi, Krishan K. Sabnani:
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks. ICDCS 2007: 4 - [i2]Sumit Ganguly:
An algebraic approach to complexity of data stream computations. CoRR abs/cs/0701004 (2007) - 2006
- [c26]Lakshminath Bhuvanagiri, Sumit Ganguly:
Estimating Entropy over Data Streams. ESA 2006: 148-159 - [c25]Sumit Ganguly, Barna Saha:
On Estimating Path Aggregates over Streaming Graphs. ISAAC 2006: 163-172 - [c24]Sumit Ganguly, Anirban Majumder:
Deterministic k-set structure. PODS 2006: 280-289 - [c23]Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Simpler algorithm for estimating frequency moments of data streams. SODA 2006: 708-713 - [i1]Sumit Ganguly, Anirban Majumder:
CR-precis: A deterministic summary structure for update data streams. CoRR abs/cs/0609032 (2006) - 2005
- [c22]Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Practical Algorithms for Tracking Database Join Sizes. FSTTCS 2005: 297-309 - [c21]Sumit Ganguly:
Counting Distinct Items over Update Streams. ISAAC 2005: 505-514 - [c20]Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, Rajeev Rastogi:
Join-distinct aggregate estimation over update streams. PODS 2005: 259-270 - 2004
- [j6]Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi:
Tracking set-expression cardinalities over continuous update streams. VLDB J. 13(4): 354-369 (2004) - [c19]Sumit Ganguly:
Estimating Frequency Moments of Data Streams Using Random Linear Combinations. APPROX-RANDOM 2004: 369-380 - [c18]Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi:
Processing Data-Stream Join Aggregates Using Skimmed Sketches. EDBT 2004: 569-586 - [c17]Abhinandan Das, Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi:
Distributed Set Expression Cardinality Estimation. VLDB 2004: 312-323 - 2003
- [c16]Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi:
Processing Set Expressions over Continuous Update Streams. SIGMOD Conference 2003: 265-276 - [c15]Philip Bohannon, Xin Dong, Sumit Ganguly, Henry F. Korth, Chengkai Li, P. P. S. Narayan, Pradeep Shenoy:
ROLEX: Relational On-Line Exchange with XML. SIGMOD Conference 2003: 673 - 2002
- [j5]Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carlo Zaniolo:
Pushing extrema aggregates to optimize logic queries. Inf. Syst. 27(5): 321-343 (2002) - [c14]Sourav Chatterji, Sai Surya Kiran Evani, Sumit Ganguly, Mahesh Datt Yemmanuru:
On the Complexity of Approximate Query Optimization. PODS 2002: 282-292 - [c13]Philip Bohannon, Sumit Ganguly, Henry F. Korth, P. P. S. Narayan, Pradeep Shenoy:
Optimizing View Queries in ROLEX to Support Navigable Result Trees. VLDB 2002: 119-130
1990 – 1999
- 1998
- [c12]Sergio Greco, Carlo Zaniolo, Sumit Ganguly:
Optimization of Logic Queries with MIN and MAX Predicates. FQAS 1998: 188-202 - [c11]Sumit Ganguly:
Design and Analysis of Parametric Query Optimization Algorithms. VLDB 1998: 228-238 - 1996
- [j4]Sumit Ganguly, Michiel O. Noordewier:
PROXIMAL: A database system for the efficient retrieval of genetic information. Comput. Biol. Medicine 26(3): 199-207 (1996) - [c10]Sumit Ganguly, Akshay Goel, Abraham Silberschatz:
Efficient and Acurate Cost Models for Parallel Query Optimization. PODS 1996: 172-181 - [c9]Sumit Ganguly, Phillip B. Gibbons, Yossi Matias, Abraham Silberschatz:
Bifocal Sampling for Skew-Resistant Join Size Estimation. SIGMOD Conference 1996: 271-281 - 1995
- [j3]Sumit Ganguly, Sergio Greco, Carlo Zaniolo:
Extrema Predicates in Deductive Databases. J. Comput. Syst. Sci. 51(2): 244-259 (1995) - [j2]Sumit Ganguly, Abraham Silberschatz, Shalom Tsur:
Mapping Datalog Program Execution to Networks of Procesors. IEEE Trans. Knowl. Data Eng. 7(3): 351-361 (1995) - [c8]Sumit Ganguly, Apostolos Gerasoulis, Weining Wang:
Partitioning Pipelines with Communication Costs. CISMOD 1995: 302-320 - 1994
- [c7]Sumit Ganguly, Ravi Krishnamurthy:
Parametric Distributed Query Optimization based on Load Conditions. COMAD 1994 - 1993
- [c6]Rafael Alonso, Sumit Ganguly:
Query Optimization for Energy Efficiency in Mobile Environments. FMLDO 1993: 1-17 - 1992
- [b1]Sumit Ganguly:
Parallel Evaluation of Deductive Database Queries. University of Texas, Austin, 1992 - [j1]Sumit Ganguly, Abraham Silberschatz, Shalom Tsur:
Parallel Bottom-Up Processing of Datalog Queries. J. Log. Program. 14(1&2): 101-126 (1992) - [c5]Sergio Greco, Carlo Zaniolo, Sumit Ganguly:
Greedy by Choice. PODS 1992: 105-113 - [c4]Sumit Ganguly, Waqar Hasan, Ravi Krishnamurthy:
Query Optimization for Parallel Execution. SIGMOD Conference 1992: 9-18 - 1991
- [c3]Sumit Ganguly, Ravi Krishnamurthy, Abraham Silberschatz:
An Analysis Technique for Transitive Closure Algorithms: A Statistical Approach. ICDE 1991: 728-735 - [c2]Sumit Ganguly, Sergio Greco, Carlo Zaniolo:
Minimum and Maximum Predicates in Logic Programming. PODS 1991: 154-163 - 1990
- [c1]Sumit Ganguly, Abraham Silberschatz, Shalom Tsur:
A Framework for the Parallel Processing of Datalog Queries. SIGMOD Conference 1990: 143-152
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
