| 2012 |
| 55 | The shifting sands algorithm. Andrew McGregor, Paul Valiant. SODA 2012, 453-458. Web SearchBibTeXDownload |
| 54 | Analyzing graph structure via linear measurements. Kook Jin Ahn, Sudipto Guha, Andrew McGregor. SODA 2012, 459-467. Web SearchBibTeXDownload |
| 2011 |
| 53 | Periodicity and Cyclic Shifts via Linear Sketches. Michael S. Crouch, Andrew McGregor. APPROX-RANDOM 2011, 158-170. Web SearchBibTeXDownload |
| 52 | Robust Lower Bounds for Communication and Stream Computation. Amit Chakrabarti, Graham Cormode, Andrew McGregor. Electronic Colloquium on Computational Complexity (ECCC) (18): 62 (2011). Web SearchBibTeXDownload |
| 51 | The Limits of Two-Party Differential Privacy. Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan. Electronic Colloquium on Computational Complexity (ECCC) (18): 106 (2011). Web SearchBibTeXDownload |
| 50 | A platform for scalable one-pass analytics using MapReduce. Boduo Li, Edward Mazur, Yanlei Diao, Andrew McGregor, Prashant J. Shenoy. SIGMOD Conference 2011, 985-996. Web SearchBibTeXDownload |
| 49 | Polynomial Fitting of Data Streams with Applications to Codeword Testing. Andrew McGregor, Atri Rudra, Steve Uurtamo. STACS 2011, 428-439. Web SearchBibTeXDownload |
| 2010 |
| 48 | A near-optimal algorithm for estimating the entropy of a stream. Amit Chakrabarti, Graham Cormode, Andrew McGregor. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload |
| 47 | Fast query expansion using approximations of relevance models. Marc-Allen Cartright, James Allan, Victor Lavrenko, Andrew McGregor. CIKM 2010, 1573-1576. Web SearchBibTeXDownload |
| 46 | Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition. Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor. CoRR (abs/1004.3304) (2010). Web SearchBibTeXDownload |
| 45 | The Limits of Two-Party Differential Privacy. Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan. FOCS 2010, 81-90. Web SearchBibTeXDownload |
| 44 | Space-Efficient Estimation of Robust Statistics and Distribution Testing. Steve Chien, Katrina Ligett, Andrew McGregor. ICS 2010, 251-265. Web SearchBibTeXDownload |
| 43 | On the hardness of approximating stopping and trapping sets. Andrew McGregor, Olgica Milenkovic. IEEE Transactions on Information Theory (56): 1640-1650 (2010). Web SearchBibTeXDownload |
| 42 | Optimizing linear counting queries under differential privacy. Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, Andrew McGregor. PODS 2010, 123-134. Web SearchBibTeXDownload |
| 41 | Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations. Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Liping Peng, Anna Liu. PVLDB (3): 1302-1313 (2010). Web SearchBibTeXDownload |
| 2009 |
| 40 | Sublinear estimation of entropy and information distances. Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian. ACM Transactions on Algorithms (5) (2009). Web SearchBibTeXDownload |
| 39 | Optimizing Histogram Queries under Differential Privacy. Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, Andrew McGregor. CoRR (abs/0912.4742) (2009). Web SearchBibTeXDownload |
| 38 | Graph Mining on Streams. Andrew McGregor. Encyclopedia of Database Systems 2009, 1271-1275. Web SearchBibTeXDownload |
| 37 | The Oil Searching Problem. Andrew McGregor, Krzysztof Onak, Rina Panigrahy. ESA 2009, 504-515. Web SearchBibTeXDownload |
| 36 | Annotations in Data Streams. Amit Chakrabarti, Graham Cormode, Andrew McGregor. ICALP (1) 2009, 222-234. Web SearchBibTeXDownload |
| 35 | Probabilistic Histograms for Probabilistic Data. Graham Cormode, Antonios Deligiannakis, Minos N. Garofalakis, Andrew McGregor. PVLDB (2): 526-537 (2009). Cited by 1Web SearchBibTeXDownload |
| 34 | Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams. Sudipto Guha, Andrew McGregor. SIAM J. Comput. (38): 2044-2059 (2009). Cited by 8Web SearchBibTeXDownload |
| 33 | Estimating the confidence of conditional functional dependencies. Graham Cormode, Lukasz Golab, Flip Korn, Andrew McGregor, Divesh Srivastava, Xi Zhang. SIGMOD Conference 2009, 469-482. Cited by 1Web SearchBibTeXDownload |
| 2008 |
| 32 | Estimating statistical aggregates on probabilistic data streams. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. ACM Trans. Database Syst. (33) (2008). Cited by 33Web SearchBibTeXDownload |
| 31 | Finding Metric Structure in Information Theoretic Clustering. Kamalika Chaudhuri, Andrew McGregor. COLT 2008, 391-402. Web SearchBibTeXDownload |
| 30 | Better Bounds for Frequency Moments in Random-Order Streams. Alexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy. CoRR (abs/0808.2222) (2008). Web SearchBibTeXDownload |
| 29 | Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. Sudipto Guha, Andrew McGregor. ICALP (1) 2008, 760-772. Cited by 3Web SearchBibTeXDownload |
| 28 | Sorting and Selection with Random Costs. Stanislav Angelov, Keshav Kunal, Andrew McGregor. LATIN 2008, 48-59. Web SearchBibTeXDownload |
| 27 | Sketching information divergences. Sudipto Guha, Piotr Indyk, Andrew McGregor. Machine Learning (72): 5-19 (2008). Cited by 12Web SearchBibTeXDownload |
| 26 | Approximation algorithms for clustering uncertain data. Graham Cormode, Andrew McGregor. PODS 2008, 191-200. Cited by 17Web SearchBibTeXDownload |
| 25 | Graph Distances in the Data-Stream Model. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. SIAM J. Comput. (38): 1709-1727 (2008). Web SearchBibTeXDownload |
| 24 | Declaring independence via the sketching of sketches. Piotr Indyk, Andrew McGregor. SODA 2008, 737-745. Cited by 9Web SearchBibTeXDownload |
| 23 | Robust lower bounds for communication and stream computation. Amit Chakrabarti, Graham Cormode, Andrew McGregor. STOC 2008, 641-650. Cited by 16Web SearchBibTeXDownload |
| 2007 |
| 22 | Sketching Information Divergences. Sudipto Guha, Piotr Indyk, Andrew McGregor. COLT 2007, 424-438. Web SearchBibTeXDownload |
| 21 | Sorting and Selection with Random Costs. Stanislav Angelov, Keshav Kunal, Andrew McGregor. CoRR (abs/0710.0083) (2007). Web SearchBibTeXDownload |
| 20 | On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes. Andrew McGregor, Olgica Milenkovic. CoRR (abs/0704.2258) (2007). Web SearchBibTeXDownload |
| 19 | Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming. Sudipto Guha, Andrew McGregor. ICALP 2007, 704-715. Cited by 19Web SearchBibTeXDownload |
| 18 | Checking and Spot-Checking the Correctness of Priority Queues. Matthew Chu, Sampath Kannan, Andrew McGregor. ICALP 2007, 728-739. Web SearchBibTeXDownload |
| 17 | Space-Efficient Sampling. Sudipto Guha, Andrew McGregor. Journal of Machine Learning Research - Proceedings Track (2): 171-178 (2007). Web SearchBibTeXDownload |
| 16 | Estimating statistical aggregates on probabilistic data streams. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. PODS 2007, 243-252. Cited by 33Web SearchBibTeXDownload |
| 15 | A near-optimal algorithm for computing the entropy of a stream. Amit Chakrabarti, Graham Cormode, Andrew McGregor. SODA 2007, 328-335. Cited by 40Web SearchBibTeXDownload |
| 14 | Island hopping and path colouring with applications to WDM network design. Andrew McGregor, Bruce Shepherd. SODA 2007, 864-873. Web SearchBibTeXDownload |
| 2006 |
| 13 | Estimating Aggregate Properties on Probabilistic Streams. Andrew McGregor, S. Muthukrishnan. CoRR (abs/cs/0612031) (2006). Cited by 1Web SearchBibTeXDownload |
| 12 | Spatial scan statistics: approximations and performance study. Deepak Agarwal, Andrew McGregor, Jeff M. Phillips, Suresh Venkatasubramanian, Zhengyuan Zhu. KDD 2006, 24-33. Cited by 11Web SearchBibTeXDownload |
| 11 | Approximate quantiles and the order of the stream. Sudipto Guha, Andrew McGregor. PODS 2006, 273-279. Cited by 25Web SearchBibTeXDownload |
| 10 | Streaming and sublinear approximation of entropy and information distances. Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian. SODA 2006, 733-742. Cited by 38Web SearchBibTeXDownload |
| 2005 |
| 9 | Approximating the Best-Fit Tree Under Lp Norms. Boulos Harb, Sampath Kannan, Andrew McGregor. APPROX-RANDOM 2005, 123-133. Web SearchBibTeXDownload |
| 8 | Finding Graph Matchings in Data Streams. Andrew McGregor. APPROX-RANDOM 2005, 170-181. Web SearchBibTeXDownload |
| 7 | Streaming and Sublinear Approximation of Entropy and Information Distances. Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian. CoRR (abs/cs/0508122) (2005). Web SearchBibTeXDownload |
| 6 | Distance distribution of binary codes and the error probability of decoding. Alexander Barg, Andrew McGregor. IEEE Transactions on Information Theory (51): 4237-4246 (2005). Web SearchBibTeXDownload |
| 5 | Graph distances in the streaming model: the value of space. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. SODA 2005, 745-754. Web SearchBibTeXDownload |
| 4 | On graph problems in a semi-streaming model. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. Theor. Comput. Sci. (348): 207-216 (2005). Web SearchBibTeXDownload |
| 2004 |
| 3 | Distance distribution of binary codes and the error probability of decoding. Alexander Barg, Andrew McGregor. CoRR (cs.IT/0407011) (2004). Web SearchBibTeXDownload |
| 2 | On Graph Problems in a Semi-streaming Model. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. ICALP 2004, 531-543. Web SearchBibTeXDownload |
| 1 | Reconstructing strings from random traces. Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor. SODA 2004, 910-918. Web SearchBibTeXDownload |