Aleksa Stanković

About Me

Hi! I am PhD student in theoretical computer science. My main research interests lie in area of approximation algorithms, semi-definite programming, computational complexity, and hardness of approximation.

Publications

• Aleksa Stanković, Some Results on Approximability of Minimum Sum Vertex Cover - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022) - C++ code
• Amey Bhangale, Aleksa Stanković, Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs - 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022,
• Aleksa Stanković, On Regularity of Max-CSPs and Min-CSPs- Information processing Letters, Volume 176, 2022
• Per Austrin, Aleksa Stanković, Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder - 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2019), 2019, pp. 24:1--24:17

Education

• PhD, Department of Mathemathics, KTH - Royal Institute of Technology Stockholm (August 2018 -> present)
  • Research Topic: Approximation algorithms, semi-definite programming, complexity theory. More precisely, constraint satisfaction problems with cardinality constraints.
  • Advisors: Johan Håstad, Jakob Nordström Per Austrin
• Master in Computational Science and Engineering, EPFL - École Polytechnique Fédérale de Lausanne (September 2015 -> February 2018)
  • Semester project 1: Schoof-Elkies-Atkin Point Counting Algorithm for Cryptographic Purposes - Python Sage Implementation
  • Semester project 2: Adaptive Time-Stepping Methods for Numerical Integration of Stochastic Differential Equations Using S-ROCK Methods
  • Master thesis: Probabilistic methods for differential equations: adaptivity and Bayesian inverse problems
• Bachelor's degree in Theoretical Mathematics, University of Belgrade (September 2011 -> August 2015)
• Bachelor's degree in Computer Science, Union University (September 2011 -> August 2015)
  • Bachelor's Thesis (In Serbian): Number Factorization using General Number Field Sieve