people.cs.umass.edu
Home - Prashant Shenoy
http://people.cs.umass.edu/~shenoy
Department of Computer Science. Amherst, MA 01003. Office: 336 CS Building. Email: shenoy @ cs.umass.edu. Phone: (413) 577 0850. Fax: (413) 545 1249. Room 300, (413) 577 0292. Email: ksacco @cs.umass.edu. 8/12: SMART* Energy data now available. Benchlab web benchmarking platform available. PhD (1998), M.S. (1994), Computer Sciences. The University of Texas at Austin. BTech (1993), Computer Science and Engineering. Indian Institute of Technology Bombay. Publications and Recent Talks. Last modified: 2013/0...
shenoysneha.wordpress.com
Betrayal | Twee(tea) Time
https://shenoysneha.wordpress.com/2011/06/05/betrayal
Chirpings of yellow bird. Her eyes fluttered open. She found herself looking at the window curtains and then looked at the clock. She had been asleep for 4 hours. She slowly rolled her eyes and realized she was underneath a bed. She looked at the floor and found the blood dripping from the bed. Slowly the memories of the night haunted her and she heard a gushing noise from her neck to her head. 8220;Hello John”, She said in a choked voice. Within few minutes, she saw a police car as well as John’s ...
satyenkale.com
Satyen Kale's homepage
http://www.satyenkale.com/index.php
Bull; Google Scholar page. I work at Yahoo! In the New York office. Previously, I was at IBM T. J. Watson Research Center as a member of the Algorithms Group. Even earlier, I was a postdoctoral researcher at Yahoo! And Microsoft Research New England, Cambridge, MA. In 2007, I completed my Ph.D. in the department of Computer Science. Under the supervision of Prof. Sanjeev Arora. I completed my B.Tech in Computer Science at the Indian Institute of Technology, Bombay. 229 West 43rd St, 11th floor.
theory.cse.iitm.ac.in
Theory Group @ CSE-IITM
http://theory.cse.iitm.ac.in/tMeet.php
Department of Computer Science and Engineering. Indian Institute of Technology Madras. Balagopals thesis selected for Best Doctoral Dissertation Award (AY 2015-2016) at CSE Dept. GIAN Course : Distributed Network Algorithms: Foundations and Future Directions by Gopal Pandurangan and John Augustine. NPTEL Online Course : Algorithms for Big Data taught by John Augustine. List of upcoming speakers. Teatime Theory on Tuesdays! Weekly Seminar Series organized by the Theory Group. Schedule : Tuesdays @ 4pm.
caldam.org
CALDAM 2017
http://caldam.org/caldam/2017/pre_conference_school.html
Conference on Algorithms and Discrete Applied Mathematics. Birla Institute of Technology and Science, Pilani (BITS Pilani). K K Birla Goa Campus, Goa, India. February 13-14, 2017. CALDAM Indo-German Pre-Conference School on Algorithms and Combinatorics. The school is being organized for PhD students and teachers in computer science and discrete mathematics during February 13-14, 2017 at BITS Pilani K K Birla Goa Campus, Goa, India. This school is organized jointly by BITS Pilani K K Birla Goa Campus.
krishwonders.blogspot.com
Krishna Reddy: I wonder why: October 2007
http://krishwonders.blogspot.com/2007_10_01_archive.html
Krishna Reddy: I wonder why. I am Krishna Reddy. Sunday, October 28, 2007. Happy Birthday Happy Fuzz-man! Krishna Reddy, Fuzzy, World Trade Center. N Joggers' Park at Cuffe Parade. Earlier, words find their futility in expressing the length and breadth and depth of Fuzzy's vastness! And even these 3 dimensions r not good enuf to capture him! Add to them Einstein. S fourth dimension - time. Doesn't fit into even the 26 dimensional. Of the superstring theory. That confirms the existence. Who made Lord Rama.
cfdvs.iitb.ac.in
Centre for Formal Design and Verification of Software
http://www.cfdvs.iitb.ac.in/meetings/meetings.php
Centre for Formal Design. Sumedh Tirodkar, Ph.D. student, Dept. of CSE. Online preemptive matching (lower bound). CFDVS Conference room, IIT Bombay. The deterministic upper and lower bounds for the competitive ratio for this problem are tight. But there is a large gap between randomised upper and lower bounds. We wish to fill this gap. In last talk, I spoke on the randomized algorithm. In this talk, I will discuss the lower bound due to Epstien et.al. Finding graph matchings in data streams, APPROX, 2005.
