Portrait de Janardhan (Jana) Kulkarni

Janardhan (Jana) Kulkarni

Principal Researcher

More Research

    • Approximation algorithms
    • Online algorithms
    • Online learning
    • Game theory
    • Differential privacy
    • Data-analytics.

    • Committee: MAPSP’17
    • Reviewer/subreviewer for : STOC, FOCS, SODA, JACM, SICOMP, etc.

    • Online Flow-Time Optimization. Simons Institute For Theory of Computing, Berkely. Sept’16.
    • A Market View of Multidimensional Scheduling. University of Wisconsin-Madison, April’16
    • Price of Anarchy Analysis Via Duality. MSR Theory Day, Redmond. March’16.
    • The Design of Scheduling Algorithms Using Equilibrium Principles. Washington University in St.Louis, March’16
    • Minimizing Flow-time on Unrelated Machines. University of Washington, Seattle. Oct’15
    • Dual-Fitting Framework For Non-Clairvoyant Scheduling. Workshop on Online Algorithms and Learning, Lorentz Center, NL. Nov’14
    • Dual-Fitting Framework For Non-Clairvoyant Scheduling. IISc, Bangalore, Sept 2014.
    • Non-Clairvoyant Scheduling To Minimize Weighted Flow-Time. China Theory Week, 2014.
    • Non-Clairvoyant Scheduling To Minimize Weighted Flow-Time. IBM T.J.Watson Research Center, NYC. Apr’14
    • Dual Fitting Framework for Scheduling and Routing Games. Google Research, NYC. Oct 14.

  • (If you are curious about any of the results below, send me an email and I will send you a copy.)

    • Minimum Birkhoff-von Neumann Decompositionswith Euiwoong Lee, Mohit Singh (submitted)
    • Minimizing General Delay Costs on Unrelated Machineswith Nikhil Devanur (submitted)
    • New Results on Online Vector Schedulingwith Sungjin Im, Nat Kell, Debmalya Panigrahi, Maryam Shadloo (submitted)
    • Optimal Tradeoff Between Fairness and Efficiencywith Nikhil Devanur, Srikanth Kandula, Ishai Menache (submitted)