2D context-free grammars: Mathematical formulae recognition. - Daniel Prusa; Václav Hlavác (Stringology, 2006)

Mathematical Formulae Recognition Using 2D Grammars. - Daniel Prusa; Václav Hlavác (ICDAR, 2007)

Structural Construction for On-Line Mathematical Formulae Recognition. - Daniel Prusa; Václav Hlavác (CIARP, 2008)

Generic framework for integration of programming languages into netbeans ide. - Jan Jancura; Daniel Prusa (PEPM, 2008)

Web application for recognition of mathematical formulas. - Jan Stria; Daniel Prusa (ITAT, 2011)

Two-Dimensional Sgraffito Automata. - Daniel Prusa; Frantisek Mráz (Developments in Language Theory, 2012)

MfrDB: Database of Annotated On-Line Mathematical Formulae. - Jan Stria; Martin Bresler; Daniel Prusa; Václav Hlavác (ICFHR, 2012)

New Results on Deterministic Sgraffito Automata. - Daniel Prusa; Frantisek Mráz; Friedrich Otto (Developments in Language Theory, 2013)

Modeling Flowchart Structure Recognition as a Max-Sum Problem. - Martin Bresler; Daniel Prusa; Václav Hlavác (ICDAR, 2013)

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. - Daniel Prusa; Frantisek Mráz; Friedrich Otto (CIAA, 2013)

Restarting Tiling Automata. - Daniel Prusa; Frantisek Mráz (Int. J. Found. Comput. Sci., 2013)

How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem? - Daniel Prusa; Tomás Werner (EMMCVPR, 2014)

Recognition System for On-Line Sketched Diagrams. - Martin Bresler; Truyen Van Phan; Daniel Prusa; Masaki Nakagawa; Václav Hlavác (ICFHR, 2014)

Garment perception and its folding using a dual-arm robot. - Jan Stria; Daniel Prusa; Václav Hlavác; Libor Wagner; Vladimír Petrík; Pavel Krsek; Vladimír Smutný (IROS, 2014)

Weight-Reducing Hennie Machines and Their Descriptional Complexity. - Daniel Prusa (LATA, 2014)

Polygonal Models for Clothing. - Jan Stria; Daniel Prusa; Václav Hlavác (TAROS, 2014)

Two-dimensional Sgraffito automata. - Daniel Prusa; Frantisek Mráz; Friedrich Otto (RAIRO Theor. Informatics Appl., 2014)

Graph-based simplex method for pairwise energy minimization with binary variables. - Daniel Prusa (CVPR, 2015)

On a class of rational functions for pictures. - Frantisek Mráz; Friedrich Otto; Daniel Prusa (NCMA, 2015)

Detection of Arrows in On-Line Sketched Diagrams Using Relative Stroke Positioning. - Martin Bresler; Daniel Prusa; Václav Hlavác (WACV, 2015)

(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars. - Daniel Prusa (CIAA, 2015)

Universality of the Local Marginal Polytope. - Daniel Prusa; Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

Recognizing Off-Line Flowcharts by Reconstructing Strokes and Using On-Line Recognition Techniques. - Martin Bresler; Daniel Prusa; Václav Hlavác (ICFHR, 2016)

Complexity of Sets of Two-Dimensional Patterns. - Daniel Prusa (CIAA, 2016)

Online recognition of sketched arrow-connected diagrams. - Martin Bresler; Daniel Prusa; Václav Hlavác (Int. J. Document Anal. Recognit., 2016)

Some classes of rational functions for pictures. - Frantisek Mráz; Friedrich Otto; Daniel Prusa (RAIRO Theor. Informatics Appl., 2016)

Non-recursive trade-offs between two-dimensional automata and grammars. - Daniel Prusa (Theor. Comput. Sci., 2016)

Rank-Reducing Two-Dimensional Grammars for Document Layout Analysis. - Daniel Prusa; Akio Fujiyoshi (ICDAR, 2017)

Template-Based Pattern Matching in Two-Dimensional Arrays. - Yo-Sub Han; Daniel Prusa (IWCIA, 2017)

LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP. - Daniel Prusa; Tomás Werner (SODA, 2017)

Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton. - Daniel Prusa (Int. J. Found. Comput. Sci., 2017)

LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program. - Daniel Prusa; Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2017)

Undecidability of the emptiness problem for context-free picture languages. - Daniel Prusa; Klaus Reinhardt (Theor. Comput. Sci., 2017)

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (DLT, 2018)

Dynamics of the Independence Number and Automata Synchronization. - Vladimir V. Gusev; Raphaël M. Jungers; Daniel Prusa (DLT, 2018)

On discriminative learning of prediction uncertainty. - Vojtech Franc; Daniel Prusa (ICML, 2019)

A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs. - Akio Fujiyoshi; Daniel Prusa (CIAA, 2019)

Two-Dimensional Pattern Matching Against Basic Picture Languages. - Frantisek Mráz; Daniel Prusa; Michael Wehar (CIAA, 2019)

Relative Interior Rule in Block-Coordinate Minimization. - Tomás Werner; Daniel Prusa (CoRR, 2019)

Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program. - Daniel Prusa; Tomás Werner (SIAM J. Optim., 2019)

Relative Interior Rule in Block-Coordinate Descent. - Tomás Werner; Daniel Prusa; Tomás Dlask (CVPR, 2020)

Complexity of Two-Dimensional Rank-Reducing Grammars. - Daniel Prusa (DCFS, 2020)

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. - Daniel Prusa; Michael Wehar (DLT, 2020)

Solvers for Mathematical Word Problems in Czech. - Jan Kadlec; Daniel Prusa (ITAT, 2020)

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. - Martin Plátek; Frantisek Mráz; Dana Pardubská; Daniel Prusa; Jirí Síma (ITAT, 2021)

Preface. - Jorma Hirvensalo; Frantisek Mráz; Daniel Prusa (Fundam. Informaticae, 2021)

Two-dimensional pattern matching against local and regular-like picture languages. - Frantisek Mráz; Daniel Prusa; Michael Wehar (Theor. Comput. Sci., 2021)

On Pumping RP-automata Controlled by Complete LRG( cent, $)-grammars. - Martin Plátek; Frantisek Mráz; Dana Pardubská; Daniel Prusa (ITAT, 2022)

Consistent and Tractable Algorithm for Markov Network Learning. - Vojtech Franc; Daniel Prusa; Andrii Yermakov (ECML/PKDD (4), 2022)

Converting nondeterministic two-way automata into small deterministic linear-time machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2022)

One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. - Frantisek Mráz; Martin Plátek; Dana Pardubská; Daniel Prusa (ITAT, 2023)

Reject option models comprising out-of-distribution detection. - Vojtech Franc; Daniel Prusa; Jakub Paplhám (CoRR, 2023)

Two-Dimensional Rank-Reducing Grammars and Their Complexity. - Daniel Prusa (J. Autom. Lang. Comb., 2023)

Optimal Strategies for Reject Option Classifiers. - Vojtech Franc; Daniel Prusa; Václav Vorácek (J. Mach. Learn. Res., 2023)

Weight-reducing Turing machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2023)

SCOD: From Heuristics to Theory. - Vojtech Franc; Jakub Paplhám; Daniel Prusa (ECCV (84), 2024)

Constrained Binary Decision Making. - Daniel Prusa; Vojtech Franc (NeurIPS, 2024)

Two-Dimensional Context-Free Grid Grammars. - Daniel Prusa (Int. J. Found. Comput. Sci., 2025)