[Combinatorica Graphs]
graph 1 graph 2 graph 3 Graphs in Combinatorica.
Here is more about Combinatorica.

Sriram Pemmaraju

Professor and Director of Graduate Studies

Coordinates:
101 G McLean Hall, Department of Computer Science, The University of Iowa, Iowa City, IA 52242-1419
319 353 2956 (voice), 319 335 3624 (fax)
sriram-pemmaraju@uiowa.edu

Office Hours:
1:30-2:30 M, 10:30-11:30 W, 2:00-3:00 F (and by appointment).

Research:
Broadly speaking, my research area is theoretical computer science. More specifically, my current research interests are in distributed algorithms, randomization, and approximation algorithms and combinatorial optimization. I am part of the Algorithms Research Group at Iowa. I have also become interested in models and algorithms for contact networks, diffusion of disease through contact networks, and the design of effective policies to mitigate disease spread. I am part of the Computational Epidemiology Group at Iowa.

Openings for Fall 2019:
I am looking for PhD students in distributed algorithms and PhD students and a post-doctoral fellow in computational epidemiology. Read on if you are interested...

Recent Publications:

  • Large-Scale Distributed Algorithms for Facility Location with Outliers
    with Tanmay Inamdar and Shreyas Pai. 22nd International Conference on Principles of Distributed Systems, December 2018, Hong Kong. Full paper at arxiv.
  • Near-Optimal Clustering in the k-machine model
    with Sayan Bandyapadhyay, Tanmay Inamdar and Shreyas Pai. 19th International Conference on Distributed Computing and Networking, Jan 2018, Varanasi India. Full paper at arxiv.
  • Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets
    with Shreyas Pai, Gopal Pandurangan, Talal Riaz, and Peter Robinson. Brief announcement in Thirty-sixth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2017), July 2017 and paper in 31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria. Full paper at arxiv.
  • Super-fast MST Algorithms in the Congested Clique using o(m) Messages
    with Vivek Sardeshmukh. 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Dec 2016. Full paper at arxiv.
  • Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
    with Talal Riaz. Brief announcement in Thirty-fifth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2016), July 2016 and paper in The 20th International Conference on Principles of Distributed Systems (OPODIS), Madrid, Spain, Dec 2016 Full paper at arxiv.
See my dblp page for a longer list of publications.

PhD Students:

  • Current: Talal Riaz, Shreyas Pai.
  • Former Students: Vivek Sardeshmukh (2016, Cadence Design Systems, San Jose), Mauricio Monsalve (2015, Post-doc at CIGIDEN), Andrew Berns (2012, U of Northern Iowa), Donald Curtis (2011, Google), Saurav Pandit (2010, Authenticated Digital NYC), Imran Pirwani (2008, Apple Inc), Kevin Lillis (2008, St.Ambrose University), Rajiv Raman (2007, IIIT Delhi).

Current Teaching (fall 2018):

Here you can find course pages of classes I have taught since 2001.

Other Recent Activities:

Graduate Programs in CS at the University of Iowa
Visit the Graduate Programs pages to learn more about the graduate degrees (PhD and MCS) offered by the Department of Computer Science at the University of Iowa.

Back to the departmental homepage.


The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been approved by Mathematical Sciences, the College of Liberal Arts, or The University of Iowa.