Proiectarea Algoritmilor Eficienti - Portalul Seriilor de Informatica

Join this site Explore »

Proiectarea Algoritmilor Eficienti

Algoritmi de dispersie (hashing)
Structuri de date dinamice: Motivatie, Exemple, Strategii de optimizare (Lowest common ancestor, Range Minimum Query, etc.).
Structuri de date pentru rezolvarea problemelor de algoritmica pentru texte: vectori de sufixe, arbori de sufixe. Algoritmi de utilizare, Algoritmi pentru structuri dinamice, exemple de aplicatii.
Algoritmi pentru procesare datelor de pe suport extern (B-Trees, Dynamic B -Trees, etc.).
Algoritmi geometrici (Convex hull, Nearest points, Voronoi, etc.).
Algoritmi probabilisti: Motivatie, exemple.
Algoritmi aproximativi: Motivatie, exemple.

Click here to edit contents of this page.

Click here to toggle editing of individual sections of the page (if possible). Watch headings for an "edit" link when available.

Append content without editing the whole page source.

Check out how this page has evolved in the past.

If you want to discuss contents of this page - this is the easiest way to do it.

View and manage file attachments for this page.

A few useful tools to manage this Site.

See pages that link to and include this page.

Change the name (also URL address, possibly the category) of the page.

View wiki source for this page without editing.

View/set parent page (used for creating breadcrumbs and structured layout).

Notify administrators if there is objectionable content in this page.

Something does not work as expected? Find out what you can do.

General Wikidot.com documentation and help section.

Wikidot.com Terms of Service - what you can, what you should not etc.

Wikidot.com Privacy Policy.

Portalul Seriilor de Informatica