Flip-pushdown automata: nondeterministic ε-moves can be removed. - Pavol Duris; Marek Kosta (ITAT, 2011)

Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages. - Ralf Karrenberg; Marek Kosta; Thomas Sturm 001 (FroCos, 2013)

Towards Conflict-Driven Learning for Virtual Substitution. - Konstantin Korovin; Marek Kosta; Thomas Sturm 001 (CASC, 2014)

Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable. - Pavol Duris; Marek Kosta (Inf. Process. Lett., 2014)

A Generalized Framework for Virtual Substitution. - Marek Kosta; Thomas Sturm 001 (CoRR, 2015)

Constructing a single cell in cylindrical algebraic decomposition. - Christopher W. Brown 001; Marek Kosta (J. Symb. Comput., 2015)

Better answers to real questions. - Marek Kosta; Thomas Sturm 001; Andreas Dolzmann (J. Symb. Comput., 2016)

New concepts for real quantifier elimination by virtual substitution. - Marek Kosta (2016)

A Case Study on the Parametric Occurrence of Multiple Steady States. - Russell J. Bradford; James H. Davenport; Matthew England 001; Hassan Errami; Vladimir P. Gerdt; Dima Grigoriev; Charles Tapley Hoyt; Marek Kosta; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (ISSAC, 2017)

Identifying the parametric occurrence of multiple steady states for some biological networks. - Russell J. Bradford; James H. Davenport; Matthew England 001; Hassan Errami; Vladimir P. Gerdt; Dima Grigoriev; Charles Tapley Hoyt; Marek Kosta; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (J. Symb. Comput., 2020)