Instructions for Essays.

Choose one of the below articles/topics and write a concise, 2-page essay on the paper focusing on algorithmic ideas presented or used in the papers. Follow traditional article formatting rules of a conference. E.g. use LNCS TeX style. Don't forget to include proper references.

AAAI style:

Springer/LNCS styles:

You can choose between 1-column or 2-column format.

Page limit is strictly 2 pages

Material for Essays. Make your pick.

Leaning Left Red-Black Trees: Robert Sedgewick: More

Meelis Kull, Jaak Vilo. Fast Approximate Hierarchical Clustering using Similarity Heuristics. BioData Mining, 1:9 2008. doi:10.1186/1756-0381-1-9

Juan Carlos Corrales, Daniela Grigori, and Mokrane Bouzeghoub BPEL Processes Matchmaking for Service Discovery

Bigtable: A Distributed Storage System for Structured Data Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber

A dynamic programming algorithm for haplotype block partitioning K Zhang, M Deng, T Chen, MS Waterman, F Sun - Proceedings of the National Academy of Sciences, 2002

Sudipto Guhaa, Rajeev Rastogib and Kyuseok Shimc Cure: an efficient clustering algorithm for large databases Information Systems Volume 26, Issue 1, March 2001, Pages 35-58 doi:10.1016/S0306-4379(01)00008-4