• Fast Fourier Transformation Algorithm, Murali Indukurri
• The Critical Path Method, Vivek Savur
• Finding Maximum and Minimum, Ram Murali
• DNA Computing Algorithms, Tarisa Brown
• Euler's Circuit, Jamie Kirts

• Dijkstra Algorithm for Flights Planning, Raymond Igharas
• Red and Black Trees, Venkataramanan Srinivasan
• Comparing 7 sorting Algorithms, Woongmin Kang
• Shell Sort, Weijun Zhang
• Quantum Computing Algorithm, Kyle Kuo Huang
• Hash Table Collisions, Thi Nguyen

• Choice of Hash Function, Niral Patel
• Dijkstra Algorithm Implementation, Naresh K Korrapati

• Molecular Computation for Combinatorics, Jian Wu
• Evaluating Polynomial Functions, Venu Dukka
• Matrix Multiplication, Jerry Dunn
• Fast Fourier Transformation, Hongmei Teng
• The N-queens problem, Hong Wang
• Comparing Bubble Sort and Insertion Sort, Corey S Allert

• Transportation Management Algos, David Huang
• Fractal Algorithms, Manjunath Reddy
• Analysis and comparison of QS and MS, Senhua Yu

• Comparing Sorting Algos, Sung Hyun Kim
• Heapsort, Jiaowang Dong
• Neural Network Backpropagation Algo for HIV Classification, Yulan Liang
• Implementation of Quicksort, Lihong Xu
• Pathfinding Issues in Game Programming, Clay Keller
• 8-puzzle Solving with Space Search, Ke Mao

Note: The average number of presentation per day is approx 6. Therefore those who are listed after the 6th position on a given day are unlikely to have a chance for a talk. We will consider scheduling an additional meeting on April 26 to give the chance to everybody to have a talk.