Teaching


Fall 2012:

  • Discrete mathematics for programmers, part 1 (function, number sets, combinatorics, complex numbers, number theory)
  • Introduction to computer algebra systems (maple, sage)
  • Parallel algorithms

Former teaching:

  • Discrete mathematics for programmers, part 2 (graphs, polynomials, coding theory)
  • Introduction to chaotic dynamical systems
  • Computational complexity
  • Problem solving seminar

Publications


Refereed journal papers:


Burcsi, P., Cicalese, F., Fici, G., Lipták, Zs.: Algorithms for Jumbled Pattern Matching
in Strings,
International Journal of Foundations of Computer Science. To appear
 
Burcsi, P., Cicalese, F., Fici, G., Lipták, Zs.: On Approximate Jumbled Pattern
Matching in Strings,
Theory of Computing Systems 50 (2012), 35-51

Burcsi, P., Czirbusz, S., Farkas, G.: Computational investigation of Lehmer's Totient
Problem, to Annales Universitatis Scientarium Budapestinensis, Sectio
Computatorica 35 (2011), 43-49 
 
Burcsi, P., Kovács, A., Tátrai, A.: Start-phase control of distributed concurrent
legacy systems written in Erlang/OTP, Acta Universitatis Sapientiae, Informatica 2, 1
(2010) 10−27  
 
Burcsi, P., Kovács, A.: Exhaustive search methods for CNS polynomials, Monatshefte
für Mathematik 155 (2008) 421-430
 
Burcsi, P., Kovács, A., Papp-Varga, Zs.: Decision and Classification Algorithms for
Generalized Number Systems, Annales Universitatis Scientarium Budapestinensis,
Sectio Computatorica 28 (2008) 141-156
 
Burcsi, P., Kovács, A.: On the importance of cache tuning in a cache-aware
algorithm: a case study, Computers and Mathematics with Applications 53 (2007)
880-885
 
Burcsi, P., Kovács, A.: An algorithm checking a necessary condition of number
system constructions,  Annales Universitatis Scientarium Budapestinensis, Sectio
Computatorica 25 (2005) 143-152