I am currently a third year PhD student in the
department of Computer & Information Sciences at University of Pennsylvania, affilated
with the Theory Research Group. I am very fortunate to have Sanjeev Khanna as my advisor.
Prior to my enrollment at Penn, I got my B.Sc. degree in Computer Engineering from department of Computer Engineering at
Sharif University of Technology, Iran.
My primary research interest is in algorithms for processing massive data sets and in particular streaming algorithms. I am also interested in the areas of approximation & online algorithms, communication complexity, and algorithmic game theory.
- The Stochastic Matching Problem With (Very) Few Queries EC 2016
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem STOC 2016
- Algorithms for Provisioning Queries and Analytics ICDT 2016
- Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model SODA 2016
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches FSTTCS 2015
- Fast Convergence in the Double Oral Auction WINE 2015 (invited to TEAC special issue for WINE'15 papers)
- Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets HCOMP 2015
- On The Rectangle Escape Problem CCCG 2013
- The Minimum Vulnerability Problem ISAAC 2012 (full version in Algorithmica special issue for ISAAC'12 papers)
- • Teaching assistant, University of Pennsylvania
- Introduction to Algorithms (Spring 2015)
- Advanced Topics in Algorithms & Complexity: Randomized Algorithms (Fall 2014)
- • Teaching assistant, Sharif University of Technology
- Advanced Topics in Theory of Computability, Complexity and Logic (Spring 2013)
- Design and Analysis of Algorithms: (Spring 2013, Fall 2012, Spring 2012 and Spring 2011)
- Data Structures and Fundamentals of Algorithms: (Fall 2012, Fall 2011, Spring 2011 and Fall 2010)
- Theory of Machine Languages and Automata: (Spring 2013, Fall 2012 , Spring 2012, Fall 2011 and Spring 2011)