| 'Computational Complexity: A Modern Approach':http://www.cs.princeton.edu/theory/complexity/book.pdf | ==user(user="azotlichid" type="tiny")== | Calculabilitate, clase de complexitate, algoritmi de aproximare si aplicatii. Scrisa de doi profi de la Princeton si oferita gratuit pe net. |
| 'The LCA Problem Revisited':http://www.ics.uci.edu/~eppstein/261/BenFar-LCA-00.pdf | ==user(user="mpatrascu" type="tiny")== | Era un classic pe Lista lui Francu |
| 'Simple Linear Work Suffix Array Construction':http://www.cs.helsinki.fi/juha.karkkainen/publications/icalp03.pdf | ==user(user="mpatrascu" type="tiny")== | Un algoritm de construit suffix trees/array absolut superb. |

| 'Dynamic Transitive Closure via Dynamic Matrix Inverse':http://www.mimuw.edu.pl/~sank/pub/sankowski_focs04.ps | ==user(user="mpatrascu" type="tiny")== | Ca sa ne convingem ca n-am invatat algebra de clasa 11 degeaba. |

| 'Dynamic Transitive Closure via Dynamic Matrix Inverse':http://www.mimuw.edu.pl/~sank/pub/sankowski_focs04.ps | ==user(user="mpatrascu" type="tiny")== | Ca sa ne convingem ca n-am invatat algebra de clasa 11 degeaba. |
| Level ancestor | ==user(user="Cosmin" type="tiny")== | ? |
| Minimal diameter spanning tree | ==user(user="Cosmin" type="tiny")== | ? |
| Smallest polygon containing k points | ==user(user="Cosmin" type="tiny")== | ? |
| Fenwick trees | | |