Show only:
Show all labs
We focus on cryptography and computer security, discrete mathematics, coding theory and statistical design. We have extensive experience in applied cryptography, especially public key cryptosystems (elliptic curve cryptosystems), cryptographic protocols (AKC) and their implementations in restricted environments, such as smart cards (including HSM and FPGA). We also study algebraic combinatorics (distance-regular graphs, association schemes, finite geometries, codes, finite fields and the like), probability and statistics.
Research areas:
Systems and networks
Theoretical computer science and mathematical methods
We are involved in research in various spheres of continuous and discrete mathematics. On the one hand our research topics include commutative algebra, linear algebra, nonlinear dynamical systems, Brownian motion, martingales, algebraic topology, computational topology, topological data analysis and scientific computing. On the discrete side of the mathematical spectrum, however, we deal with problems in graph theory, particular the structural and colouring problems of graphs, which are also connected with problems in computational geometry.
Research areas:
Theoretical computer science and mathematical methods
The prime area of research interest is efficient data handling in distributed pervasive environments, which store terabytes of data that present a challenge in at least two areas: the efficient storage and handling of the data. The distributed environment is inherently capable of parallel processing and requires a proper data and work distribution. Our research is concentrated on three areas: unstructured text handling, data deduplication and on-line streaming data processing. We are also active in the area of Computer Science Education.
Research areas:
Systems and networks
Theoretical computer science and mathematical methods
We conduct research in the areas of approximation and randomised algorithms, linear algebra (matrix multiplication), combinatorial optimisation (routing, problems on graphs, issues regarding the robustness of a facility location), parallel computation (algorithm mapping and scheduling, algorithms in parallel systems, hardware supported multithreading, dataflow computing), algorithm engineering and experimental algorithmics (boosting algorithm efficiency in practice), compiler design (parsing methods, attribute grammars), operating system design, grid computing (data replication on data grids), as well as computability and complexity theory.
Research areas:
Theoretical computer science and mathematical methods