Research:
People:
Prospective Students:
|
Upcoming Events
|
Algorithms and Complexity Seminar
|
|
Wednesday March 6th, 2013, 1:30pm, DC1304
|
|
| Title: |
Grammar-Compressed Indexes and its Applications to Document Listing [Abstract] |
| Speaker: |
Francisco Claude, University of Waterloo |
|
Past Events
|
Algorithms and Complexity Seminar
|
|
Wednesday February 27th, 2013, 1:30pm, DC1316
|
|
| Title: |
I/O-Efficient Shared-Constrained Range Reporting [Abstract] |
| Speaker: |
Sharma Thankachan, Louisiana State University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday February 20th, 2013, 2:30pm, DC1304
|
|
| Title: |
Space Efficient Construction of Wavelet Trees and Matrices [Abstract] |
| Speaker: |
Francisco Claude, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday January 23rd, 2013, 1:30pm, DC1304
|
|
| Title: |
Shortest path problem in CAT(0) rectangular complexes [Abstract] |
| Speaker: |
Daniela Maftuleac, Université d'Aix-Marseille |
|
|
Algorithms and Complexity Seminar
|
|
Friday December 14th, 1:30pm, DC2310 (NOTE UNUSUAL ROOM)
|
|
| Title: |
A Space Efficient Framework for Dynamic Point Location [Abstract] |
| Speaker: |
Patrick Nicholson, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday December 13th, 2012, 1:30pm, DC1304
|
|
| Title: |
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets [Abstract] |
| Speaker: |
Gelin Zhou, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday December 12th, 2012, 1:30pm, DC1304
|
|
| Title: |
Fast, precise and dynamic distance queries [Abstract] |
| Speaker: |
Moshe Lewenstein, Bar Ilan University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday November 28th, 2012, 1:30pm, DC1304
|
|
| Title: |
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill [Abstract] |
| Speaker: |
Steven Chaplick, Wilfrid Laurier University |
|
|
Algorithms and Complexity Seminar
|
|
Friday November 23rd, 2012, 2:00pm, DC 2585
|
|
| Title: |
Computing with Uncertainty [Abstract] |
| Speaker: |
Thomas Erlebach, University of Leicester |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday November 21st, 2012, 1:30pm, DC1304
|
|
| Title: |
Efficient Fetch-and-Increment [Abstract] |
| Speaker: |
Faith Ellen, University of Toronto |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday November 14th, 2012, 1:30pm, DC1304
|
|
| Title: |
Reconfiguration of List L(2,1)-Labelings in a Graph [Abstract] |
| Speaker: |
Kazuto Kawamura, Tohoku University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday November 7th, 2012, 1:30pm, DC1304
|
|
| Title: |
Online Unit Clustering [Abstract] |
| Speaker: |
Kim S. Larsen, University of Southern Denmark |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday October 24th, 2012, 1:30pm, DC1304
|
|
| Title: |
Succinct Data Structures for Path Queries [Abstract] |
| Speaker: |
Gelin Zhou, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday October 10th, 2012, 1:30pm, DC1304
|
|
| Title: |
Odd Cycle Transversal and Vertex Cover above matching [Abstract] |
| Speaker: |
Venkatesh Raman, The Institute of Mathematical Sciences, Chennai, India |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday October 3rd, 2012, 1:30pm, DC1304
|
|
| Title: |
A Small Depth-16 Circuit for the AES S-Box [Abstract] |
| Speaker: |
Joan Boyer, University of Southern Denmark |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday September 26th, 2012, 1:30pm, DC1304
|
|
| Title: |
On the complexity of reconfiguration problems [Abstract] |
| Speaker: |
Takehiro Ito, Tohoku University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday September 5th, 2012, 1:30pm, DC1304
|
|
| Title: |
Succinct Posets [Abstract] |
| Speaker: |
Patrick Nicholson, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday August 29th, 2012, 1:30pm, DC1304
|
|
| Title: |
Minimizing Cache Usage in Paging [Abstract] |
| Speaker: |
Alejandro Salinger, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday August 27th, 2012, 1:30pm, DC1304
|
|
| Title: |
Streaming Cryptography [Abstract] |
| Speaker: |
Periklis Papakonstantinou, Tsinghua University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday August 22nd, 2012, 1:30pm, DC1304
|
|
| Title: |
Dual Sorted Inverted Lists in Practice [Abstract] |
| Speaker: |
Roberto Konow, Universidad de Chile |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday August 15th, 2012, 1:30pm, DC1304
|
|
| Title: |
Path Queries in Weighted Trees [Abstract] |
| Speaker: |
Gelin Zhou, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday August 15th, 2012, 1:30pm, DC1304
|
|
| Title: |
Prefix Free Codes in Linear Time [Abstract] |
| Speaker: |
Jeremy Barbay, Universidad de Chile |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday July 18th, 2012, 1:30pm, DC1304
|
|
| Title: |
The k-Server Problem with Advice [Abstract] |
| Speaker: |
Marc Renault, Université Paris Diderot - Paris 7 |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday June 6th, 2012, 1:30pm, DC1304
|
|
| Title: |
Robust Non-Parametric Data Approximation of Pointsets via Data Reduction [Abstract] |
| Speaker: |
Jason Morrison, University of Manitoba |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday April 25th, 2012, 1:30pm, MC5158 (note unusual room)
|
|
| Title: |
Satisfiability Allows No Nontrivial Sparsification Unless The
Polynomial-Time Hierarchy Collapses [Abstract] |
| Speaker: |
Dieter van Melkebeek, University of Wisconsin |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday April 11th, 2012, 1:30pm, DC1304
|
|
| Title: |
The Incremental Constraint of k-Server [Abstract] |
| Speaker: |
Caelyn McAulay, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday April 4th, 2012, 1:30pm, DC1304
|
|
| Title: |
Incorporating all inputs in the search for closest strings [Abstract] |
| Speaker: |
Narges Simjour, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday October 26th, 2011, 1:30pm, DC1304
|
|
| Title: |
Variations on the Erdos Discrepancy Problem [Abstract] |
| Speaker: |
Alex Leong, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday Aug 31st, 2011, 1:30pm, DC1302
|
|
| Title: |
Planar Open Rectangle-of-Influence Drawings with Non-Aligned Frames [Abstract] |
| Speaker: |
Soroush Alamdari, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday Aug 3rd, 2011, 1:30pm, DC1304
|
|
| Title: |
Orthogonal cartograms / The segment minimization problem [Abstract] |
| Speaker: |
Therese Biedl, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday July 13th, 2011, 1:30pm, DC1304
|
|
| Title: |
Two talks on the Syntatic Complexity of Regular Languages [Abstract] |
| Speaker: |
Janusz Brzozowski and Baiyu Li, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday July 6th, 2011, 1:30pm, DC1304
|
|
| Title: |
How to find all centre strings? [Abstract] |
| Speaker: |
Narges Simjour, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday May 18th, 2011, 1:30pm, DC1304
|
|
| Title: |
Finite Orbits of Language Operations [Abstract] |
| Speaker: |
Emilie Charlier, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday April 13th, 2011, 1:30pm, DC1304
|
|
| Title: |
Boolean-width of Graphs [Abstract] |
| Speaker: |
Martin Vatshelle, Department of Informatics, University of Bergen, Norway |
|
|
Algorithms and Complexity Seminar
|
|
Friday March 18th, 2011, 1:30 PM, DC 2305 (Algorithms Lab)
|
|
| Title: |
Ordered and Unordered Top-K Range Reporting in Large Data Sets [Abstract] |
| Speaker: |
Peyman Afshani, Dalhousie University |
|
|
Talk of Possible Interest
|
|
Monday March 14th, 2011, 11:00 AM, DC 2314
|
|
| Title: |
An Adaptive Approach to Set Expressions Evaluation [Abstract] |
| Speaker: |
Mehdi Mirzazadeh, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday March 9th, 2011, 1:30 PM, DC 1304
|
|
| Title: |
Alphabet Partitioning for Compressed Rank/Select and Applications [Abstract] |
| Speaker: |
Travis Gagie, Aalto University, Finland |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday March 2nd, 2011, 1:30 PM, DC 1304
|
|
| Title: |
The Streaming Complexity of Validating XML Documents [Abstract] |
| Speaker: |
Christian Konrad, LRI, Orsay, France |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday February 9th, 2011, 1:30 PM, DC 1304
|
|
| Title: |
Decomposing the Competitive Ratio [Abstract] |
| Speaker: |
Alexa Sharp, Oberlin College, USA |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday February 8th, 2011, 10:30 AM, DC 1304
|
|
| Title: |
Edge Intersection Graphs of Single Bend Paths in a Grid [Abstract] |
| Speaker: |
Martin Charles Golumbic, University of Haifa |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday February 2nd, 2011, 1:30 PM, DC 1304
|
|
| Title: |
Testing Simultaneous Planarity when the Common Graph is 2-connected. [Abstract] |
| Speaker: |
Krishnam Raju Jampani, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday January 12th, 2011, 1:30 PM, DC 1304
|
|
| Title: |
A Wavelet tree based representation of minimum bounding rectangles [Abstract] |
| Speaker: |
Diego Seco, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 1, 2010, 1:30 PM, DC 2305
|
|
| Title: |
Simultaneous Interval Graphs [Abstract] |
| Speaker: |
Krishnam Raju Jampani, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 24, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Efficient scheduling of equal size tasks in multiple machines [Abstract] |
| Speaker: |
Alex López-Ortiz, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 17, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Expressing a Polynomial as a Determinant [Abstract] |
| Speaker: |
Natacha Portier, Laboratoire de l'Informatique du Parallélisme, ENS Lyon, France; DCS, UofT |
|
|
Algorithms and Complexity Seminar
|
|
Friday, November 12, 2010, 11:00 AM, DC 2305
|
|
| Title: |
Linear-Space Data Structures for Range Mode Query in Arrays [Abstract] |
| Speaker: |
Stephane Durocher, University of Manitoba |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 10, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Minimum Enclosing Area Triangle with a Fixed Angle [Abstract] |
| Speaker: |
Jean-Lou De Carufel, Carleton University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 8, 2010, 2:00 PM, DC 1304
|
|
| Title: |
Range Queries Over Untangled Chains [Abstract] |
| Speaker: |
Patrick Nicholson, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 8, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Succinct Representations of Dynamic Strings [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 8, 2010, 11:00 AM, DC 2314
|
|
| Title: |
Geometric On-line Ray Searching Under Probability of Placement Scenarios [Abstract] |
| Speaker: |
Ying (Catherine) Liu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 28, 2010, 1:30 PM, DC 1304
|
|
| Title: |
A Grouped Hamming Network [Abstract] |
| Speaker: |
Bryan Logan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 14, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Neighborship Voronoi Games [Abstract] |
| Speaker: |
Masud Hasan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 23, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Algorithms for computing NE/SNE repeats in a string and NE multirepeats in multiple sequences [Abstract] |
| Speaker: |
Munina Yusufu, Algorithms Research Group, Department of Computing and Software, McMaster University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 2, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Recognizing well-parenthesized expressions in the streaming model [Abstract] |
| Speaker: |
Frédéric Magniez, LRI, Univ. Paris-Sud, CNRS |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 26, 2010, 1:30 PM, DC 1304
|
|
| Title: |
Dynamic Planar Orthogonal 3-sided Range Reporting in Expected Doubly Logarithmic Time [Abstract] |
| Speaker: |
Konstantinos Tsakalidis, Department of Computer Science, University of Aarhus |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 5, 2010, 1:30 PM, DC 2314
|
|
| Title: |
Simultaneously Embedding Planar Graphs at Fixed Vertex Locations [Abstract] |
| Speaker: |
Taylor Gordon, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 28, 2010, 2:30 PM, DC 2314
|
|
| Title: |
Problems Related to Shortest Strings in Formal Languages [Abstract] |
| Speaker: |
Thomas Ang, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 7, 2010, 1:30 PM, DC 1304
|
|
| Title: |
RootChord [Abstract] |
| Speaker: |
Lukasz Cwik, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 9, 2009, 1:30 PM, DC 1304
|
|
| Title: |
I/O and Space-Efficient Path Traversal in Planar Graphs [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 25, 2009, 1:30 PM, DC 1304
|
|
| Title: |
On a Problem Posed by Steve Smale [Abstract] |
| Speaker: |
Felipe Cucker, Department of Mathematics, City University of Hong Kong |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 18, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm [Abstract] |
| Speaker: |
Robert Fraser, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 4, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Vertex Intersection Graphs of Paths on a Grid [Abstract] |
| Speaker: |
Elad Cohen, University of Haifa, Israel |
|
|
Algorithms and Complexity Seminar
|
|
Friday, October 16, 2009, 2:30 PM, DC 1304
|
|
| Title: |
Left-leaning Red-Black Trees [Abstract] |
| Speaker: |
Robert Sedgewick, Department of Computer Science, Princeton University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 14, 2009, 1:30 PM, DC 2314
|
|
| Title: |
Finding Empty Cubes in Any Dimension [Abstract] |
| Speaker: |
Mark Keil, Department of Computer Science, University of Saskatchewan |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 7, 2009, 3:30 PM, DC 1304
|
|
| Title: |
The Quasi-G-Packing Problem [Abstract] |
| Speaker: |
Jazmin Romero, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 30, 2009, 3:30 PM, MC 5136
|
|
| Title: |
Improved Parameterized Algorithms for the Kemeny Aggregation Problem [Abstract] |
| Speaker: |
Narges Simjour, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, September 29, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Algorithms for Sequence Finding and Selection Problems [Abstract] |
| Speaker: |
D. T. Lee, Institute of Information Science & Research Center for IT Innovation, Academia Sinica, Taiwan |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 16, 2009, 4:00 PM, DC 1304
|
|
| Title: |
Small drawings of series-parallel graphs and other planar graphs [Abstract] |
| Speaker: |
Therese Biedl, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 16, 2009, 3:30 PM, DC 1304
|
|
| Title: |
Drawing planar 3-trees with fixed face areas [Abstract] |
| Speaker: |
Elena Lesvia Velasquez Ruiz, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 2, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Five topics from CCCG 2009 [Abstract] |
| Speaker: |
Robert Fraser, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 12, 2009, 1:30 PM, DC 1304
|
|
| Title: |
The Simultaneous Representation Problem for Chordal, Compatability and Permutation Graphs [Abstract] |
| Speaker: |
Krishnam Raju Jampani, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 5, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 5, 2009, 2:00 PM, DC 1304
|
|
| Title: |
Self-Indexed Text Compression using Straight-Line Programs [Abstract] |
| Speaker: |
Francisco Claude, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 29, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance [Abstract] |
| Speaker: |
Robert Fraser, School of Computer Science, University of Waterloo |
|
|
Master's Thesis Presentation
|
|
Wednesday, July 22, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Distributed Policing with Full Utilization and Rate Guarantees [Abstract] |
| Speaker: |
Albert Choi, School of Computer Science, University of Waterloo |
|
|
Master's Thesis Presentation
|
|
Wednesday, July 8, 2009, 2:30 PM, DC 2314
|
|
| Title: |
Reconstructing hv-convex polyominoes with multiple colours [Abstract] |
| Speaker: |
Adam Bains, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 24, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Three New Algorithms for Regular Language Enumeration [Abstract] |
| Speaker: |
Margareta Ackerman, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 17, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Optimal trees with clusters of stars constraints: characterizations and algorithms [Abstract] |
| Speaker: |
Michal Stern, Academic College of Tel-Aviv -- Yaffo & CRI University of Haifa, Israel |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, May 21, 2009, 2:30 PM, DC 1302
|
|
| Title: |
Hyperbolic dovetailing [Abstract] |
| Speaker: |
David Kirkpatrick, Department of Computer Science, University of British Columbia |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 6, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Random Hyperplane Search Trees [Abstract] |
| Speaker: |
James King, School of Computer Science, McGill University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 15, 2009, 1:30 PM, DC 1304
|
|
| Title: |
The application of the in-tree knapsack problem to routing prefix caches [Abstract] |
| Speaker: |
Patrick Nicholson, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 1, 2009, 1:30 PM, DC 1304
|
|
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 25, 2009, 1:30 PM, DC1304
|
|
| Title: |
Optimal Scheduling of Contract Algorithms with Soft Deadlines [Abstract] |
| Speaker: |
Angele Hamel, Department of Physics and Computer Science, Wilfrid Laurier University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 18, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Agnostic Online Learning [Abstract] |
| Speaker: |
David Pal, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 11, 2009, 1:30 PM, DC 1302
|
|
| Title: |
Towards Universal Succinct Representations of Trees [Abstract] |
| Speaker: |
Arash Farzan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 25, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Decision Problems For Convex Languages [Abstract] |
| Speaker: |
Zhi Xu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 11, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Adaptive (Analysis of) Algorithms for Convex Hulls and Related Problems [Abstract] |
| Speaker: |
Jeremy Barbay, Departamento de Ciencias de la Computacion, Universidad de Chile |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, January 14, 2009, 1:30 PM, DC 1304
|
|
| Title: |
Market Equilibrium and Convex Programs (with two agents) [Abstract] |
| Speaker: |
Deeparnab Chakrabarty, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Friday, January 9, 2009, 11:00 AM, DC 1331
|
|
| Title: |
Spanning trees with O(1) average stretch factor [Abstract] |
| Speaker: |
Michiel Smid, School of Computer Science, Carleton University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 17, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Showing Relevant Ads via Context Multi-Armed Bandits [Abstract] |
| Speaker: |
David Pal, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 10, 2008, 10:30 AM, DC1302
|
|
| Title: |
Shortest Paths Avoiding Forbidden Subpaths [Abstract] |
| Speaker: |
Mustaq Ahmed, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 3, 2008, 1:30 PM, DC1304
|
|
| Title: |
Bounding the Locality of Distributed Routing Algorithms [Abstract] |
| Speaker: |
Stephane Durocher, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, November 27, 2008, 1:30 PM, DC 1331
|
|
| Title: |
Bit-Optimal Lempel-Ziv Compression [Abstract] |
| Speaker: |
Igor Nitto, University of Pisa |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 26, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Multi-pass geometric algorithms [Abstract] |
| Speaker: |
Eric Y. Chen, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 19, 2008, 1:30 PM, DC1304
|
|
| Title: |
Practical Approximation Improvements for Segment Minimization in Intensity-Modulated Radiation Therapy [Abstract] |
| Speaker: |
Maxwell Young, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 5, 2008, 1:30 PM, DC1304
|
|
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 29, 2008, 1:30 PM, DC1304
|
|
| Title: |
Shortest Anisotropic Paths with Few Bends is NP-complete [Abstract] |
| Speaker: |
Mustaq Ahmed, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 22, 2008, 1:30 PM, DC1304
|
|
| Title: |
Average case to worst case reductions for polynomials [Abstract] |
| Speaker: |
Shachar Lovett, Weizmann Institute |
|
|
Algorithms and Complexity Seminar
|
|
Friday, October 17, 2008, 1:30 PM, MC5158
|
|
| Title: |
How easily can we find our way without a map? [Abstract] |
| Speaker: |
Prosenjit Bose, School of Computer Science, Carleton University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 8, 2008, 1:30 PM, DC1304
|
|
| Title: |
Cliques in Edge Intersection Graphs of Subtrees of a Tree [Abstract] |
| Speaker: |
Elad Cohen, Department of Computer Science, University of Haifa |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 1, 2008, 1:30 PM, DC1304
|
|
| Title: |
Succinct Representations of Arbitrary Graphs [Abstract] |
| Speaker: |
Arash Farzan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 24, 2008, 1:30 PM, DC1304
|
|
| Title: |
Approximating Geometric Steiner Forest [Abstract] |
| Speaker: |
Glencora Borradaile, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, September 22, 2008, 1:30 PM, DC1331
|
|
| Title: |
Optimal Halfspace Range Reporting in Three Dimensions [Abstract] |
| Speaker: |
Peyman Afshani, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 17, 2008, 1:30 PM, DC 1304
|
|
| Title: |
The Bad Santa Problem and Energy-Efficient Reliable Broadcast for Radio Networks [Abstract] |
| Speaker: |
Maxwell Young, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 10, 2008, 1:30 PM, DC1304
|
|
| Title: |
On Dominance Reporting in 3D [Abstract] |
| Speaker: |
Peyman Afshani, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 3, 2008, 1:30 PM, DC 1304
|
|
| Title: |
On set cover in geometric settings [Abstract] |
| Speaker: |
Sariel Har-Peled, Department of Computer Science, University of Illinois at Urbana-Champaign |
|
|
Master's Thesis Presentation
|
|
Thursday, August 21, 2008, 2:00 PM, DC 2314
|
|
| Title: |
Algorithms for Optimizing Search Schedules in a Polygon [Abstract] |
| Speaker: |
Stephen Bahun, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 20, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Generating Variant Sudoku Puzzles [Abstract] |
| Speaker: |
Matthew Skala, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 6, 2008, 2:00 PM, DC 1304
|
|
| Title: |
Adaptive Searching in One and Two Dimensions [Abstract] |
| Speaker: |
Reza Dorrigiv, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 6, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Maintaining Coresets in Data Streams [Abstract] |
| Speaker: |
Hamid Zarrabi-Zadeh, School of Computer Science, University of Waterloo |
|
|
Master's Thesis Presentation
|
|
Tuesday, August 5, 2008, 3:00 PM, DC 1304
|
|
| Title: |
Lower Bounds and Derandomization [Abstract] |
| Speaker: |
Jaffer Gardezi, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, August 5, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Pattern Matching with Springs: an Adaptive Analysis [Abstract] |
| Speaker: |
Jeremy Barbay, Departamento de Ciencias de la Computacion, Universidad de Chile |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 30, 2008, 1:30 PM, DC 1304
|
|
| Title: |
The Monoid Frobenius Problem and the De Bruijn Graph [Abstract] |
| Speaker: |
Zhi Xu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 23, 2008, 2:00 PM, DC 1304
|
|
| Title: |
Coresets and Geometric Approximation [Abstract] |
| Speaker: |
Hamid Zarrabi-Zadeh, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 16, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Morphing Planar Graph Drawings with Bent Edges [Abstract] |
| Speaker: |
Mark Petrick, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 16, 2008, 10:00 AM, DC 1304
|
|
| Title: |
Error Detection in Number-Theoretic and Algebraic Algorithms [Abstract] |
| Speaker: |
Troy Vasiga, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 9, 2008, 1:30 PM, DC 1304
|
|
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 25, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Design and Analysis of Algorithms for Multicore Architectures [Abstract] |
| Speaker: |
Alejandro Salinger, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 11, 2008, 1:30 PM, DC 1302
|
|
| Title: |
Geometric k-Centres of Unit Disc Graphs [Abstract] |
| Speaker: |
Stephane Durocher, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 4, 2008, 1:30 PM, DC 1304
|
|
| Title: |
A Subproblem of the Monoid Frobenius Problem [Abstract] |
| Speaker: |
Zhi Xu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, May 29, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Repetitions in Strings [Abstract] |
| Speaker: |
Lucian Ilie, Department of Computer Science, University of Western Ontario |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 28, 2008, 10:00 AM, DC 1304
|
|
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 7, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Continuous Languages [Abstract] |
| Speaker: |
John Brzozowski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 16, 2008, 1:30 PM, DC 1304
|
|
| Title: |
General Auction Mechanism for Search Advertising (part II) [Abstract] |
| Speaker: |
David Pal, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 9, 2008, 1:30 PM, DC 1304
|
|
| Title: |
I/O-Efficient Algorithms for Computing Contour Lines on a Terrain [Abstract] |
| Speaker: |
Bardia Sadri, Department of Computer Science, Duke University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 2, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Noisy Sorting Without Resampling [Abstract] |
| Speaker: |
Mark Braverman, Department of Computer Science, University of Toronto |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 26, 2008, 1:30 PM, DC 1304
|
|
| Title: |
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length [Abstract] |
| Speaker: |
John Brzozowski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 19, 2008, 1:30 PM, DC1304
|
|
| Title: |
Fast Distributed Computation of Cuts via Random Circulations [Abstract] |
| Speaker: |
David Pritchard, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 12, 2008, 1:30 PM, DC 1304
|
|
| Title: |
General Auction Mechanism for Search Advertising [Abstract] |
| Speaker: |
David Pal, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 20, 2008, 1:30 PM, DC1304
|
|
| Title: |
A guide to polynomial-time approximation schemes for connectivity problems in planar graphs [Abstract] |
| Speaker: |
Glencora Borradaile, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 6, 2008, 1:30 PM, DC 1304
|
|
| Title: |
On the Complexity of Reverse Similarity Search [Abstract] |
| Speaker: |
Matthew Skala, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, January 30, 2008, 3:30 PM, DC 1304
|
|
| Title: |
Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, and Range Reporting [Abstract] |
| Speaker: |
Guy Blelloch, Department of Computer Science, Carnegie Mellon University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, January 16, 2008, 1:30 PM, DC 1304
|
|
| Title: |
In-place 2-d nearest neighbor search [Abstract] |
| Speaker: |
Eric Y. Chen, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, January 10, 2008, 1:30 PM, DC 1304
|
|
| Title: |
Meshing in Fixed Dimension in Near Optimal Work and Time [Abstract] |
| Speaker: |
Gary L Miller, Computer Science Department, Carnegie Mellon University |
|
|
Algorithms and Complexity Seminar
|
|
Friday, January 4, 2008, 3:00 PM, DC 1304
|
|
| Title: |
A model of imprecise points that allows linear time Delaunay triangulation [Abstract] |
| Speaker: |
Jack Snoeyink, Department of Computer Science, University of North Carolina at Chapel Hill |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 12, 2007, 1:30 PM, DC 1304
|
|
| Title: |
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks [Abstract] |
| Speaker: |
Stephane Durocher, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 5, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Geometric Streaming Algorithms with a Sorting Primitive [Abstract] |
| Speaker: |
Eric Y. Chen, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Friday, November 30, 2007, 1:30 PM, DC 1304
|
|
| Title: |
The Frobenius Problem in a Free Monoid [Abstract] |
| Speaker: |
Zhi Xu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 28, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Morphing Orthogonal Planar Graph Drawings [Abstract] |
| Speaker: |
Mark Petrick, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 21, 2007, 1:30 PM, DC 1304
|
|
| Title: |
On the relative dominance of paging algorithms [Abstract] |
| Speaker: |
Reza Dorrigiv, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 14, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Approximation Algorithms for Minimizing Segments in Radiation Therapy [Abstract] |
| Speaker: |
Maxwell Young, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 31, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Properties of Shortest Descending Paths [Abstract] |
| Speaker: |
Mustaq Ahmed, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 17, 2007, 4:00 PM, DC 1304
|
|
| Title: |
Vertex pursuit games on models of complex networks [Abstract] |
| Speaker: |
Anthony Bonato, Department of Mathematics, Wilfrid Laurier University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 10, 2007, 1:30 PM, DC 2305
|
|
| Title: |
Succint data structures, Adaptive (analysis of) algorithms : overview, combination and perspective [Abstract] |
| Speaker: |
Jeremy Barbay, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Friday, October 5, 2007, 1:30 PM, DC 1304
|
|
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 3, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Kinetic Maintenance of Mobile k-Centres on Trees [Abstract] |
| Speaker: |
Stephane Durocher, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 12, 2007, 1:30 PM, DC 1304
|
|
| Title: |
On stabilizers of infinite words [Abstract] |
| Speaker: |
Dalia Krieger, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 22, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model [Abstract] |
| Speaker: |
Riko Jacob, Computer Science Department, Technische Universitat Munchen |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 15, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Randomized Algorithms for Interval Scheduling [Abstract] |
| Speaker: |
C.K. Poon, Department of Computer Science, City University of Hong Kong |
|
|
Algorithms and Complexity Seminar
|
|
Monday, August 13, 2007, 1:30 PM, DC 1331
|
|
| Title: |
A Lower Bound on the Area of a 3-Coloured Disc Packing [Abstract] |
| Speaker: |
Benjamin Lafreniere, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, August 13, 2007, 1:30 PM, DC 1331
|
|
| Title: |
Optimal schedules for 2-guard room search [Abstract] |
| Speaker: |
Stephen Bahun, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, August 9, 2007, 1:30 PM, DC 1331
|
|
| Title: |
Data Structuring Problems in the Bit Probe Model [Abstract] |
| Speaker: |
Mohammad Ziaur Rahman, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 8, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Succinct Representation of Labeled Graphs [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, August 2, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Approximation Algorithms for Shortest Descending Paths [Abstract] |
| Speaker: |
Mustaq Ahmed, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 25, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Reconstructing Orthogonal Polyhedra from Putative Vertex Sets [Abstract] |
| Speaker: |
Burkay Genc, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 18, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Searching Lempel-Ziv Compressed Texts [Abstract] |
| Speaker: |
Diego Arroyuelo, Department of Computer Science, University of Chile |
|
|
Algorithms and Complexity Seminar
|
|
Friday, July 13, 2007, 11:30 AM, DC 1304
|
|
| Title: |
Compressing Web Graphs as Texts [Abstract] |
| Speaker: |
Gonzalo Navarro, Department of Computer Science, University of Chile |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, July 12, 2007, 11:00 AM, DC 1304
|
|
| Title: |
(Near) linear time algorithms for computing edit distances approximately [Abstract] |
| Speaker: |
Cenk Sahinalp, CRC Chair in Bioinformatics, Department of Computer Science, Simon Fraser University |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, July 12, 2007, 1:30 PM, DC 1304
|
|
| Title: |
The problem with promiscuous matching [Abstract] |
| Speaker: |
Raphael Clifford, Department of Computer Science, University of Bristol |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 11, 2007, 1:30 PM, DC 1304
|
|
| Title: |
A Randomized Algorithm for Online Unit Clustering [Abstract] |
| Speaker: |
Hamid Zarrabi-Zadeh, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 4, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Efficient Enumeration of Regular Languages [Abstract] |
| Speaker: |
Margareta Ackerman, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 27, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Edge Intersection Graphs of Paths in a Tree and Generalizations [Abstract] |
| Speaker: |
Michal Stern, Caesarea Rothschild Institute, University of Haifa |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, June 19, 2007, 11:00 AM, MC5136
|
|
| Title: |
Convergence and Approximation in Games [Abstract] |
| Speaker: |
Vahab S. Mirrokni, Theory Group, Microsoft Research |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 13, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Avoiding approximate squares [Abstract] |
| Speaker: |
Narad Rampersad, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, May 28, 2007, 1:30 PM, DC 1304
|
|
| Title: |
Testing Graph and Hypergraph Properties Using Edge Queries [Abstract] |
| Speaker: |
Ehsan Chiniforooshan, School of Computer Science, University of Waterloo |
|
|
Joint Bioinformatics/Algorithms and Complexity Seminar
|
|
Friday, May 25, 2007, 11:00 AM, DC1304
|
|
| Title: |
New approaches to protein structure prediction [Abstract] |
| Speaker: |
Yang Zhang, Center for Bioinformatics and Department of Molecular Biosciences, University of Kansas |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 23, 2007, 1:30 PM, DC1304
|
|
| Title: |
Adaptive Algorithms for Weighted Queries, on Weighted Binary Relations and Labeled Trees [Abstract] |
| Speaker: |
Aleh Veraskouski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 16, 2007, 1:30 PM, DC1304
|
|
| Title: |
Two applications of Benford Distribution - in Formal Languages and Combinatorial Game Theory [Abstract] |
| Speaker: |
Bala Ravikumar, Computer Science Department, Sonoma State University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 9, 2007, 1:30 PM, DC1304
|
|
| Title: |
On the Complexity of Finding an Unknown Cut via Vertex Queries [Abstract] |
| Speaker: |
Ehsan Chiniforooshan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, May 7, 2007, 3:30 PM, DC1304
|
|
| Title: |
Geometric Facility Location under Continuous Motion [Abstract] |
| Speaker: |
Stephane Durocher, School of Computer Science, McGill University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 2, 2007, 1:30 PM, DC1304
|
|
| Title: |
Linear Lower Bounds on Real-World Implementations of Concurrent Objects [Abstract] |
| Speaker: |
Faith Ellen, Department of Computer Science, University of Toronto |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, April 26, 2007, 1:30 PM, DC3313
|
|
| Title: |
Truthful Auctions for Arbitrary Sized Ads [Abstract] |
| Speaker: |
Tyler Lu, School of Computer Science, University of Waterloo |
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 18, 2007, 1:30 PM, DC1304
|
|
| Title: |
How to Avoid Nondeterminism with a Little Foresight (Part II) [Abstract] |
| Speaker: |
John Brzozowski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, April 17, 2007, 2:00 PM, DC3313
|
|
| Title: |
Cache-Oblivious Undirected Shortest Paths [Abstract] |
| Speaker: |
Norbert Zeh, Faculty of Computer Science, Dalhousie University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 11, 2007, 1:30 PM, DC1304
|
|
| Title: |
How to Avoid Nondeterminism with a Little Foresight (Part I) [Abstract] |
| Speaker: |
John Brzozowski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 28, 2007, 1:30 PM, DC1304
|
|
| Title: |
Succinct Ordinal Trees Based on Tree Covering [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 7, 2007, 1:30 PM, DC1304
|
|
| Title: |
Closing the gap between theory and practice: A refined framework for on-line algorithm analysis [Abstract] |
| Speaker: |
Alex Lopez-Ortiz, School of Computer Science, University of Waterloo |
|
|
|
| Title: |
A Treecode Algorithm for Regularized Particle Simulations [Abstract] |
| Speaker: |
Robert Krasny, Department of Mathematics, University of Michigan |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, January 24, 2007, 1:30 PM, DC1304
|
|
| Title: |
Compact representations of Geometric Data Structures [Abstract] |
| Speaker: |
Luca Castelli, Laboratoire d'Informatique (LIX), École Polytechnique |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, January 10, 2007, 2:00 PM, DC1304
|
|
| Title: |
Improved Algorithms for Path, Matching, and Packing Problems [Abstract] |
| Speaker: |
Jianer Chen, Department of Computer Science, Texas A&M University |
|
|
Algorithms and Complexity Seminar
|
|
Friday, December 15, 2006, 1:30 PM, DC1304
|
|
| Title: |
Fixed-Parameter Approximation: a New Tool to Deal with Hard Problems [Abstract] |
| Speaker: |
Tarique Islam, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 29, 2006, 1:30 PM, DC1304
|
|
| Title: |
Succinct Indexes for Strings, Binary Relations and Multi-labeled Trees [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 22, 2006, 1:30 PM, DC1304
|
|
| Title: |
The Effectiveness of Lloyd-type Methods for the k-Means Problem [Abstract] |
| Speaker: |
Chaitanya Swamy, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Friday, November 17, 2006, 1:30 PM, DC1304
|
|
| Title: |
The Fixed-Parameter Complexity of Longest Common Subsequence and PDA Intersection Problems [Abstract] |
| Speaker: |
Tarique Islam, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 8, 2006, 1:30 PM, DC1304
|
|
| Title: |
Words avoiding repetitions in arithmetic progressions [Abstract] |
| Speaker: |
Narad Rampersad, School of Computer Science, University of Waterloo |
|
|
|
| Title: |
Homomorphisms to the Clebsch graph [Abstract] |
| Speaker: |
Reza Naserasr, Department of Combinatorics and Optimization, University of Waterloo |
|
|
|
| Title: |
The cop number of random graphs [Abstract] |
| Speaker: |
Changping Wang, Department of Mathematics, Wilfrid Laurier University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 18, 2006, 1:30 PM, DC1304
|
|
| Title: |
On Deterministic NFA Simulation with k-Symbols Lookahead [Abstract] |
| Speaker: |
Nicolae Santean, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 11, 2006, 1:30 PM, DC1304
|
|
| Title: |
On the Separation and Equivalence of Paging Strategies [Abstract] |
| Speaker: |
Reza Dorrigiv, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, October 3, 2006, 1:30 PM, DC1304
|
|
| Title: |
Towards Secure and Scalable Computing in Peer-to-Peer Networks [Abstract] |
| Speaker: |
Valerie King, Department of Computer Science, University of Victoria |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 27, 2006, 3:30 PM, DC1304
|
|
| Title: |
Modelling the infinite web [Abstract] |
| Speaker: |
Anthony Bonato, Department of Mathematics, Wilfrid Laurier University |
|
|
|
| Title: |
Pseudo-random graphs from combinatorial designs [Abstract] |
| Speaker: |
Anthony Bonato, Department of Mathematics, Wilfrid Laurier University |
|
|
Algorithms and Complexity Discussion Group Session
|
|
Wednesday, September 13, 2006, 3:00 PM, DC2305
|
|
| Title: |
Link between search and compression |
| Moderator: |
Alejandro Salinger |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, September 7, 2006, 1:30 PM, DC1304
|
|
| Title: |
Dynamic Connectivity for Axis-Parelle Rectangles [Abstract] |
| Speaker: |
Peyman Afshani, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 2, 2006, 1:30 PM, DC1304
|
|
| Title: |
Computing distances and error detecting capabilities of regular languages [Abstract] |
| Speaker: |
Stavros Konstantinidis, Mathematics and Computing Science, Saint Mary's University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 26, 2006, 1:30 PM, DC1304
|
|
| Title: |
Contract Algorithms and Optimal Processor Scheduling [Abstract] |
| Speaker: |
Angele Hamel, Department of Physics & Computer Science, Wilfrid Laurier University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 19, 2006, 1:30 PM, DC1304
|
|
| Title: |
An O(n log n) algorithm for maximum st-flow in a directed planar
graph [Abstract] |
| Speaker: |
Glencora L. Borradaile, Department of Computer Science, Brown University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 12, 2006, 1:30 PM, DC1304
|
|
| Title: |
A New View of the Hardness of Parameterized Problems [Abstract] |
| Speaker: |
Tarique Islam, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 5, 2006, 1:30 PM, DC1304
|
|
| Title: |
Morphing Graphs with Fixed Angles [Abstract] |
| Speaker: |
Michael J. Spriggs, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 28, 2006, 1:30 PM, DC1304
|
|
| Title: |
New Techniques for Zero Knowledge [Abstract] |
| Speaker: |
Amit Sahai, Computer Science Department, UCLA |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 21, 2006, 1:30 PM, DC1304
|
|
| Title: |
Colouring P5-free graphs [Abstract] |
| Speaker: |
Chinh Hoang, Department of Physics & Computer Science, Wilfrid Laurier University |
|
|
Algorithms and Complexity Seminar
|
|
Monday, June 19, 2006, 10:00 AM, DC1331
|
|
| Title: |
On Critical Exponents in Fixed Points of Non-Erasing Morphisms [Abstract] |
| Speaker: |
Dalia Krieger, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 14, 2006, 1:30 PM, DC1304
|
|
| Title: |
Abelian Patterns and Powers in Words [Abstract] |
| Speaker: |
James Currie, Department of Mathematics, University of Winnipeg |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 7, 2006, 1:30 PM, DC1304
|
|
| Title: |
Optimal lower bounds for rank and select indexes [Abstract] |
| Speaker: |
Alexander Golynski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 31, 2006, 1:30 PM, DC1304
|
|
| Title: |
The Node-Weighted Steiner Tree problem in Graphs of Restricted Node Weights [Abstract] |
| Speaker: |
Spyros Angelopoulos, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 24, 2006, 1:30 PM, DC1304
|
|
| Title: |
Optimal Sampling for Sorting and Selection [Abstract] |
| Speaker: |
Conrado Martinez, Departament de Llenguatges i Sistemes Inform�ics, Universitat Politecnica de Catalunya |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 17, 2006, 1:30 PM, DC3313
|
|
| Title: |
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences [Abstract] |
| Speaker: |
Alejandro Salinger, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 10, 2006, 1:30 PM, DC2305
|
|
| Title: |
Distance Permutations in Euclidean Spaces [Abstract] |
| Speaker: |
Matthew Skala, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, May 3, 2006, 3:30 PM, DC1304
|
|
| Title: |
Faster Adaptive Set Intersections for Text Searching [Abstract] |
| Speaker: |
Tyler Lu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 19, 2006, 3:30 PM, DC1304
|
|
| Title: |
An Optimal Distributed Edge-Biconnectivity Algorithm [Abstract] |
| Speaker: |
David Pritchard, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, April 5, 2006, 3:30 PM, DC3323
|
|
| Title: |
LOTs (Leaf Only Trees): Fast, Efficient and Robust In-Network Computation [Abstract] |
| Speaker: |
Andre Allavena, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 22, 2006, 3:30 PM, DC1304
|
|
| Title: |
Worst Case Optimal Union-Intersection Expression Evaluation [Abstract] |
| Speaker: |
Arash Farzan, School of Computer Science, University of Waterloo |
|
|
Algorithmic Problem Session
|
|
Monday, March 20, 2006, 2:30 PM, DC 2305
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 15, 2006, 3:30 PM, DC1304
|
|
| Title: |
Graph Partitioning using Single Commodity Flows [Abstract] |
| Speaker: |
Rohit Khandekar, Department of Combinatorics and Optimization, University of Waterloo |
|
|
|
| Title: |
An edge ordering problem for regular hypergraphs [Abstract] |
| Speaker: |
Hongbin Fan, Department of Physics and Computing, Wilfrid Laurier University |
|
|
Algorithmic Problem Session
|
|
Monday, March 6, 2006, 2:30 PM, DC 2305
|
|
|
Algorithms and Complexity Seminar
|
|
Friday, March 3, 2006, 11:00 AM, DC1304
|
|
| Title: |
On-line algorithms for graphs and posets [Abstract] |
| Speaker: |
Pawel Idziak, Computer Science Department, Jagiellonian University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 1, 2006, 3:30 PM, DC1304
|
|
| Title: |
Fast Algorithms For Hard Graph Problems: Bidimenationality, Minors, And (Local) Treewidth [Abstract] |
| Speaker: |
MohammadTaghi Hajiaghayi, School of Computer Science, Carnegie Mellon University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 22, 2006, 3:30 PM, DC1304
|
|
| Title: |
Growing Protean Graphs (new probabilistic model of the web network) [Abstract] |
| Speaker: |
Pawel Pralat, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 15, 2006, 3:30 PM, DC1304
|
|
| Title: |
Colored Predecessor and Related problems in the Bit Probe Model [Abstract] |
| Speaker: |
Ziaur Rahman, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 8, 2006, 3:30 PM, DC1304
|
|
| Title: |
Adaptive Searching in Succinctly Encoded Structures [Abstract] |
| Speaker: |
Jeremy Barbay, School of Computer Science, University of Waterloo |
|
|
|
| Title: |
Growing Protean Graphs [Abstract] |
| Speaker: |
Pawel Pralat, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 1, 2006, 3:30 PM, DC1304
|
|
| Title: |
Rank/Select Operations on Large Alphabets: a Tool for Text Indexing [Abstract] |
| Speaker: |
Alexander Golynski, School of Computer Science, University of Waterloo |
|
|
|
| Title: |
Stochastic models for the web graph [Abstract] |
| Speaker: |
Changping Wang, Department of Mathematics and Statistics, Dalhousie
University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 30, 2005, 3:30 PM, DC1304
|
|
| Title: |
Variations on the Theme of Caching [Abstract] |
| Speaker: |
Cristian Gaspar, School of Computer Science, University of Waterloo |
|
|
|
| Title: |
Subgraphs of colour-critical graphs [Abstract] |
| Speaker: |
Bing Zhou, Department of Mathematics, Trent University |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 16, 2005, 3:30 PM, DC1304
|
|
| Title: |
Can the P vs NP question be independent of the axioms of mathematical reasoning? [Abstract] |
| Speaker: |
Shai Ben-David, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 9, 2005, 3:30 PM, DC1304
|
|
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 2, 2005, 3:30 PM, DC1304
|
|
| Title: |
Lossy compression: distortion rate theory for individual data [Abstract] |
| Speaker: |
Paul Vitanyi, CWI and University of Amsterdam and National ICT of Australia |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 19, 2005, 2:30 PM, DC1304
|
|
| Title: |
Complexity of Octagonal and Rectangular Cartograms [Abstract] |
| Speaker: |
Burkay Genc, School of Computer Science, University of Waterloo |
|
|
|
| Title: |
Generating combinatorial objects focussing on signed binary representations [Abstract] |
| Speaker: |
Joe Sawada, Computing and Information Science, University of Guelph |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, October 18, 2005, 1:00 PM, DC2305
|
|
| Title: |
Measuring the Difficulty of Distance-Based Indexing[Abstract] |
| Speaker: |
Matthew Skala, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, October 11, 2005, 10:00 AM, DC1304
|
|
| Title: |
Automatic meaning discovery using Google [Abstract] |
| Speaker: |
Paul Vitanyi, CWI and University of Amsterdam and National ICT of Australia |
|
|
Algorithms and Complexity Seminar
|
|
Tuesday, October 4, 2005, 2:30 PM, MC5136
|
|
| Title: |
An asymptotic approximation scheme for multigraph edge coloring [Abstract] |
| Speaker: |
Peter Sanders, Karlsruhe University |
|
|
|
| Title: |
Transversals in Graphs |
| Speaker: |
Penny Haxell, Department of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, September 19, 2005, 11:30 AM, MC 5136
|
|
| Title: |
Tight Regular Arrangements and Shortest Homotopic Paths [Abstract] |
| Speaker: |
Jeff Erickson, Dept. of Computer Science, University of Illinois at Urbana-Champaign |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 1, 2005, 3:30 PM, DC 1304
|
|
| Title: |
Toward an understanding of haplotype inference by pure parsimony [Abstract] |
| Speaker: |
Ian Harrower, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Social Event [Details]
|
|
Wednesday, April 20, 2005, 6 PM, DC 1301(a.k.a. fishbowl)
|
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, March 9, 2005, 3:30 PM, DC 1302
|
|
| Title: |
Computational Aspects of Game Theory and Microeconomics [Abstract] |
| Speaker: |
Vangelis Markakis, Computer Science, Georgia Institute of Technology |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 9, 2005, 3:30 PM, DC 1302
|
|
| Title: |
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem [Abstract] |
| Speaker: |
Jochen Konemann, Dept. of Combinatorics and Optimization, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 2, 2005, 3:30 PM, DC 1304
|
|
| Title: |
The Most Probable Annotation Problem in HMMs [Abstract] |
| Speaker: |
Tomas Vinar, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, January 26, 2005, 3:30 PM, DC 1304
|
|
| Title: |
Connectivity, Expander Graphs, and Deterministic LOGSPACE [Abstract] |
| Speaker: |
Jonathan Buss, School of Computer Science, University of Waterloo |
|
|
Algorithmic Problem Session
|
|
Monday, January 24, 2005, 3:30 PM, DC 2305
|
|
|
Algorithms and Complexity Seminar
|
|
Thursday, January 20, 2005, 3:30 PM, DC 1304
|
|
| Title: |
A Categorization Theorem on Suffix Arrays with Applications to Space Efficient Text Indexes [Abstract] |
| Speaker: |
Meng He, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, December 1, 2004, 3:30 PM, DC 1304
|
|
| Title: |
The Cost of Cache Oblivious Searching[Abstract] |
| Speaker: |
Alex Lopez-Ortiz, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 24, 2004, 3:30 PM, DC 1304
|
|
| Title: |
Longest Increasing Subsequences in Sliding Windows[Abstract] |
| Speaker: |
Alexander Golynski, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 17, 2004, 3:30 PM, DC 1304
|
|
| Title: |
An optimal Bloom filter replacement [Abstract] |
| Speaker: |
Srinivasa Satti Rao, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 10, 2004, 3:30 PM, DC 1302
|
|
| Title: |
Bandwidth Reduction for Video-on-Demand Broadcasting Using
Secondary Content Insertion [Abstract] |
| Speaker: |
Claude-Guy Quimper, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, November 3, 2004, 3:30 PM, DC 1304
|
|
| Title: |
Words avoiding 7/3-powers and the Thue-Morse morphism [Abstract] |
| Speaker: |
Narad Rampersad, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 27, 2004, 3:30 PM, DC 1304
|
|
| Title: |
Some new developments in the theory of k-regular sequences [Abstract] |
| Speaker: |
Jason Bell, Department of Mathematics, University of Michigan |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, October 20, 2004, 3:30 PM, DC 1304
|
|
| Title: |
Greedy-like Algorithms and Graph Optimization Problems [Abstract] |
| Speaker: |
Spyros Angelopoulos, School of Computer Science, University of Waterloo |
|
|
Algorithmic Problem Session
|
|
Monday, October 18, 2004, 3:30 PM, DC 2305
|
|
|
Algorithms and Complexity Seminar
|
|
Friday, October 8, 2004, 10:30 AM, DC 1304
|
|
| Title: |
Optimality HowTo: Computational Lower Bounds (and their application to Google-like Search Engines) [Abstract] |
| Speaker: |
Jeremy Barbay, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, September 29, 2004, 3:30 PM, DC 1304
|
|
| Title: |
Efficient view point selection for silhouettes of convex polyhedra
[Abstract] |
| Speaker: |
Masud Hasan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 28, 2004, 10:00 AM, DC 1304
|
|
| Title: |
A Parameterized Algorithm for Upward Planarity Testing [Abstract] |
| Speaker: |
Hubert Chan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, May 20, 2004, 12 Noon, DC 2305
|
|
| Title: |
Survey propagation and low density parity check codes [Abstract] |
| Speaker: |
Ming-wei Wang, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, May 17, 2004, 11:30 AM, DC 1331
|
|
| Title: |
Regular Expressions: New Results and Open Problems [Abstract] |
| Speaker: |
Ming-wei Wang, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Friday, May 14, 2004, 1:00 PM, DC 3313
|
|
| Title: |
Pattern avoidance problems on graphs and numbers [Abstract] |
| Speaker: |
Ming-wei Wang, School of Computer Science, University of Waterloo |
|
|
Master's Thesis Presentation
|
|
Tuesday, April 27, 2004, 12:00 noon, DC 2305
|
|
| Title: |
Hexagonal Grid Drawings: Algorithms and Lower Bounds [Abstract] |
| Speaker: |
Shabnam Aziza, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Monday, April 19, 2004, 11:00 AM, DC 2305
|
|
| Title: |
Permutation Classes: An Overview [Abstract] |
| Speaker: |
Michael Albert, Department of Computer Science, University of Otago, New Zealand |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, April 15, 2004, 11:00 AM, DC 1331
|
|
| Title: |
Pattern Avoidance and Infinite Sequences [Abstract] |
| Speaker: |
Narad Rampersad, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 18, 2004, 3:30 PM, DC 1304
|
|
| Title: |
The Approximation Power of Priority Algorithms [Abstract] |
| Speaker: |
Spyros Angelopoulos, University of Toronto |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, February 11, 2004, 3:30 PM, DC 1304
|
|
| Title: |
A linear lower bound for testing 3-cnf properties [Abstract] |
| Speaker: |
Sofya Raskhodnikova, Hebrew University http://theory.lcs.mit.edu/~sofya/ |
|
|
Algorithms and Complexity Seminar
|
|
Thursday, January 15, 2004, 1:30 PM, DC 1304
|
|
| Title: |
Monoids and the State Complexity of the Operation root(L) [Abstract] |
| Speaker: |
Bryan Krawetz, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, August 27, 2003, 3:30 PM, DC 1304
|
|
| Title: |
Design Optimal Multiple Seeds for Homology Search [Abstract] |
| Speaker: |
Jinbo Xu, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 23, 2003, 3:30 PM, DC 1304
|
|
| Title: |
Equiprojective Polyhedra [Abstract] |
| Speaker: |
Masud Hasan, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 16, 2003, 3:30 PM, DC 1304
|
|
| Title: |
Parallel Morphing of Trees and Cycles and Approximating the Geometric Minimum Diameter Spanning Tree [Abstract] |
| Speaker: |
Michael J. Spriggs, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, July 2, 2003, 3:30 PM, DC 1302
|
|
| Title: |
Combinatorial Analysis of Quantum Random Walks [Abstract] |
| Speaker: |
Eric Bach, Computer Sciences Department, University of Wisconsin |
|
| Joint Algorithms and Complexity and Artificial Intelligence Seminar |
|
Wednesday, June 18, 2003, 3:30 PM, MC 6091A
|
|
| Title: |
A fast and simple algorithm for bounds consistency of the alldifferent constraint [Abstract] |
| Speaker: |
Claude-Guy Quimper, School of Computer Science, University of Waterloo |
|
|
Algorithms and Complexity Seminar
|
|
Wednesday, June 4, 2003, 3:30 PM, DC 1304
|
|
| Title: |
Curves of Minimum Width and the River Shore Problem [Abstract] |
| Speaker: |
Alexander Golynski, School of Computer Science, University of Waterloo |
|
|
