| 'Text Algorithms W. Rytter':http://web.njit.edu/~rytter/TEACHING/TEXTS/book.html | ==user(user="Cosmin" type="tiny")== | Carte cu o gramada de algoritmi pe stringuri, scrisa de un antrenor al lotului polonez. |
| 'Suffix arrays: A new method for on-line string searches':http://webglimpse.net/pubs/suffix.pdf | ==user(user="Cosmin" type="tiny")== | ? |
| 'Cuckoo hashing':http://cs.nyu.edu/courses/fall05/G22.3520-001/cuckoo-jour.pdf | ==user(user="Cosmin" type="tiny")== | ? |

| 'An O(ND) Difference Algorithm and Its Variations':http://www.xmailserver.org/diff2.pdf | ==user(user="Cosmin" type="tiny")== | Distanta de editare in $O(n)$ memorie (cum am dat eu la GInfo), in $O(d*n)$ timp unde $d$ este distanta de editare finala (cum a dat Mars la ONI). |
| '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. |
 

| 'An O(ND) Difference Algorithm and Its Variations':http://www.xmailserver.org/diff2.pdf | ==user(user="Cosmin" type="tiny")== | Distanta de editare in $O(n)$ memorie (cum am dat eu la GInfo), in $O(d*n)$ timp unde $d$ este distanta de editare finala (cum a dat Mars la ONI). |