Follow
Kusper Gábor
Kusper Gábor
Eszterházy Károly University
Verified email at uni-eszterhazy.hu - Homepage
Title
Cited by
Cited by
Year
Equivalence of strongly connected graphs and black-and-white 2-SAT problems
C Biró, G Kusper
Miskolc Mathematical Notes 19 (2), 755-768, 2018
202018
Abstractive text summarization for Hungarian
ZG Yang, Á Agócs, G Kusper, T Váradi
Annales Mathematicae et Informaticae 53, 299-316, 2021
182021
Integrating temporal assertions into a parallel debugger
J Kovacs, G Kusper, R Lovas, W Schreiner
Euro-Par 2002 Parallel Processing: 8th International Euro-Par Conference …, 2002
172002
Solving the resolution-free SAT problem by submodel propagation in linear time
G Kusper
Annals of Mathematics and Artificial Intelligence 43, 129-136, 2005
132005
Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model
G Kusper, C Biró
Algorithms 13 (12), 321, 2020
92020
Analyzing web server performance models with the probabilistic model checker prism
T Bérczes, G Guta, G Kusper, W Schreiner, J Sztrik
2008-11-14). http://www. risc. jku. at/people/schreine/papers/TeT 2008. pdf …, 2008
92008
SAT solving by CSFLOC, the next generation of full-length clause counting algorithms
G Kusper, C Biró, GB Iszály
2018 IEEE International Conference on Future IoT Technologies (Future IoT), 1-9, 2018
82018
Analyzing a proxy cache server performance model with the probabilistic model checker prism
T Bérczes, G Guta, G Kusper, W Schreiner, J Sztrik
Automated Specification and Verification of Web Systems, 37, 2009
82009
Solving the SAT problem by hyper-unit propagation
G Kusper
RISC Technical Report 02-02, 1-18, University Linz, Austria, 2002
82002
BaW 1.0-A Problem Specific SAT Solver for Effective Strong Connectivity Testing in Sparse Directed Graphs
C Biró, G Kusper
2018 IEEE 18th International Symposium on Computational Intelligence and …, 2018
62018
Representing Directed Graphs as 3-SAT Problems using the Simplified Balatonboglár Model
G Kusper, C Biró, T Balla
The 11th International Conference on Applied Informatics (ICAI-2020), 2020
52020
Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle, SYNASC 2015
G Kusper, C Biró
IEEE Computer Society Press, 2015
52015
How to generate weakly nondecisive SAT instances
C Biró, G Kusper, T Tajti
2013 IEEE 11th International Symposium on Intelligent Systems and …, 2013
52013
Multi-Domain Logic and its Applications to SAT
T Jebelean, G Kusper
2008 10th International Symposium on Symbolic and Numeric Algorithms for …, 2008
52008
Comparing the performance modeling environment MOSEL and the probabilistic model checker PRISM for modeling and analyzing retrial queueing systems
T Berczes, G Guta, G Kusper, W Schreiner, J Sztrik
Technical Report 07-17, Research Institute for Symbolic Computation (RISC …, 2007
52007
Requirement Analyses and a Database Model for the Project EGERFOOD Food Safety Knowledge Center
T Radványi, G Kusper
ICAI2007, Eger Hungary, 2007
52007
Better test results for the graph coloring and the Pigeonhole Problems using DPLL with k-literal representation
G Kusper, L Csoke
Proceedings of ICAI 2, 127-135, 2007
52007
Western Canon of Software Engineering: The Abstract Principles
M Danisovszky, T Nagy, K Répás, G Kusper
Danisovszky, Maark ; Nagy, Tibor ; Raepaas, Kristaf ; Kusper, Gabor, 153-156, 2019
4*2019
Code School: Learn to code by practicing
S Király, T Balla, G Kusper
11th Joint Conference on Mathematics and Computer Science, 136-143, 2016
42016
Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle
G Kusper, C Biró
2015 17th International Symposium on Symbolic and Numeric Algorithms for …, 2015
42015
The system can't perform the operation now. Try again later.
Articles 1–20