The SCEAS System
Navigation Menu

Search the dblp DataBase


Andrew McGregor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boulos Harb, Sampath Kannan, Andrew McGregor
    Approximating the Best-Fit Tree Under Lp Norms. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:123-133 [Conf]
  2. Andrew McGregor
    Finding Graph Matchings in Data Streams. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:170-181 [Conf]
  3. 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]
  4. 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]
  5. Sudipto Guha, Andrew McGregor
    Approximate quantiles and the order of the stream. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:273-279 [Conf]
  6. Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor
    Reconstructing strings from random traces. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:910-918 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. Sudipto Guha, Piotr Indyk, Andrew McGregor
    Sketching Information Divergences. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:424-438 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Andrew McGregor, S. Muthukrishnan
    Estimating Aggregate Properties on Probabilistic Streams [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  20. Stanislav Angelov, Keshav Kunal, Andrew McGregor
    Sorting and Selection with Random Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  21. Finding Metric Structure in Information Theoretic Clustering. [Citation Graph (, )][DBLP]

  22. The Oil Searching Problem. [Citation Graph (, )][DBLP]

  23. Annotations in Data Streams. [Citation Graph (, )][DBLP]

  24. Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. [Citation Graph (, )][DBLP]

  25. Sorting and Selection with Random Costs. [Citation Graph (, )][DBLP]

  26. Approximation algorithms for clustering uncertain data. [Citation Graph (, )][DBLP]

  27. Optimizing linear counting queries under differential privacy. [Citation Graph (, )][DBLP]

  28. Estimating the confidence of conditional functional dependencies. [Citation Graph (, )][DBLP]

  29. Declaring independence via the sketching of sketches. [Citation Graph (, )][DBLP]

  30. Robust lower bounds for communication and stream computation. [Citation Graph (, )][DBLP]

  31. Space-Efficient Estimation of Robust Statistics and Distribution Testing. [Citation Graph (, )][DBLP]

  32. Streaming and Sublinear Approximation of Entropy and Information Distances [Citation Graph (, )][DBLP]

  33. Better Bounds for Frequency Moments in Random-Order Streams [Citation Graph (, )][DBLP]

  34. Optimizing Histogram Queries under Differential Privacy [Citation Graph (, )][DBLP]

  35. Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition [Citation Graph (, )][DBLP]

Search in 0.040secs, Finished in 0.042secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002