In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.

During the presentation I will introduce the formalism of tensor networks and introduce their relevance to describe the basic states of many-body systems. Then I will introduce the simplest model with topological order presented by Alexei Kitaev, known as the toric code. On his example, I will construct a Projected Entangled Pair States (PEPS) tensor network that describes the basic state of the model and will present the purpose of my project, ie, investigating anion excitation statistics.

Quantum walks are quantum counterparts of classical random walks.
They have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems.
Most of the results, however, consider a search space containing a single marked element only.
We show that if the search space contains more than one marked element the quantum speed-up may disappear.

The seminar will be devoted to results of http://www.nature.com/articles/ncomms7908. A major application of quantum communication is the distribution of entangled particles for use in quantum key distribution.

Nested loops occur very often in numerical problems. The aim of the presentation is to show various strategies of parallelizing nested loops on modern architectures -- like Intel Xeon and Intel Xeon Phi. We employ both parallelism and vectorization to accelerate nested loops. It is possible to shorten the runtime when utlilizing the appropriate strategies with the use of good scheduling.

The aim of the work "Local management method in cellular networks" was to develop a new method to change configuration of base stations in an LTE cellular network. The main advantage of developed method is a reduction of reconfigured base stations, which can be profitable for the network operator. To solve the problem of determine optimal transmission power in base stations, analytical models and metaheuristic methods were used.