Photo by Andreas Bergsten
About
I defended my PhD in the
Theoretical Computer Science Group
at the
School of Computer Science and Communication (CSC)
at
KTH Royal Institute of Technology
in Stockholm, Sweden. My PhD work was on Proof Complexity under the supervision of Prof. Jakob Nordström.
Contact Info
- Email: miksa at-sign kth dot se
Research
Papers
-
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
From Small Space to Small Width in Resolution.
ACM Transactions on Computational Logic,
volume 16,
issue 4,
article 28,
November 2015.
-
Mladen Mikša and Jakob Nordström.
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds.
In Proceedings of the 30th Annual Computational Complexity Conference (CCC '15),
pages 467-487,
June 2015.
-
Mladen Mikša and Jakob Nordström.
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds.
Technical Report TR15-078,
Electronic Colloquium on Computational Complexity (ECCC),
May 2015.
-
Mladen Mikša and Jakob Nordström.
Long Proofs of (Seemingly) Simple Formulas.
In Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing (SAT '14),
Lecture Notes in Computer Science, volume 8561,
pages 121-137, July 2014.
-
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
From Small Space to Small Width in Resolution.
Technical Report TR12-081,
Electronic Colloquium on Computational Complexity (ECCC), June 2014.
-
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
From Small Space to Small Width in Resolution.
In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS '14), pages 300-311, March 2014.
-
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
Towards an Understanding of Polynomial Calculus: New Separations and
Lower Bounds.
In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP '13), pages 437-448, July 2013.
PhD Thesis
-
Mladen Mikša. On Complexity Measures in Polynomial Calculus. PhD thesis, KTH Royal Institute of Technology, Stockholm, Sweden, January 2017.
Some Presentations
-
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds.
Brief talk given at CCC '15 in Portland, Oregon, USA, June 2015.
-
Long Proofs of (Seemingly) Simple Formulas.
Brief talk given at SAT '14 in Vienna, Austria, July 2014.
-
From Small Space to Small Width in Resolution.
Brief talk given at STACS '14 in Lyon, France, March 2014,
and
at the proof complexity workshop at FloC '14 in Vienna, Austria, July 2014.
-
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds.
Brief talk given at ICALP '13 in Riga, Latvia, July 2013.
Posters
-
Small Space to Small Width in Resolution.
Presented at STOC '13, June 2013.
Teaching
Spring 2016
-
Algorithms and Complexity
Autumn 2015
-
Algorithms, data structures, and complexity
-
Advanced algorithms
Spring 2015
-
Algorithms and Complexity
Autumn 2014
-
Algorithms, data structures, and complexity
-
Advanced algorithms
Spring 2014
-
Algorithms and Complexity
Autumn 2013
-
Algorithms, data structures, and complexity
-
Advanced algorithms
|
