CSE642 Algorithm Seminar
Friday 11:00 -12:30 @
Computer Science Lounge (CS Building 1211).
This reading group
provides a meeting place for Stony Brook faculty, postdocs,
and students interested in the analysis of algorithms. We meet once a
with one of three different missions:
-- This is fairly informal, with one person (i.e. student) responsible
each time for leading the discussions. Nobody will have to lead for
more than one paper per semester. We highly encourage students to
volunteer for paper presentations, as it is a good opportunity to learn
how to give a technical presentation and our reading group is a
friendly group of audience to start with. The list of papers you can
choose to present, if you do not have a paper already, can be found
Sessions -- where we pose and
attack accessible research problems.
A good time is had by all.
to the special computational geometry or theory days at NYU, Columbia,
and the like.
You can get one credit for
participating by simply registering for CSE 642. You are also welcome
We have a mailing list.
Further announcement will be distributed through the list. Please
Sep 2nd, Professor Steve Skiena brought a
on twitter. Samuel McCauley took notes.
Sep 9th, we continue with the problem of intelligently
issuing twitter queries. Kalyan Chandra Chintalapati took notes.
Sep 16th, we continue with the problem proposed by Steve.
Sep 23rd, Professor Don Porter brought a new problem.
- Sep 28th, Professor Joe Mitchell proposed the following
problem: can you stab a set of pseudo disks with one pseudo disk? Two
pseudo disks only intersect at at most two intersections. William Hall
came up with a counterexample
in which disks can be nested.