There are no prerequisites.
Topics in mathematical foundations of computer science
The content consists of a selection of standard topics in graduate-level computational mathematics such as: symbolic computation, computability theory, computational geometry, logic in computer science, theory of programming languages, algorithms and data structures, cryptography, network analysis, etc. The choice depends on students' research interests.
- T. H. Cormen ... [et al.]: Introduction to Algorithms, 2nd ed. - Cambridge (Mass.) : MIT Press ; Boston : McGraw-Hill, cop. 200
- P. Doreian, V. Batagelj, A. Ferligoj: Generalized blockmodeling, Cambridge : Cambridge University Press, 2005.
- M. Huth, M. Ryan: Logic in computer science : modelling and reasoning about systems, 2nd ed., Cambridge : Cambridge University Press, 2019.
- J. Matoušek: Lectures on discrete geometry, New York : Springer, cop. 2002.
- M. Petkovšek, H. S. Wilf, D. Zeilberger: A=B, Wellesley (Massachusetts) : A. K. Peters, cop. 1996.
- B. C. Pierce: Types and programming languages, Cambridge (Massachusetts) : The MIT Press, cop. 2002.
- H. Rogers: Theory of recursive functions and effective computability, New York : McGraw-Hill, cop. 1967.
- D. R. Stinson: Cryptography : theory and practice, 3rd ed., Boca Raton : Chapman & Hall/CRC, cop. 2006.
The main goal of the course is to provide students with some important topics in computational mathematics.
Knowledge and comprehension of presented concepts.
Ability to use acquired knowledge and skills.
Lectures, consultations, problem sessions
Writen exam (homeworks), oral exam
5 - 10, a student passes the exam if he is graded from 6 to 10
Andrej Bauer:
– BAUER, Andrej, PETKOVŠEK, Marko. Multibasic and mixed hypergeometric Gosper-type algorithms. Journal of symbolic computation, ISSN 0747-7171, 1999, let. 28, št. 4-5, str. 711-736 [COBISS-SI-ID 9210969]
– AWODEY, Steve, BAUER, Andrej. Propositions as [Types]. Journal of logic and computation, ISSN 0955-792X, 2004, vol. 14, no. 4, str. 447-471 [COBISS-SI-ID 13374809]
– BAUER, Andrej, STONE, Christopher A. RZ: a tool for bringing constructive and computable mathematics closer to programming practice. Journal of logic and computation, ISSN 0955-792X, 2009, vol. 19, no. 1, str. 17-43 [COBISS-SI-ID 15325785]
– BAUER, Andrej, CVETKO-VAH, Karin. Stone duality for skew Boolean algebras with intersections. Houston journal of mathematics, ISSN 0362-1588, 2013, vol. 39, no. 1, str. 73-109 [COBISS-SI-ID 16620377]
Sergio Cabello Justo:
– CABELLO, Sergio. Many distances in planar graphs. Algorithmica, ISSN 0178-4617, 2012, vol. 62, no. 1-2, str. 361-381 [COBISS-SI-ID 15702873]
– CABELLO, Sergio. Hardness of approximation for crossing number. Discrete & computational geometry, ISSN 0179-5376, 2013, vol. 49, iss. 2, str. 348-358 [COBISS-SI-ID 16340313]
– CABELLO, Sergio, GIANNOPOULOS, Panos. The complexity of separating points in the plane. Algorithmica, ISSN 0178-4617, 2016, vol. 74, iss. 2, str. 643-663 [COBISS-SI-ID 17195097]
Alexander Keith Simpson:
– AWODEY, Steve, BUTZ, Carsten, SIMPSON, Alex, STREICHER, Thomas. Relating first-order set theories and elementary toposes. Bulletin of symbolic logic, ISSN 1079-8986, 2007, vol. 13, no. 3, str. 340-358 [COBISS-SI-ID 17096537]
– SIMPSON, Alex. Computational adequacy for recursive types in models of intuitionistic set theory. Annals of pure and applied Logic, ISSN 0168-0072. [Print ed.], 2004, vol. 130, iss. 1-3, str. 207-275 [COBISS-SI-ID 17117017]
– SIMPSON, Alex. A characterization of the least-fixed-point operator by dinaturality. Theoretical computer science, ISSN 0304-3975, 1993, vol. 118, iss. 2, str. 301-314 [COBISS-SI-ID 17181017]
Matija Pretnar:
-LUKŠIČ, Žiga., PRETNAR, Matija. Local algebraic effect theories. Journal of Functional Programming, ISSN - 1469-7653, 2020, vol. 30, E13, 27 strani [COBISS-SI-ID – 53281795]
-FORSTER, Y., KAMMAR, O., LINDLEY, S., PRETNAR, M. (2019). On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control. Journal of Functional Programming, ISSN - 1469-7653, 2019, vol. 29, E15, 43 strani [COBISS-SI-ID – 18852441]
-LOKAR, Matija, PRETNAR, Matija. A low overhead automated service for teaching programming. Koli Calling '15: Proceedings of the 15th Koli Calling Conference on Computing Education Research, 2015, 132–136 [COBISS-SI-ID – 17536089]