Algorithms Visualization Tool for Students and Lectures in Computer Science

The best way to understand complex data structures or algorithm is to see them in action. The present work presents a new tool, especially useful for students and lecturers in computer science. It is written in Java and developed at Bordeaux University of Sciences and Technology. Its purposes is to help students in understanding classical algorithms by illustrating them in different ways: graphical (animated), formal, and descriptive. We think that it can be useful to everyone interested in algorithms, in particular to students in computer science that want to beef up their readings and university lecturers in their major effort to enhance the data structures and algorithms course. The main new thing of this tool is the fact of making it possible to the user to animate their own algorithms

Сравнение сложность алгоритмов вставкой и быстрой сортировки

A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human readable output. Sorting algorithms are prevalent in introductory computer science classes, where the abundance of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as big O notation, divide and conquer algorithms, data structures such as heaps and binary trees, randomized algorithms, best, worst and average case analysis, time-space tradeoffs, and upper and lower bounds

Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation

In a probabilistic context, the main data structures of computer science are viewed as random combinatorial objects. Analytic Combinatorics, as described in the book by Flajolet and Sedgewick, provides a set of high-level tools for their probabilistic analysis. Recursive combinatorial definitions lead to generating function equations from which efficient algorithms can be designed for enumeration, random generation and, to some extent, asymptotic analysis. With a focus on random generation, this tutorial first covers the basics of Analytic Combinatorics and then describes the idea of Boltzmann sampling and its realisation. The tutorial addresses a broad TCS audience and no particular pre-knowledge on analytic combinatorics is expected

Hatékony algoritmusok = Efficient algorithms

A kutatás során csoportunk egy sor új eredményt ért el a számítástudomány több területén. Ezek a területek: algebrai és szimbolikus számítások, számításelmélet, kombinatorikus optimalizálás, adatbázis-elmélet, adatbányászat és internetes algoritmusok. Néhány fontosabb eredmény: -- véges ponthalmazokhoz rendelhető Gröbner-bázisok és kapcsolódó struktúrák leírása kombinatorikai szempontból érdekes esetekben, -- a kvantumszámítások néhány fontos modelljének az összehasonlítása, számító erejük tisztázása, kvantumalgoritmusok kidolgozása, -- az ""Adatbázis-szerkezetek"" c. akadémiai Nívódíjas monográfia elkészülte, -- komoly előrelépést értünk el több, az interneten való kereséssel kapcsolatos kérdésben: új, hatékony algoritmusokat javasoltunk a világháló lapjainak személyes preferenciákat figyelembe vevő rangsorolására; algoritmust dolgoztunk ki a web spam jelenség nagy megbízhatóságú, automatikus detektálására; létrehoztunk egy kísérleti keresőrendszert, -- új hatékony adatbányászati algoritmusok kidolgozása és ezek alkalmazása; az alkalmazások közül kiemelkedik a telekommunikációs ügyfelek viselkedésének modellezésével kapcsolatos vizsgálatunk, amely Barabási Albert László világhírű kutatócsoportjával közös munka, és amelyről a The New York Times is beszámolt. | With the partial support of the present grant, we have achieved new results in several fields of computer science, including algebraic and symbolic computation, theoretical computer science, combinatorial optimization, database theory, data mining, algorithms for the internet. Some of the highlights are: -- a description of Gröbner bases and related structures attached to finite sets of of points, where the point sets have combinatorial significance, -- a comparison of some models of quantum computation from the perspective of computing power; development of new quantum algorithms, -- publication of the monograph ""Database structures"" (in Hungarian) which won the Quality Prize of the Akadémai Kiadó, -- significant advances in several directions connected to searching the internet: we proposed new, efficient methods for obtaining a personalized ranking of web pages; we proposed algorithms for the automatic and highly reliable detection of spam links in the web; we developed an experimental search engine, -- development and applications of new algorithms for several data mining tasks; among the applications the most important is a model for telecommunication customer behaviour, which has been elaborated in a joint project with the renowned group of Albert László Barabási, among others The York Times reported on some of our findings