Profil tomescu_alin

aLiNuSh

== include(page="template/noprofile") ==
 

h2. Despre mine

_(completeaza aici: studii, an de absolvire, institutie de invatamant, locatie, profesori pregatitori, site personal ...)_
 
h2. Distinctii primite

Poti afla mai multe pe "alinush.org":http://alinush.org
Poţi citi articole scrise de mine pe "InfernoDevelopment.com":http://www.infernodevelopment.com

* _(completeaza aici: locuri obtinute la concursuri de informatica)_

h2. Coding

h2. Prieteni pe infoarena

h3. Arhiva educaţională

* _(completeaza aici: link-uri catre profilele altor utilizatori infoarena pe care ii cunosti)_
 

"Algoritmul lui Euclid":http://infoarena.ro/job_detail/278010?action=view-source
"Algoritmul lui Euclid extins":http://infoarena.ro/job_detail/665412?action=view-source
"Ciurul lui Eratosthenes":http://infoarena.ro/job_detail/281275?action=view-source
"Sortare prin comparare":http://infoarena.ro/job_detail/281561?action=view-source
"Hashuri":http://infoarena.ro/job_detail/282207?action=view-source
"Generare de permutari":http://infoarena.ro/job_detail/282211?action=view-source
"Ridicare la putere in timp logaritmic":http://infoarena.ro/job_detail/282423?action=view-source
"Dijkstra":http://infoarena.ro/job_detail/287715?action=view-source
"Evaluarea unei expresii":http://infoarena.ro/job_detail/307485?action=view-source
"Heapuri":http://infoarena.ro/job_detail/322504?action=view-source
"Cel mai lung subsir comun":http://infoarena.ro/job_detail/327090?action=view-source
"Submultimi":http://infoarena.ro/job_detail/389646?action=view-source
"Combinari":http://infoarena.ro/job_detail/391136?action=view-source
"Sortare topologica":http://infoarena.ro/job_detail/442750?action=view-source
"Parcurgere DFS - componente conexe":http://infoarena.ro/job_detail/442753?action=view-source
"Parcurgere in latime":http://infoarena.ro/job_detail/442767?action=view-source
"Arbore partial de cost minim":http://infoarena.ro/job_detail/443117?action=view-source
"Paduri de multime disjuncte":http://infoarena.ro/job_detail/443119?action=view-source
"Floyd-Warshall -- all paths":http://infoarena.ro/job_detail/443123?action=view-source
"Cautare binara":http://infoarena.ro/job_detail/455128?action=view-source
"Bellman-ford":http://infoarena.ro/job_detail/455140?action=view-source
"Trie":http://infoarena.ro/job_detail/455189?action=view-source
"Deque":http://infoarena.ro/job_detail/455218?action=view-source
"Statistici de ordine":http://infoarena.ro/job_detail/457778?action=view-source
"Parantezare optima de matrici":http://infoarena.ro/job_detail/458038?action=view-source
"Al k-lea termen Fibonacci":http://infoarena.ro/job_detail/458126?action=view-source
"Subsecventa de suma maxima":http://infoarena.ro/job_detail/458247?action=view-source
"Componente tare conexe":http://infoarena.ro/job_detail/459624?action=view-source
"Invers modular":http://infoarena.ro/job_detail/665453?action=view-source
 
h3. Arhiva de probleme
 
"Jocul Flip":http://infoarena.ro/job_detail/200068?action=view-source
"Fracţii":http://infoarena.ro/job_detail/281284?action=view-source
 
h2. Studii
 
* 2013-prezent: Massachusetts Institute of Technology (MIT)
* 2008-2012: State University of New York at Stony Brook, Stony Brook, NY
* 2004-2008: Colegiul National "Ion C. Bratianu", Piteşti, Argeş