[ Universität Bonn | Institut für Informatik | Abteilung V | deutsche Version ]

Publications

• Marek Karpinski and Roland Markó: Explicit Bounds for Nondeterministically Testable Hypergraph Parameters, preprint, [arXiv:1509.03046], 2015.

• Marek Karpinski and Roland Markó: On the Complexity of Nondeterministically Testable Hypergraph Parameters, preprint, [arXiv:1503.07093], 2015.

• Marek Karpinski and Roland Markó: Complexity of Nondeterministic Graph Parameter Testing, submitted, [arXiv:1408.3590], 2014 (revised 2016).

• Marek Karpinski and Roland Markó: Limits of CSP Problems and Efficient Parameter Testing, submitted, [arXiv:1406.3514], 2014 (revised 2016).

• Roland Markó and Ádám Timár: A Poisson allocation of optimal tail, Annals of Probability, Vol. 44, No. 2, 1285-1307, [arXiv:1103.5259], 2016.

• András Krámli and Roland Markó: Lower threshold ground state energy and testability of minimal balanced cut density, Annales Univ. Sci. Budapest., Sect. Comp., Vol. 42, 231-247, [arXiv:1407.1662], 2014.

Talks

• On Approximability, Convergence, and Limits of CSP Problems
  (slides), Bonn, July 18, 2016