Coordinator: Srijit Kamath
Faculty Advisor: Meera Sitharam
Other Faculty:
Below is a list of general goals of the Algorithms and Theory Club. We will meet once a week (time and place to be decided). The number of meetings devoted to each event (per semester) is included.
1. Discussion of problems of general interest. Anyone can feel free to post good problems. Problems (and solutions) may be emailed to me for inclusion on this page. All distinct, correct solutions will be posted a week or more after a problem is posted. Note that we do not plan to schedule regular meetings to discuss these problems. Rather all interaction will be by email and through this page. Click here to view new and previously posted problems
2.
Discussion of Ph. D qualifiers/Masters non-thesis exam problems including
questions that have previously appeared on these exams. Questions from
algorithms for the non-thesis option and from algorithms and theory for Ph. D
exam will be discussed. There will be 4 meetings and these will be scheduled
close to the exam dates for the semester.
3. Discussion of research problems (4 meetings). Will provide an opportunity for students and/or faculty to collaborate on projects. There will be two main presenters who volunteer to describe problems related to their research during each meeting.
4. Talks by faculty (4 meetings) and students (4 meetings) on research problems and special topics.
Note: If you are interested in participating in the activities of the club and wish to receive email about upcoming events please send me an email (srkamath@cise.ufl.edu) and I will add you to the mailing list.
Below I will also cross-list events from other seminars that are of immediate interest to our group.
| Date
| Event
| Description
|
| 09.03.02 | First Meeting | |
| 09.10.02 | Faculty Talk: Chris Jermaine | Topic: Guessing the number of 3 foot tall white giraffes (and related problems). |
| 09.17.02 | Faculty Talk: Mike Frank | Topic: Physical Computing Theory, Ultimate Models, and the Tight Church's Thesis: A More Accurate Complexity Theory for Future Nanocomputing. |
| 09.24.02 | Qualifying Exam Discussion | |
| 10.01.02 | Qualifying Exam Discussion | |
| 10.08.02 | Qualifying Exam Discussion | |
| 10.15.02 | No Meeting | |
| 10.22.02 | Faculty Talk: Miklos Bona (Math) | Topic: t-stack sortable permutations. |
| 10.25.02 (Note: Nontraditional day, time and place; Crosslisted Barr Talk) | Barr Talk: Seth Lloyd | Topic: Computational Capacity of the Universe. |
| 10.29.02 | No Meeting | |
| 11.05.02 | No Meeting | |
| 11.12.02 | Student Talk: Vijay Manian | Decidability of access right leakage problem in access control matrices. Description |
| 11.26.02 | Student Talk: Erwin Jansen | An economic multi agent system. |
Note: Default place - Room E305; Time - 2:00 PM
Request to Speakers: Please (encourage and) allow plenty of time for questions and discussion.