Research in a broad spectrum of combinatorial optimization problems and its applications, with particular focus on complexity issues, design and analysis of efficient exact and approximation algorithms, use of polyhedral approaches, and other techniques. Research topics include semidefinite optimization, probabilistic methods, network design, routing, packing, as well as game theoretical problems.
Members:
To study the application of mathematical and computing techniques for the generation and management of information in the Biology and Biotechnology areas.
Members:
Research in discrete and computational geometry, matroid theory, probabilistic methods and random combinatorial structures, graphs and hypergraphs (structural properties, extremal problems, coloring, decomposition, and others).
Members:
Group website: https://compmus.ime.usp.br/
Members:
To research the range of methods and techniques through which computer systems may be able to interact with and respond to images and to model learning processes in their many manifestations.
Members:
To develop efficient (and demonstrably secure) algorithms and protocols based on issues such as integer factorization, discrete logarithm calculation, calculation of bilinear pairing, etc.
Members:
To develop artificial intelligence techniques and study their applications in Computer Science as well as in other areas.
Members:
To develop software systems, especially the distributed ones, the concurrent ones and the ones for storage and retrieval of data; study the evaluation and the definition of technologies that facilitate their construction, maintenance and evolution.
Members:
Compartilhe