Vivek Sardeshmukh

My name is Vivek B. Sardeshmukh.

I am a Ph.D. candidate at The University of Iowa in Department of Computer Science.

My Ph.D. adviser is Prof. Sriram Pemmaraju and I am a part of Algorithms Research Group here at University of Iowa.

I am a Ph.D. candidate at The University of Iowa in Department of Computer Science.

My Ph.D. adviser is Prof. Sriram Pemmaraju and I am a part of Algorithms Research Group here at University of Iowa.

101C MacLean Hall | ||||||

Computer Science | ||||||

The University of Iowa | ||||||

Iowa City, IA 52242-1419 |

By appointment only.

**theoretical computer science:** distributed algorithms, graph theory

**big-data analysis:** spatial data, social network data, epidemiology data, quantum molecular dynamics data

**Theory**

My research focus is mainly on theoretical computer science. Specifically, I am more interested in problems in distributed computing and graph theory. Recently, I started working on theoretical aspects of social networks too. I am currently working with my PhD advisor Prof. Sriram Pemmaraju. I am also a part of weekly Algorithms Reading Group(ARG) where we discuss recent research papers on distributed computing, computational geometry, and self-stabilization.

**Computational Epidemiology**In Summer 2014, I started working on disease spread simulations and modelling which compliments my theory research. We are trying to make use of our theory techniques developed for Congested Clique model to distributed disease spread simulations. Please visit Chikitsa web-page for further details.

**Spatial-data Processing**During summer of 2013 I started working with Prof. Ramanathan Sugumaran on LiDAR data processing. Specifically we are interested in processing massive amount of data produced by LiDAR in a distributed and/or parallel way. I look at this project as a good mixture of theory (computational geometry) and systems (HPC, cloud computing).

**Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning**with Purnima Ghale, Georg Hanh, Matthew Kroonblawd, Sergio Pino, and Jerry Shi.*Poster, SuperComputing 2015*.**Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST**with James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, and Michele Scquizzato.*PODC 2015*. (ACM.**Near-Constant-Time Distributed Algorithms on a Congested Clique**with James W. Hegeman and Sriram V. Pemmaraju.*DISC 2014*. (arXiv).**Processing Remote Sensing Data Using Cloud Computing Environments**. with R. Sugumaran, J. W. Hegeman, M. P. Armstrong. book chapter,*Remote Sensing Handbook (in press)*.**Distributed LiDAR Data Processing in a High-Memory Cloud-Computing Environment**. with R. Sugumaran, J. W. Hegeman, M. P. Armstrong.*Annals of GIS, 2014*.**On the Analysis of a Label Propagation Algorithm for Community Detection**, with Kishore Kothapalli and Sriram V. Pemmaraju.*ICDCN, 2013*. (arXiv).**Lower Bounds for Distributed Problems in Low Diameter Networks**,*Poster, PhD Forum, ICDCN 2013*.**Dynamic Trust Assignment in Vehicular Ad-hoc Networks (VANETs)**,*Master's Thesis*, IIT Kharagpur, 2011. Thesis Advisor : Prof. Arobinda Gupta

**SmallWorld: Hadoop implementation of all-pair shortest path**This was done as a part of Big Data Technology course that I took. The problem was motivated from my ICDCN'13 paper and my another course- Social Networks: Models and Analysis. I verified the "small-world" property of various social networks including Power-grid network, co-author network,etc.

**Distributed processing of large-scale LiDAR spatial data**(on github)We implemented our proposed approaches for data reduction and Delaunay triangulation of the reduced data. The implementation is in C with socket programming and threading. We deployed our framework on high-memory nodes on Amazon Web Services (AWS) Elastic Compute Cloud (EC2).

**StarExec**In Spring 2012 I was a part-time research assistant for Prof. Aaron Stump for this project. I enjoyed coding in Java, JSP, JQuery, and MySQL (the "cutting edge" technologies for the web development) for this project.

- HackerRank

highlights: in top 200 programmers in Data Structure domain, 87th percentile of Algorithms domain

- Project Euler

highlights: 5 awards, Level 2

- Spring 2015

**22C:031 Algorithms**(Primary instructor: Prof. Hantao Zhang)

- Spring 2013

**22C:231 Design and Analysis of Algorithms**(Primary instructor: Prof. Kasturi Varadrajan)

**22C:021 Computer Science II: Data Structures**(Primary instructor: Dr. Andy Berns)

- Spring 2012

**22C:148 Research Methods for HCI**(Primary instructor : Prof. Juan Pablo Hourcade)

- Fall 2011

**22C:019 Discrete Structures**(Primary instructor : Prof. Sukumar Ghosh)

**22C:144 Database Systems**(Primary instructor : Prof. Padmini Srinivasan)

- I gave an invited talk at the 2015 Graduate Research Symposium at the University of Iowa. I gave a brief overview on Distributed Graph Algorithms on the Congested Clique.
- I was an additional reviewer for Structural Information and Communication Complexity (SIROCCO) 2012 Conference. Here are the proceedings for this conference.
- I am a part of the Algorithms Reading Group (ARG) here at University of Iowa. We meet weekly to discuss recent research papers in Algorithms, Computational Geometry, and Distributed Computing.

I like to write bash scripts for anything that I have to do on a regular basis (over a short-time span or long-time span, it doesn't matter).

here are few.

- I graduated in May, 2011 from IIT Kharagpur.
- Here you can visit my personal web page of my previous institute.