Andrew McGregor

Hi, I'm an assistant professor in the Department of Computer Science at the University of Massachusetts, Amherst. I'm a member of the theory group and my research is in algorithms and complexity. Specific topics include processing massive data sets and data streams, clustering, approximation algorithms, coding and information theory. Feel free to check out my research papers or cv.

Prior to UMass, I spent a great couple of years at Microsoft Research (Silicon Valley) and the Information Theory and Applications Center at UCSD. In 2007, I received my Ph.D. from the University of Pennsylvania. During graduate school, I spent a summer at DIMACS and three summers at the Fundamental Maths Department at Bell Labs. In the dim and distant past, I received the Certificate of Advanced Study in Mathematics (2001) and a B.A. in Mathematics (2000) from the University of Cambridge. Here's the text of a short bio.

---

Since you're here, maybe you'd like to...

• get in contact:
  • Mail: Department of Computer Science, 140 Governor's Drive, University of Massachusetts, Amherst, MA 01003-9264
  • Office: Room 334, 140 Governor's Drive (Campus Map and Area Map)
  • Email: mcgregor at cs.umass.edu
• read some of my favourite papers (see here for more):
  • Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
    FOCS 2010 (with A. Chakrabarti, G. Cormode, and R. Kondapally)
  • A Near-Optimal Algorithm for Computing the Entropy of a Stream
    ACM Transactions on Algorithms, 6 (2010), no. 3, pg. 1-21 (with A. Chakrabarti and G. Cormode).
  • Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
    SIAM Journal of Computing, 38 (2009), no. 1, 2044-2059 (with S. Guha)
  • Robust Lower Bounds for Communication and Stream Computation
    STOC 2008 (with A. Chakrabarti and G. Cormode)
  • Graph Distances in the Data Stream Model
    SIAM Journal of Computing, 28 (2008), no. 5, pg. 1709-1727 (with J. Feigenbaum, S. Kannan, S. Suri, and J. Zhang)
• submit a great paper to one of the following conferences/workshops that I'm involved with:
  • 32th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '13)
  • STOC Workshop: Algorithms for Distributed and Streaming Data (STOC '12)
  • ACM-SIAM Symposium on Theory of Computing Algorithms (STOC '12)
  • 5th International Frontiers of Algorithmics Workshop (FAW '11)
  • 19th ACM Conference on Information and Knowledge Management (CIKM '10)
  • 6th IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS '10)
  • ACM-SIAM Symposium on Discrete Algorithms (SODA '10)
  • IIT Kanpur Workshop on Algorithms for Processing Massive Data Sets ('09)
  • DIMACS Workshop on Streaming, Coding, and Compressive Sensing ('09)
• review some slides from recent talks on:
  • "Crash Course in Data Streams: Part I" and "Part II" (John Hopkins APL '10).
  • "Data Streams, Dyck Languages, and Detecting Dubious Data Structures" (University of Edinburgh, Random Graals '10)
  • "Annotations in Data Streams" (INFORMS '09, IITK WAPMDS '09)
  • "Graph and Geometry Problems in the Data Stream Model" and "Data Streams: Random Order and Multiple Passes" (Barbados Workshop on Computational Complexity '09).
  • "Robust Lower Bounds for Communication and Stream Computation" (STOC '08)
  • "Streaming and Sketching for Distributions" (NIPS '07)

---

"We know that five minus four is one
But a cloud minus a sailboat
Have no idea what it is."

-- Another Kind of Mathematics, Nichita Stanescu