Gyimóthy T, Beszédes Á, Forgács I.
1999. An efficient relevant slicing method for debugging. SIGSOFT Softw. Eng. Notes. 24:303–321.
Page last modified: May 17, 2012
Harmath L, Szilágyi G., Gyimóthy T, Csirik J.
1999. Dynamic Slicing of Logic Programs: Program analysis and verification. The Sixth Fenno-Ugric Symposium on Software Technology. :101-113.
Page last modified: January 16, 2012
Lakner T, Kozma L, Gyimóthy T.
1999. A Compiler-Generator Based on the {Pred-LL(k)} Parsing Method. Proceedings of Program Analsysis and verification, Fenno-Ugric Symposium. :41-50.
Page last modified: January 16, 2012
Gyimóthy T, Beszédes Á, Forgács I.
1999. An Efficient Relevant Slicing Method for Debugging.
Page last modified: January 16, 2012
Holló C., Blázsik Z, Imreh C., Kovács Z.
1999. On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybernetica. 14:251-261.
Page last modified: January 16, 2012
Gyimóthy T, Beszédes Á, Forgács I.
1999. An Efficient Relevant Slicing Method for Debugging. Proceedings of the Joint 7th European Software Engineering Conference and 7th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (ESEC/FSE'99). :303-321.
Page last modified: September 26, 2019
Szilágyi G., Gyimóthy T, Maluszynski J.
2000. Slicing of Constraint Logic Programs. AADEBUG.
Page last modified: January 16, 2012
Kocsor A, Tóth L, Kuba A, Kovács K, Jelasity M, Gyimóthy T, Csirik J.
2000. A Comparative Study of Several Feature Transformation and Learning Methods for Phoneme Classification. International Journal of Speech Technology. 3:263-276.
Page last modified: January 16, 2012
Blázsik Z, Holló C., Imreh B.
1999. Kiszámolható korlátok speciális {PNS}-problémaosztályok lehetséges megoldásainak a számára. :182-194.
Page last modified: January 22, 2012
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.
2000. On a well solvable class of the {PNS} problem. Novi Sad Journal of Mathematics. 30:21-30.
Page last modified: January 16, 2012