The SCEAS System
| |||||||

## Search the dblp DataBase
Andrew McGregor:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Boulos Harb, Sampath Kannan, Andrew McGregor
**Approximating the Best-Fit Tree Under L**[Citation Graph (0, 0)][DBLP]_{p}Norms. APPROX-RANDOM, 2005, pp:123-133 [Conf] - Andrew McGregor
**Finding Graph Matchings in Data Streams.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:170-181 [Conf] - Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
**On Graph Problems in a Semi-streaming Model.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:531-543 [Conf] - Deepak Agarwal, Andrew McGregor, Jeff M. Phillips, Suresh Venkatasubramanian, Zhengyuan Zhu
**Spatial scan statistics: approximations and performance study.**[Citation Graph (0, 0)][DBLP] KDD, 2006, pp:24-33 [Conf] - Sudipto Guha, Andrew McGregor
**Approximate quantiles and the order of the stream.**[Citation Graph (0, 0)][DBLP] PODS, 2006, pp:273-279 [Conf] - Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor
**Reconstructing strings from random traces.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:910-918 [Conf] - Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
**Graph distances in the streaming model: the value of space.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:745-754 [Conf] - Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian
**Streaming and sublinear approximation of entropy and information distances.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:733-742 [Conf] - Alexander Barg, Andrew McGregor
**Distance distribution of binary codes and the error probability of decoding**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
**On graph problems in a semi-streaming model.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:207-216 [Journal] - Alexander Barg, Andrew McGregor
**Distance distribution of binary codes and the error probability of decoding.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:12, pp:4237-4246 [Journal] - Sudipto Guha, Piotr Indyk, Andrew McGregor
**Sketching Information Divergences.**[Citation Graph (0, 0)][DBLP] COLT, 2007, pp:424-438 [Conf] - Sudipto Guha, Andrew McGregor
**Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:704-715 [Conf] - Matthew Chu, Sampath Kannan, Andrew McGregor
**Checking and Spot-Checking the Correctness of Priority Queues.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:728-739 [Conf] - T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
**Estimating statistical aggregates on probabilistic data streams.**[Citation Graph (0, 0)][DBLP] PODS, 2007, pp:243-252 [Conf] - Andrew McGregor, Bruce Shepherd
**Island hopping and path colouring with applications to WDM network design.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:864-873 [Conf] - Amit Chakrabarti, Graham Cormode, Andrew McGregor
**A near-optimal algorithm for computing the entropy of a stream.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:328-335 [Conf] - Andrew McGregor, Olgica Milenkovic
**On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Andrew McGregor, S. Muthukrishnan
**Estimating Aggregate Properties on Probabilistic Streams**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Stanislav Angelov, Keshav Kunal, Andrew McGregor
**Sorting and Selection with Random Costs**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Finding Metric Structure in Information Theoretic Clustering.**[Citation Graph (, )][DBLP]**The Oil Searching Problem.**[Citation Graph (, )][DBLP]**Annotations in Data Streams.**[Citation Graph (, )][DBLP]**Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination.**[Citation Graph (, )][DBLP]**Sorting and Selection with Random Costs.**[Citation Graph (, )][DBLP]**Approximation algorithms for clustering uncertain data.**[Citation Graph (, )][DBLP]**Optimizing linear counting queries under differential privacy.**[Citation Graph (, )][DBLP]**Estimating the confidence of conditional functional dependencies.**[Citation Graph (, )][DBLP]**Declaring independence via the sketching of sketches.**[Citation Graph (, )][DBLP]**Robust lower bounds for communication and stream computation.**[Citation Graph (, )][DBLP]**Space-Efficient Estimation of Robust Statistics and Distribution Testing.**[Citation Graph (, )][DBLP]**Streaming and Sublinear Approximation of Entropy and Information Distances**[Citation Graph (, )][DBLP]**Better Bounds for Frequency Moments in Random-Order Streams**[Citation Graph (, )][DBLP]**Optimizing Histogram Queries under Differential Privacy**[Citation Graph (, )][DBLP]**Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition**[Citation Graph (, )][DBLP]
Search in 0.040secs, Finished in 0.042secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |