Loading...
Projects / Programmes source: ARIS

Data structures and algorithms for discrete and continuous mathematics

Research activity

Code Science Field Subfield
1.07.00  Natural sciences and mathematics  Computer intensive methods and applications   

Code Science Field
P170  Natural sciences and mathematics  Computer science, numerical analysis, systems, control 
Keywords
algorithms and data structures, realizability theory, numerical methods, discrete mathematics, computable analysis and topology, graph drawing, symbolic computations, hypergeometric series, network decompositions
Evaluation (rules)
source: COBISS
Researchers (9)
no. Code Name and surname Research area Role Period No. of publicationsNo. of publications
1.  01467  PhD Vladimir Batagelj  Mathematics  Head  2004 - 2007  977 
2.  15854  PhD Andrej Bauer  Mathematics  Researcher  2004 - 2007  199 
3.  02017  PhD Matevž Bren  Mathematics  Researcher  2004 - 2007  291 
4.  04967  PhD Andrej Brodnik  Computer intensive methods and applications  Researcher  2004 - 2007  449 
5.  18389  PhD Urban Kordeš  Interdisciplinary research  Researcher  2005 - 2007  300 
6.  01935  PhD Marko Petkovšek  Mathematics  Researcher  2004 - 2007  366 
7.  01941  PhD Tomaž Pisanski  Mathematics  Researcher  2004 - 2007  866 
8.  15136  PhD Bor Plestenjak  Mathematics  Researcher  2004 - 2007  163 
9.  15137  PhD Matjaž Zaveršnik  Mathematics  Researcher  2004 - 2007  101 
Organisations (2)
no. Code Research organisation City Registration number No. of publicationsNo. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,230 
2.  0588  University of Ljubljana, Faculty of Education  Ljubljana  1627082  30,501 
Abstract
The project focuses on research and development of algorithms and data structures for computationally intensive methods in natural, humanistic, and technical sciences. The first part of the project involves a development of mathematical theory, based on realizability theory and constructive mathematics, which makes it possible to systematically translate mathematical structures that occur in discrete and continuous mathematics into corresponding data structures and algorithms that can be used to represent mathematical objects in computers. In the second part of the project we study concrete examples of data structures and algorithms. The goal is to confirm in practice the usefulness of the theory developed in the first part of the project. We will study examples from both discrete mathematics (graph theory, combinatorial ang geometric configurations, networks) and continuous mathematics (numerical methods and numerical analysis, and data structures for computable analysis and topology). An important aspect of the project is the creation of a programming library consisting of data types and methods for discrete and continuous mathematical objects. The purpose of such a library is transfer of knowledge from theory to programming practice.
Views history
Favourite