Students who have been admitted into the program without an engineering baccalaureate must make up prerequisite coursework at the basic level of undergraduate engineering in order to be eligible for the M.S. The coursework option is designed to be completed in 9 to 12 months students pursuing this option receive no or partial financial assistance. The research option is usually followed by students receiving financial support in the form of a research or teaching assistantship (RA, TA). The specific degree requirements and the appropriate degree depend on your undergraduate background and if the degree is research based or not. The two paths are the research option and the coursework option. degree through the Environmental and Water Resources Engineering Program. Two main paths are available for obtaining the M.S. Master of Science in Environmental Engineering Undergraduate Experience: Environmental Engineering.Environmental & Water Resources Engineering.Unfortunately, I don't have any funds to support summer interns except for students eligible for the REU program.
student, check out this, this, and everything here. For general advice about being a Ph.D.If you'd like to work with me, mention it in your application and send me an email. See here and here for the official application procedure.A good grasp of probability is particularly useful in my work. A strong math background is a must for any area of theoretical computer science.Great! I like the research I do (admittedly I'm biased) but see my papers to make sure you would too.DIMACS/DyDAn Workshop on Streaming, Coding, and Compressive Sensing: Unifying Theory and Common Applications to Sparse Signal/Data Analysis and Processing (2009).IITK Workshop on Algorithms for Processing Massive Data Sets.STOC 2012 Workshop: Algorithms for Distributed and Streaming Data,.Data Streams and Compression (Special Session of CiE 2013),.Communication Complexity and Applications, Banff International Research Station (2014).Algorithms for Large-Scale Graphs, NII Shonan (2014).Towards a Unified Treatment of Dynamic Graphs, Banff International Research Station (2015).Nexus of Information and Computation Theories, Henri Poincare Institute (2016).Communication Complexity and Applications II, Banff International Research Station (2017).Linear Sketching as a Tool for Everything, FOCS Workshop (2017).Related tutorials given at ICML (2016) and VLDB (2012). Sampling, Sketching, Streaming, Small-Space Optimization: Algorithmic Approachesįor Analyzing Large Graphs, KDD (2018).check out material from one of workshops and tutorials I've been organizing:.submit a paper to a conference where I'm on the PC:.Office: Room 334, 140 Governor's Drive ( Campus Map and Area Map).Mail: College of Information and Computer Sciences, 140 Governor's Drive, University of Massachusetts, Amherst, MA 01003-9264.
Here's text of a short bio, a photo, and a cv. in Mathematics (2000) from the University of Cambridge. In the dim and distant past, I received the Certificate of Advanced Study in Mathematics (2001) and a B.A. from the University of Pennsylvania.ĭuring graduate school, I spent a summer at DIMACS and three summers at the Fundamental Maths Department at Bell Labs. Prior to UMass, I spent a great couple of years at Microsoft Research (Silicon Valley) and the Information Theory and Applications Center at UCSD. Graduate Program Director for the College.Director of TRIPODS Institute for Theoretical Foundations of Data Science at UMass.
Specific topics of interest include processing massive data sets and data streams, clustering, approximation algorithms, coding and information theory. I'm a member of the Theory Group and my research is in algorithms and complexity.
Hi, I'm a Professor in the College of Information and Computer Sciences at the University of Massachusetts, Amherst.