People‎ > ‎

Monika Polak

Monika Polak


Monika Polak
568 Science & Engineering Building
Department of Mathematics
Oakland University
Rochester, MI, 48309




Research
  • Combinatorial Algebraic Geometry, Tropical Superelliptic Curves, Coding Theory, Cryptography
Education
  • PhD Mathematics, 2016, Maria Curie-Skłodowska University, Lublin, Poland
  • MS Mathematics, 2016, Maria Curie-Skłodowska University, Lublin, Poland
Experience
  • Visiting Scholar, Oakland University, 2017-2018
  • Assistant Professor of Mathematics, University of Information Science and Technology, Ohrid, R. Macedonia, 2016-2017
Papers
  • Tropical superelliptic curves (with T. Shaska), in progress
  • M. Polak, V. Ustimenko, Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes, Annales Informatica, Volume 15, no. 2 (2015) pp 14-21.
  • M. Polak, V. Ustimenko, On LDPC codes based on families of expanding graphs of increasing girth without edge-transitive automorphism groups, Springer, Communications in Computer and Information Science, Volume 448 (2014), pp 74-88.
  • M. Polak, V. Ustimenko, On stream cipher based on a family of graphs D(n, q) of increasing girth, Albanian J. Math., Volume 8 (2014), no. 2, pp 37-45.
  • M. Polak, V. Ustimenko, On new expanders of unbounded degree for practical applications in Informatics, Dopovidi Akademii nauk Ukrainskoi RSR, 2014, no. 12, pp 44-50.
  • M. Polak, U. Romanczuk, V. Ustimenko, A. Wroblewska, On the applications of Extremal Graph Theory to Coding Theory and Cryptography, Electronic Notes in Discrete Mathematics, Volume 43 (2013) pp 329-342.
  • M. Polak, V. Ustimenko, Examples of Ramanujan and expander graphs for practical applications, Federated Conference on Computer Science and Information Systems 2013, pp 499-505, Proceedings in the IEEE Xplore Digital Library.
  • M. Polak, V. Ustimenko, LDPC Codes based on algebraic graphs, Annales Informatica AI, Volume 12, no. 3 (2012), pp 107-119.





Comments