1) João Paulo e Marcelo
The analysis of heapsort 
https://www.ugrad.cs.ubc.ca/~cs221/2015W1/handouts/evans/TheAnalysisOfHeapsort.pdf

2) Vitor e Vinícius
Average case analysis of Java 7's dual pivot quicksort
https://arxiv.org/pdf/1310.7409

3) Artur
Deletion Without Rebalancing in Balanced Binary Trees
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.155.3523&rep=rep1&type=pdf

4) João Daniel e Pedro
Analysis of Shellsort and related algorithms
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.35.3839&rep=rep1&type=pdf

5) Etienne e Nícolas
k-means++: The advantages of careful seeding
http://ilpubs.stanford.edu:8090/778/1/2006-13.pdf

6) Domitila
Cuckoo hashing: Further analysis
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.8.8867&rep=rep1&type=pdf

7) Marcus e Mateus
Self-adjusting binary search trees
http://www.cs.princeton.edu/courses/archive/fall07/cos521/handouts/self-adjusting.pdf


8)
An empirical analysis of algorithms for constructing a minimum spanning tree 
https://www.researchgate.net/profile/Bernard_Moret/publication/2687820_An_Empirical_Analysis_of_Algorithms_for_Constructing_a_Minimum_Spanning_Tree/links/00b7d51a4d3a35728e000000/An-Empirical-Analysis-of-Algorithms-for-Constructing-a-Minimum-Spanning-Tree.pdf


9) Gabriel H e Igor
Analysis of an optimized search algorithm for skip lists
https://www.sciencedirect.com/science/article/pii/030439759400296U/pdf?md5=6d86c6991f909f7f335730f8cf1ea5a2&isDTMRedir=Y&pid=1-s2.0-030439759400296U-main.pdf&_valck=1


10) Gabriel e Victor
A new efficient radix sort 
https://www.computer.org/csdl/proceedings/focs/1994/6580/00/0365721.pdf