SzTKCsThis department is part of the Informatics Laboratory. Head of department- Lajos Rónyai

Description
One of the most important trends in computing sciences is the analysis and development of efficient algorithms. In fact, this direction has had a long and reputable tradition, with significant theoretical and practical results. The members of the Research Group have been active in the area for over a decade, with algebraic and arithmetical algorithms, geometry, statistics, and database related computational and mathematical problems in the forefront of their interest. The common central motif of these research activities has always been a quest for efficient algorithms which have strong theoretical guarantees for their good performance.
More information:
Staff- János Demetrovics
- Gábor Ivanyos

- Géza Kós

- Csaba Schneider

- Tamás Szőnyi

2012.- Trading GRH for algebra: algorithms for factoring polynomials and related structures
2011.- Multivalued generalizations of the Frankl-Pach Theorem
- A novel approach for failure localization in all-optical mesh networks
Authors: Rónyai, Lajos; Tapolcai, János; Wu, Bin; Ho, Pin-HanDate: 2011.
- Failure localization for shared risk link groups in all-optical mesh networks using monitoring trails
Authors: Rónyai, Lajos; Tapolcai, János; Ho, Pin-Han; Babarczi, Péter; Wu, BinDate: 2011.
2009.- Algebraic properties of modulo q complete l-wide families.
Authors: Felszeghy , Bálint; Hegedűs , Gábor; Rónyai, LajosDate: 2009.
2008.- Constructions for quantum computing with symmetrized gates.
|