Research Interests


  • Approximation Algorithms & Combinatorial Optimization
  • Distributed and Parallel Systems
  • Wireless and Sensor Networks

Publications


Refereed Conferences and Journals

  • The Strong At-Most-Once Problem
    S. Kentros, C. Kari, A. Kiayias
    In the 26th International Symposium on DIStributed Computing (DISC 2012 ). October 16-18, 2012 Salvador, Brazil.
  • Data Migration in Heterogeneous Storage Systems
    C. Kari, Y. Kim, A. Russell
    The 31st Int'l Conference on Distributed Computing Systems (ICDCS 2011 ). June 20-24, 2011 Minneapolis, Minnesota, USA.
  • Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs
    C. Kari, A. Russell and N. Shashidhar.
    The 7th IEEE International Symposium on Network Computing and Applications
    (IEEE NCA 2008) Cambridge, MA
  • Soft Edge Coloring
    C. Kari Y. Kim, S. Lee, A. Russell and M. Shin.
    The 10th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2007 ). August 20-22, 2007 Princeton, NJ
  • Competitive Scheduling of Dependent Tasks for Cooperative Computing
    C. Kari, A. Russell and N. Shashidhar
    Submitted
  • (1 + ε) Approximation for Soft Edge Coloring
    C. Kari, Y. Kim, A. Russell
    Submitted

In Preparation

  • Online Soft Edge Coloring
  • Fast Effectiveness-Optimal solutions for the Randomized At-Most-Once Problem
  • Work-Competitive Scheduling with task dependencies
  • Scalable Resource Discovery in Bandwidth Bounded Networks

Technical Reports

  • A Paradigm for Channel Assignment and Data Migration in Distributed Systems ArXiv:1010.4018v1

Professional Services


  • Reviewer IEEE Conference on Computational Advances in Bio and Medical Sciences (ICCABS 12)
  • Reviewer International Conference on Computing, Networking and Communication (ICNC 12)
  • Reviewer IEEE International Symposium on Network Computing and Applications (IEEE NCA 10)

Professional Memberships


  • ACM
  • IEEE
  • Upsilon Pi Epsilon (UPE)

Contact Information