Triseminar


Purpose: The triseminar serves as a small informal algorithms seminar or study group. Participants meet about once a week to talk about and learn neat tools/techinques in computational geometry and theoretical computer science. The goal is for members of the triseminar to share and expand their collective knowledge, by sharing/dicussing interesting ideas they have recently come across.

What is it: Each seminar is typically a survey-kind of talk on some very specific techniques or theorems that have been used widely and/or beautifully, followed by some discussions. The talk and discussions are very informal. As such, no one needs to worry about making a fool of him/herself in the seminar.

History: In January 2002, some grad students studying computational geometry and algorithms started meeting regularly to discuss interesting topics they had been reading and to practice presentation skills. Faculty were not included to keep the meetings more informal and low-key. Although occaisonally visitors to the department are persuaded to give informal presentations, the meetings never have been, and never should be more than an informal discussion born out of a short informal presentation.

Current attendies: Jen Burge | Erik Halvorson | Tingting Jiang | Chris Lapilla | Kuan-ming Lin | Urmi Majumder | Mason Matthews | Yuriy Mileyko | Dmitriy Morozov | Leelavati Narlikar | Amit Patel | Jeff Phillips | Sudheer Sahu | Madhuwanti Vaidya | Bei Wang | Junyi Xie | Hai Yu

Upcoming Talks:
Date Speaker Title Abstract
12.13.06


Meetings Time and Space: Some Wednesdays 11:45am-12:45pm, Room D344, LSRC.

Past Talks:
Date Speaker Title Abstract
1.29.02 Nabil Mustafa On the Dilworth's Theroem and its applications ps
2.18.02 Yusu Wang On the Crossing lemma and its applications ps
2.25.02 Sathish Govindarajan On Space filling curves and its applications in Nearest Neighbor search ps
3.4.02 Sergei Bespamiatnykh Generalized Ham Sandwich Cuts ps.gz
3.18.02 Nabil Mustafa Random "Stuff" I: Random Sampling on Integer Sequences ps
3.25.02 Suresh Venkatasubramanian
(Visiting from AT&T research)		 Contact maps of rectangles in the plane
4.1.02 Yusu Wang Some notes on the searching technique ps
4.22.02 Nabil Mustafa Random "Stuff" II: Indyk's algorithm for 1-median ps
4.29.02 Luc Habert Kinetic datastructures ps
5.4.02 Edger Ramos
(Visiting from MPI)		 Computing diameters in 3D
5.13.02 Sariel Har-Peled
(Visiting from UIUC)		 Core set
5.20.02 Sergei Bespamyatnikh Random Sampling in Set Systems ps
5.27.02 Yusu Wang Low-distortion embeddings of metric spaces into normed spaces I ps
6.3.02 Sathish Govindarajan Results in Colored Range Searching ps
6.10.02 Nabil Mustafa Random "Stuff" III: Kleinberg's Nearest Neighbour Algorithms ps
7.1.02 Yusu Wang Low-distortion embeddings of metric spaces into normed spaces II ps
7.8.02 Nabil Mustafa Arora's TSP algorithm ps
7.15.02 Yusu Wang Space efficient approximate Voronoi diagrams ps
9.10.02 Nabil Mustafa Algorithms for Bipartite Matching ps
10.21.02 Nabil Mustafa Random stuff IV: Randomized rounding ps
11.11.02 Nabil Mustafa Dilworth theorem revisited ps
11.18.02 Vijay Natarajan Borsuk-Ulam Theorem ps
11.25.02 Yusu Wang WSPD in action I ps
4.30.03 Hai Yu Cuttings and Linear Programming Queries ps
5.12.03 Nabil Mustafa Separators for Geometric Objects ps
5.16.03 Ke Yi On the model of indexing schemes ps
6.9.03 Hai Yu Approximate levels in arrangements of lines ps
6.23.03 Tingting Jiang Chain Tree text
6.30.03 Yusu Wang Monotone Matrix Search and Some Applications ps
7.7.03 Peng Yin Introduction to LP-based approximation algorithms pdf
7.14.03 Nabil Mustafa k-line Clustering in Near Linear Time ps
7.21.03 Hai Yu Forbidden subgraphs with applications to combinatorial geometric problems ps
7.28.03 Yusu Wang Lower Bounds for the Orthogonal Range Searching Problem ps
8.4.03 Nabil Mustafa Approximation algorithms for k-center clustering ps
8.13.04 Tingting Jiang A greedy approach for facility location problems ps
8.19.03 Vijay Natarajan Euler Characteristic: Introduction ps
8.22.03 Herman J. Haverkort
(Visiting from Uretch)		 On color orthogonal range searching
8.25.03 Nabil Mustafa Approximation algorithm for k-median/mean clustering ps
9.1.03 Hai Yu Spanning Tree with Low Crossing Number ps
9.8.03 Kasturi R. Varadarajan
(visiting from U. Iowa)		 Graph decomposition and greedy algorithm for edge-disjoint paths txt
9.16.03 Jan Vahrenhold
(visiting from University of Muenster)		 Linear time polygon triangulation algorithm txt
9.29.03 Nabil Mustafa The probabalistic method ps
10.6.03 Yusu Wang Random Sampling: Top-down or Bottom-up? ps
10.20.03 Nabil Mustafa Chapter 3 of Probabilistic Method
11.3.03 Nabil Mustafa Chapter 5 of Probabilistic Method
11.10.03 Hai Yu Graphs of polytops ps
11.24.03 Jeff Phillips FingerPrinting and its geometric implications pdf
5.24.04 Hai Yu Perfect Graphs ps
5.31.04 Sukhendu Chakraborty A Clustering Algorithm for Graph Connectivity pdf
6.07.04 Jeff M Phillips Survey of Absolute Orientation Techniques pdf
6.14.04 Dmitriy Morozov d-dimensional regular triangulations txt
6.21.04 Nabil Mustafa Applications of Double Counting ps
6.28.04 Nabil Mustafa Expander Graphs, construction and application in derandomization and superconcentrators. ps
7.05.04 Nabil Mustafa Linear Programming Rounding Techniques txt
7.12.04 Sudheer Sahu The Program-Size Complexity of Self-Assmebly Squares txt
7.19.04 Hai Yu Selecting Heavily Covered Points ps
7.26.04 Tingting Jiang Ellipse Fitting pdf
8.2.04 Nabil Mustafa Special Seminar: How to do Research txt
8.9.04 Jeff Phillips The Theory of SET pdf
8.23.04 Nabil Mustafa Balls in Bins txt
8.30.04 Jeff Phillips Simple Analysis of Union-Find (part 1) pdf
9.06.04 Jeff Phillips Simple Analysis of Union-Find (part 2) pdf
9.13.04 Jeff Phillips Path Planning Analysis pdf
9.20.04 Dmitriy Morozov Approximate Congruence in Near-Linear Time html
9.27.04 Hai Yu Core Sets ps
10.4.04 Mason Matthews Quantum Computing and Shor's Algorithm txt
10.18.04 Madhu Vaidya On Lattices and Sphere Packing txt
10.25.04 Erik Halvorson The Simplex Method and Branch and Bound txt
11.1.04 Dmitriy Morozov Star Splaying txt
11.8.04 Amit Patel Geometric Permutations ps
11.15.04 Hai Yu k-means clustering txt
11.22.04 Suhkendu Chakraborty Computation using the Graphics Processor txt
11.29.04 Mason Matthews Quantum Computing and Shor's Algorithm (part 2) txt
12.06.04 Jeff Phillips The Polya-Redfield Method pdf
12.13.04 Ke (Kevin) Yi A Size-Estimation Technique txt
1.24.05 Amit Patel Geometric 3SUM Hard Problems pdf
1.31.05 Jeff Phillips Describing Polynomial Curves pdf
2.07.05 Dominique Attali
(Visiting from CNRS Laboratorie LIS)		 Inclusion-Exclusion Formulas from Independent Complexes
2.14.05 Mohammad Ali Abam
(Visiting from TU/e)		 A Lower Bound on Kinetic Sorting
2.21.05 Jen Burge The Stochastic Knapsack Problem pdf
2.28.05 Jeff Phillips Representing motions in SE(3) pdf
3.07.05 Jeff Phillips Dual Number Quaternions pdf
3.21.05 Amit Patel Introduction to Projective Geometry txt
3.28.05 Bei Wang Markov Clustering Algorithm txt
4.04.05 Dmitriy Morozov Megiddo's Parametric Search Technique txt
4.11.05 Dmitriy Morozov Algebraic Decision Trees txt
4.18.05 Hai Yu Approximate Nearest Neighbor Search using kd-Trees - With a Guarantee ps
4.25.05 Ke (Kevin) Yi Tight Lower Bound on the Partial-Sums Problem pdf
5.2.05 Jeff Phillips Dynamic and Exact Collision Detection for Paths pdf
5.16.05 Sudheer Sahu Evolution of Random Graphs txt
5.23.05 Yuriy Mileyko Swept Volume txt
5.30.05 Amit Patel Rotation Distance between Binary Trees pdf
9.12.05 Jeff Phillips Bichromatic Combinatorial Discrepancy pdf
9.19.05 Madhu Vaidya An Upper Bound for Conforming Delaunay Triangulations pdf
9.26.05 Ke (Kevin) Yi I/O-Efficint Construction of Constrained Delaunay Triangulation html
10.03.05 Yuriy Mileyko Lambda-Medial Axis txt
10.17.05 Yuriy Mileyko Properties of Lambda-Medial Axis txt
10.24.05 Jeff Phillips Matching via Power Diagrams pdf
10.31.05 Hai Yu The Permutation Method for Counting Subsets ps
11.7.05 Yuriy Mileyko Constructing epsilon-approximations txt
11.21.05 Tingting Jiang Boolean Operations on Shapes txt
1.30.06 Jeff Phillips Communication Complexity pdf
2.06.06 everyone 5 Minute Potpourri
2.20.06 Sukhendu Chakraborty Introduction to Data Streams pdf
3.6.06 Jen Burge Spreading Information with Gossip txt
3.27.06 Jeff Phillips Linear and Hereditary Discreapncy pdf
4.24.06 Shashidhara Ganjugunte A Separator Theorem for Planar Graphs pdf
9.4.06 Jeff Phillips Finding Frequent Items in Streams (Heavy Hitters) pdf
9.20.06 Hai Yu Dynamic Maintenance of Bichromatic Closest Pair txt
10.4.06 Amit Patel Overlays of Minimization Diagrams pdf
10.25.06 Jeff Phillips The Van der Corput Sequence and Other Low Discrepancy Sequences pdf
11.1.06 Yuriy Mileyko Lipschitz Surfaces txt
11.22.06 Shashidhara Ganjugunte On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Space pdf
jeff phillips