I liked the SODA2009 paper Sorting and Selection in Posets since it makes you look at ordinary sorting in a new way. What does it mean to sort a list? We usually think (correctly) that we take a list of ordered objects and put them into an ordered list. How to extend this to partial orders? We need to re-look at total orders. Say that making a comparison between elements of the ordered set is HARD Then you want to make as few as possible. But you want to, when you are done, have a data structure that makes comparisons easy. Hence we view sorting as follows: Given a set A of n elements from a totally ordered set come up with a data structure of size O(n) such that the operation Given x,y ∈ A which one is bigger? can be done in O(1) time. While setting up the data structure you would like to to do this with as few comparisons as possible. We will assume that comparing two elements of {1,...,n} is easy.
This article outlines the process involved in transforming the del.icio.us user API XML document into an HTML fragment. Because the XSLT processor is compiled, and therefore runs significantly faster than interpreted Javascript in the browser, I push as m
C. Martınez. Proc. 6th ACMSIAM Workshop on Algorithm Engineering and Experiments and 1st ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics, page 224--228. (2004)
K. Batcher. AFIPS Spring Joint Computing Conference, volume 32 of AFIPS Conference Proceedings, page 307-314. Thomson Book Company, Washington D.C., (1968)