Fault Tolerance for Cluster Computing Based on Functional Tasks. - Wolfgang Schreiner; Gábor Kusper; Károly Bósa (Euro-Par, 2001)

Integrating Temporal Assertions into a Parallel Debugger. - József Kovács; Gábor Kusper; Róbert Lovas; Wolfgang Schreiner (Euro-Par, 2002)

Solving the resolution-free SAT problem by submodel propagation in linear time. - Gábor Kusper (Ann. Math. Artif. Intell., 2005)

Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model. - Gábor Kusper (KI, 2006)

Multi-Domain Logic and its Applications to SAT. - Tudor Jebelean; Gábor Kusper (SYNASC, 2008)

Metamodels in generation of UML using NLI-based dialog. - László Kovács; Gergely Kovásznai; Gábor Kusper (SACI, 2009)

How to generate weakly nondecisive SAT instances. - Csaba Biró; Gábor Kusper; Tibor Tajti (SISY, 2013)

Adaption of NNS classification to domain of category values. - László Kovács; Gábor Kusper (SISY, 2013)

Integration opportunities of the 'CommonSense for Scholars' system at the University of Debrecen. - Gábor Kusper; Nikolett Fanni Menyhart; Gabor Percze; Havasi Gabor (CogInfoCom, 2015)

Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle. - Gábor Kusper; Csaba Biró (SYNASC, 2015)

A novel data storage logic in the cloud. - Bence Mátyás; Máté Szarka; Gábor Járvás; Gábor Kusper; István Argay (F1000Research, 2016)

Western Canon of Software Engineering: The Abstract Principles. - Márk Danisovszky; Tibor Nagy; Kristóf Répás; Gábor Kusper (CogInfoCom, 2019)

Cognitive Code Quality Improvement with Pattern Recognition and Recommendation by Examples. - Márk Danisovszky; Attila Adamkó; Imre Baják; Krisztian Kusper; Szabolcs Marien; Gábor Kusper (CogInfoCom, 2020)

The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs. - Tamás Balla; Csaba Biró; Gábor Kusper (ICAI, 2020)

Classification of SAT Problem Instances by Machine Learning Methods. - Márk Danisovszky; Zijian Gyozo Yang; Gábor Kusper (ICAI, 2020)

Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems. - Gábor Kusper; Csaba Biró; Tamás Balla (SACI, 2020)

Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs. - Gábor Kusper; Tamás Balla; Csaba Biró; Tibor Tajti; Zijian Gyozo Yang; Imre Baják (SYNASC, 2020)

Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model. - Gábor Kusper; Csaba Biró (Algorithms, 2020)

Experiments with Automated Reasoning in the Class. - Isabela Dramnesc; Erika Ábrahám; Tudor Jebelean; Gábor Kusper; Sorin Stratulat (CICM, 2022)

A Case Study in Building 2D Maps with Robots. - Theodor-Radu Grumeza; Thomas-Andrei Lazar; Isabela Dramnesc; Gábor Kusper; Konstantinos Papadopoulos 001; Nikolaos Fachantidis; Ioannis Lefkos (ICINCO (2), 2024)

A European Project on AI-based Robotics. - Isabela Dramnesc; Erika Ábrahám; Tudor Jebelean; Nikolaos Fachantidis; Gábor Kusper; Sorin Stratulat (TALE, 2024)