Algorithms and Theory Club

Coordinator: Srijit Kamath

 

Faculty Advisor: Meera Sitharam

 

Other Faculty:

Sartaj Sahni

Sanjay Ranka

Richard Newman

Michael Frank

Anand Rangarajan

Tim Davis

 

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.

  
2. Discussion of Ph. D qualifiers exam problems including questions that have previously appeared on the exam. Questions from algorithms and theory will be discussed. There will be 4 meetings and these will be scheduled close to the exam dates for the semester. Here are some strategies for working on qualifiers.

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
01.10.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Sean Hallgren Topic: Exponential Speedups Using Quantum Computation. Abstract
01.13.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Xiaodong Sun Topic: Computing Over Streams of Data. Abstract
01.17.03 Barr Talk: Herbert Edelsbrunner Topic: Bio-Geometric Modeling. Abstract
02.03.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Richard Brooks Topic: Sensor Network Applications. Abstract
02.14.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Lisong Xu Topic: Performance Analysis of an Edge Optical Burst Switching Node. Abstract
02.17.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Ye Xia Topic: Analysis on Packet Resequencing in Communication Networks. Abstract
02.24.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Prasenjit Mitra Topic: Resolving Semantic Heterogeneity and Enabling Interoperation Among Information Sources. Abstract
03.18.03 (Time: 2:30-4:00, room 404) Qualifying Exam Discussion
03.20.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Anand Srinivasan Topic: Efficient and Flexible Fair Scheduling of Real-time Tasks on Multiprocessors. Abstract
03.25.03 (Time: 11:00-12:30, room 440) Qualifying Exam Discussion
03.31.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Alin Dobra Topic: Processing Aggregate Queries over Continuous Data Streams. Abstract
04.01.03 (Time: 11:00-12:30, room 440) Qualifying Exam Discussion
04.17.03 (Note time: 9.35-10.35 am) Faculty Candidate Talk: Guang Song Topic: A Motion Planning Approach to Protein Folding. Abstract

Note: Default place - Room E305; Variable meeting time, Default time - 12:00 noon. 

Request to Speakers: Please (encourage and) allow plenty of time for questions and discussion.

Click here for the Summer 2002 page.

Click here for the Fall 2002 page.