Upcoming events

• New event schedule to be posted soon.

Past events

• Department Tea: The Tao of Network Control, Tuesday March 19, 2013 at 11:30.

  Continuing an ad-hoc theme, Prof. Sommers will lead a department tea on "The Tao of Network Control."

  As usual, lunch will be available.

• Dept Tea: Zen and the Art of Datatype Maintenance, Tuesday March 5, 2013 at 11:30.

  Prof. Mulry will lead a department tea with the intriguing title: "Zen and the art of data type maintenance." (With apologies to Robert Pirsig, of course.)

  As usual, lunch will be available.

• Department Tea: Colgate grads from ZocDoc, Tuesday February 12, 2013 at 11:30.

  Ever wonder what a job in the field of computing is like? Join us for our department tea as Josh Zukoff '13, Carson Carlisle '11, and M. Paul Weeks '12 will be back to discuss their experiences on the job at ZocDoc in NYC.

  As usual, lunch will be available.

• End of semester department party, Tuesday December 4, 2012 at 11:30.

  All majors and minors are encouraged to attend an end-of-semester party on Tuesday 12/4 in the CS department lounge. We hope you'll join us for much food and merriment!

• Department Tea: Yao's Non-adaptive storage problem, Tuesday November 27, 2012 at 11:30.

  Title: Yao's Non-adaptive storage problem with 2 queries

  Join us for a presentation and discussion by Prof. David Howard, Math department.
  As usual, lunch will be available.

  In this talk I will briefly describe a research problem I worked on that is located somewhere between mathematics and computer science. The problem involves a mathematical storage scheme.

  The set-up:

  At the Raider Inn there are n rooms and as this is a very special inn only m specific people in the whole world are allowed to spend the night in the inn. Furthermore as this inn is very popular every night it is completely filled with guests but only one person can stay per room. There are of course 13 managers in this hotel and they each know what the storage scheme for this hotel is (i.e. for any n set from the m people that stays in the hotel one night there is an exact predetermined assignment of rooms depending on the n set). Furthermore, for each member in the special m set of people there exist two special rooms (which are not necessarily uniquely assigned to the members of m) called their query rooms. These query rooms are special in the following way: Suppose a manager does not have the guest list for a particular night at the hotel; however, the manager wants to know if a particular person (call this person Jack) is in the hotel for the given evening. All this manager must do is find out who is staying in Jack's special query rooms and the manager can definitively answer whether Jack is staying in the hotel. (Note: the answer can be yes even if the manager did not see Jack in either query room.)

  The question that arises given this set-up: How big can m be in relation to n?

  I will briefly say what the going results are and, if time allows, future research directions for this topic.
  

Events history

• Show all older events