Laboratory for Algorithms and Data Structures

Staff members perform research in the areas of approximation and randomized algorithms, algorithms for problems in linear algebra (in particular matrix multiplication), combinatorial optimization (routing and other problems involving circulant graphs, robustness of the facility location problem), parallel computation (mapping and scheduling, algorithms in parallel systems, hardware supported multithreading), compiler design (parsing methods and attribute grammars), operating systems design, grid computing (data replication on Data Grids).

Laboratory for algorithms and data structures (LALG) participates in a global research network PlanetLab (, which currently consists of more than 380 leading academic institutions and companies from all over the world. More than 780 powerful computers are at our disposal for testing different distributed algorithms,protocols, and services.


Selected References

  • U.Čibej, B.Robič. Locating copies of data in grid computing environment: a formal model and heuristics. Proc. EWGLA 2004, September 5–8, Saarbrucken, Germany.
  • U.Čibej, B.Slivnik, B.Robič. Zahtevnost izboljšave požrešnega podvajanja podatkov v podatkovnih omrežjih. Zbornik trinajste mednarodne Elektrotehniške in računalniške konference ERK 2004, september 2004, Portorož, Slovenija. vol. B, pp. 123–126.
  • U.Čibej, B.Slivnik, B.Robič. The complexity of static data replication in data grids. Parallel Computing (to appear).
  • T.Dobravec, J.Žerovnik, B.Robič. An optimal message routing algorithm for circulant networks. Journal of Systems Architecture (to appear).
  • T.Dobravec, B.Robič. Shortest paths in semi-directed 2-circulant networks. Proc. Theoretical Computer Science, Information Society 2004, Ljubljana, October 2004, pp. 189–192.


Closed Projects

Web Page

More about this laboratory