Talks

You can download from here most of my talks since 2002.

On the Average Performance of Fixed Partial Match Queries in Random Relaxed K-d Trees. 25th Intl. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'14). Paris, France, 2014.
Data Streams as Random Permutations: the Distinct Element Problem. 23rd Intl. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12). Montreal, Canada, 2012. I also gave this talk at the VIII Jornadas Matématica Discreta y Algorítmica in Almería, Spain in July 2012.
Techniques probabilistes et combinatoires pour l'analyse des flux de données (in French). Journées ALÉA, Luminy, France, 2012.
Search Trees. Philippe Flajolet and Analytic Combinatorics: Conference in the memory of Philippe Flajolet, Paris, December 2011.
Rank Selection in Multidimensional Data. 22nd Intl. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'11).Bedlewo, Poland, 2011. This talk presents new results obtained after 2010.
The Swedish Leader Election Protocol: Analysis and Variations. ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO). San Francisco, USA, 2011.
The Hiring Problem. Seminar of the Department of Computer Science, Univ. Cape Town, South Africa, 2010. A longer version of the talk presented at the Colloquium for Philippe Flajolet's 60th Birthday and at Discrete Math Days. It includes a brief tutorial on generating functions and the symbolic method.
Interval Sorting. Intl. Conf. Automata, Languages and Programming (ICALP). Bordeaux, France, 2010. This is a 30-min. presentation, for the longer version check the item below.
Interval Sorting. Seminar GREYC, Univ. Caen, Caen, France, 2010. Also in the seminar of LIAFA, Université Paris 7.
Searching with Dice. Journée inaugurale du equippe CALIN. LIPN, Univ. Paris 13, France, 2010. I have presented slight variations at LIP6, Univ. Paris 6, also in May 2010, at FACS Lab, Univ. Cape Town, South Africa, 2010 and at the Instituto de Computación (INCO), Univ. de la República, Uruguay, 2011.
Rank selection in multidimensional data. Journées ALÉA, Luminy, France, 2010. A. Duch gave a similar presentation at LATIN 2010.
Asymptotic Analysis and Optimal Selection. Second Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM). Montreal, Canada, 2009.
Analysis of Approximate Quickselect and Related Problems. Laboratoire d'Informatique de la Université Paris 6 (LIP6). Paris, France, 2009.
The hiring problem and permutations. Colloquium for Philippe Flajolet's 60th Birthday. Paris, France, 2008. Also in Ottawa-Carleton Discrete Math Days. Ottawa, Canada, 2009.
El problema de la contratación en permutaciones. VI Jornadas Matématica Discreta y Algorítmica. Lleida, Spain, 2008.
Análisis de Algoritmos: Teoría y Aplicaciones. Univ. Zaragoza, Spain, 2008
The rôle of experiments in Analysis of Algorithms. Invited talk. Intl. Conference on Analysis of Algorithms (AofA 2008). Maresias, Brazil, 2008.
Probabilistic Analysis of Algorithms: What's It Good For?. U. Cape Town, South Africa, 2008.
Probabilistic Analysis of Algorithms: What's It Good For?. U. Stellenbosch, South Africa, 2008 (this talk has the same title as the previous one, but different content).
Generating Random Derangements: Fifth ACM-SIAM Workshop on Analytic Algorithms and Combinatorics (ANALCO08). San Francisco, USA, 2008.
Analyzing algorithms: discrete math and probability theory in action: Fachgruppe Stochastik, Mathematischen Seminar, Christian-Albrechts-Universität zu Kiel. Kiel, Germany, 2007.
Applications of Discrete Mathematics to the Analysis of Algorithms: First Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM). Banff, Canada, 2007.
Updating K-d Trees: ALBCOM Seminar. Barcelona, 2007. You can also watch the video of the talk in Spanish (.WMV, 194 MB). Also in the CRM Seminar on Enumerative Combinatorics and Random Structures. Bellaterra, Spain, 2007, and Institut für Geometrie un Diskrete Mathematik, TU Wien, Wien, Austria, 2007.
On the Average Cost of Insertions on Random Relaxed K-d Trees: ACM-SIAM Workshop on Analytic Algorithms and Combinatorics (ANALCO). New Orleans, USA, 2007.
Branch Mispredictions in Quicksort: Intl. Seminar on the Analysis of Algorithms (AofA). Alden Biesen, Belgium, 2006.
Chunksort: A Generalized Partial Sorting Algorithm: V Jornadas Matématica Discreta y Algorítmica. Soria, Spain, 2006. Also in the Ottawa-Carleton Discrete Mathematics Day. Ottawa, Canada, 2006.
Adaptive Sampling for Selection: Dagstuhl Seminar on Data Structures. Dagstuhl, Germany, 2006.
Optimal Sampling for Sorting and Selection: INCO, U. de la República. Montevideo, Uruguay, 2006. School of CS, McGill University. Montréal, Canada, 2006. School of CS, University of Waterloo. Waterloo, Canada, 2006. School of CS, Carleton University. Ottawa, Canada, 2006.
On the Variance of Quickselect: ACM-SIAM Workshop on Analytic Algorithms and Combinatorics (ANALCO). Miami, USA, 2006. Also in the Carleton Applied Probability Day, Ottawa, Canada, 2006, and Inst. Gaspard-Monge, Univ. Marne-la-Vallée, Marne-la-Vallée, France, 2005.
On Partial Sorting: Intl. Seminar on the Analysis of Algorithms (AofA). Berkeley, USA, 2004.
Partial Quicksort: ACM-SIAM Workshop on Analytic Algorithms and Combinatorics (ANALCO). New Orleans, USA, 2004.
Quickselect con muestreo adaptativo: IV Jornadas Matématica Discreta y Algorítmica. Cercedilla, Spain, 2004.
Adaptive Sampling for Quickselect: ALCOM-FT General Meeting. Aarhus, Dankmark, 2004. Also in the Intl. Seminar on the Analysis of Algorithms (AofA). San Miniato, Italy, 2003.
Forty years of Quicksort and Quickselect: a personal view: Sem. INRIA, INRIA. Rocquencourt, France, 2003. Sem. LIPN, Université Paris 13. Villetaneuse, France, 2003. Sem. Carleton-UOttawa, Carleton University. Ottawa, Canada, 2004.
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures: Intl. Conf. Automata, Languages and Programming (ICALP). Málaga, Spain, 2002.