Karthik Abinav Sankararaman

I'm a PhD student in the Department of Computer Science at University of Maryland, College Park (I also received a M.S. degree from the same department). I am advised by Dr. Aravind Srinivasan. Click here for academic ancestry. More recently, I also work with Alex Slivkins.

My research interests broadly span the intersection of Algorithms, Machine Learning and Operations Research. I am interested in both theory and applications of subsets of these areas. On the theory side, I'm particularly inclined towards randomized algorithms, probability, mathematical programming, optimization (discrete and continuous) and online learning. On the application side, I have worked on problems insipired from economics, data-mining. I'm always open to working on projects in other application areas that strongly draws ideas from the theory of these fields.

Previously, I obtained a B.Tech (Hons), with a major in Computer Science and a minor in Operations Research, from Indian Institute of Technology, Madras. My brother and I spent our childhood days in the beautiful city of Bangalore, India.


  • "Attenuate Locally, Win Globally: Attenuation-based Frameworks for Online Stochastic Matching with Timeouts"
    Joint Work with Brian Brubach, Aravind Srinivasan, Pan Xu
    Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2017
  • "New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching"
    Joint Work with Brian Brubach, Aravind Srinivasan, Pan Xu
    Proceedings of the 24th Annual European Symposium on Algorithms (ESA), 2016
    Journal Version Under Submission to Mathematics of Operations Research (INFORMS)
  • "Ensuring Privacy in Location Based Services: An Approach Based on Opacity Enforcement"
    Joint work with Yi-Chin Wu, St`ephane Lafortune.
    Proceedings of the 14th International Workshop of Discrete Event Systems (WODES), 2014

  • Technical Reports

  • "Semi-Bandit Feedback: A survey of results" PDF
    Note this document is still a working one.
  • "Maximum-Flow problem in undirected graphs"
    Karthik Abinav S
    B.Tech Thesis, 2014, Indian Institute Technology Madras
    (Thesis available on request)
  • My Teaching Experience

  • Teaching Assistant - Design and Analysis of Computer Algorithms (UMD)

    Instructors: Samir Khuller, Jessica Chang
  • Teaching Assistant - Design and Analysis of Computer Algorithms (UMD)

    Instructors: Aravind Srinivasan

  • Teaching Assistant - Discrete Structures (UMD)

    Instructors: Clyde Kruskal, Fawzi Emad

  • Teaching Assistant - Introduction to Programming(UMD)

    Instructors: Nelson Padua-Perez, Fawzi Emad

  • Teaching Assistant - Paradigms of Programming(IITM)

    Instructors: Narayanaswamy NS
  • My Industrial Experience

    IBM Almaden Research Center, San Jose

    I spent the Summer of 2016 at IBM Almaden Research center, working with Prithviraj Sen. I worked in the intersection of machine learning and economics.

    Adobe Inc.

    I spent the Summer of 2015 at Adobe Systems Inc, at their San Jose office. I worked with the Algorithms team inside the Digital Marketing team headed by Anil Kamath. I was involved in an applied algorithms project in databases.

    Miscellanous Writings - Academic and Non-Academic

  • A blog I used to maintain to write about a variety of technical and non-technical stuff.

  • A critique I wrote for the Computational Journalism class.
    The article is a critque on FiveThirtyEight publication Best and Worst Airlines.

  • Final project for the Computational Journalism class on Bias in Google's Autocomplete Suggestion.
    Along with Daniel Trielli, we studied the bias in auto-complete suggestions of various country specific
    domains of Google when searched about entities of other countries.
    (For example, searching about Pakistan in India-specific Google page).
    You can find the code used for the experiments here.
    Article summarizing the methodologies and findings

  • Final class project for the Convex Optimization class.
    Along with Manasij Venkatesh and Aditya Acharya, we looked at sparse representations for speech
    using Convex Optimization based approximations. In particular, we applied techniques from compressed
    sensing literature to speech.
    Report, Poster, code

  • Final class project for the Lower Bounds in Algorithms class.
    Along with Tommy Pensyl and Bartosz Rybicki (visiting from Poland), we studied
    lower bounds for fault tolerant variations of the facility location problem.

  • Feel free to contact me

    The best way to contact me is through email.




    +1 240 715 5910


    3204, A.V. Williams Building,
    University of Maryland,
    College Park, MD, 20742