Publications

Export 262 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is B  [Clear All Filters]
1994
Schrettner L, Bohus M.  1994.  A Parallel Design Method for Producing Valid Protocols. Proc. of 8th Symposium on Microcomputer and Microprocessor Applications. :689-697.
1996
Alexin Z, Gyimóthy T, Boström H.  1996.  Integrating Algorithmic Debugging and Unfolding Transformation in an Interactive Learner. Proceedings of the European Conference on Artificial Intelligence (ECAI'96). :403-407.
Alexin Z, Gyimóthy T, Boström H.  1996.  Integrating Algorithmic Debugging and Unfolding Transformation in an Interactive Learner. Fifth International Workshop on Inductive Logic Programming. :437-452.
1997
Kókai G, Alexin Z, Gyimóthy T.  1997.  Application of inductive logic programming for learning ECG waveforms. Artificial Intelligence in Medicine. 1211:126-129.
Alexin Z, Gyimóthy T, Boström H.  1997.  IMPUT: An Interactive Learning Tool Based on Program Specialization. Intelligent Data Analysis. 1:219–244.
1998
Blázsik Z, Holló C., Imreh B.  1998.  On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybernetica. 13:319-328.
Blázsik Z, Holló C., Imreh B.  1998.  Explicit bounds for the number of feasible solutions of special PNS-problem classes. Pure Mathematics and Applications. 9:17-27.
Bilicki V.  1998.  Mobil felhasználók mobilitása. Networkshop 1998.
Bilicki V.  1998.  Mobil felhasználók mobilitásának modellezése.
1999
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.
Gyimóthy T, Beszédes Á, Forgács I.  1999.  An Efficient Relevant Slicing Method for Debugging.
Gyimóthy T, Beszédes Á, Forgács I.  1999.  An efficient relevant slicing method for debugging. SIGSOFT Softw. Eng. Notes. 24:303–321.
Beszédes Á, Ferenc R, Gyimóthy T, Magyar F, Márton G, Tarkianen M.  1999.  An Evaluation of Reverse Engineering Capabilities of the TDE/Columbus system.
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.
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.
2000
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On bottleneck and k-sum versions of the Process Network Synthesis problems. Novi Sad Journal of Mathematics. 30:11-19.
Ferenc R, Magyar F, Beszédes Á, Márton G, Tarkiainen M, Gyimóthy T.  2000.  Columbus 2.0 - Tool for Reverse Engineering Large Object Oriented Software Systems.
Beszédes Á, Szabó Z.M, Faragó C., Gyimóthy T.  2000.  Forward Computation of Dynamic Slices of C Programs.
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.
2001
Ferenc R, Magyar F, Beszédes Á, Kiss Á, Tarkiainen M.  2001.  Columbus – Tool for Reverse Engineering Large Object Oriented Software Systems. Proceedings of the Seventh Symposium on Programming Languages and Software Tools (SPLST 2001). :16-27.
Beszédes Á, Gergely Tamás, Szabó Z.M, Csirik J, Gyimóthy T.  2001.  Dynamic Slicing Method for Maintenance of Large C Programs. Proceedings of the Fifth European Conference on Software Maintenance and Reengineering (CSMR 2001). :105-113.
Blázsik Z, Holló C., Imreh C., Kovács Z.  2001.  Heuristics for the PNS problem. Optimization theory: Recent development from Mátraháza. :1-18.
Alexin Z, Leipold P, Csirik J, Bibok K, Gyimóthy T.  2001.  A Rule-Based Tagger Development Framework. :1-10.
Ferenc R, Beszédes Á, Magyar F, Gyimóthy T.  2001.  A short introduction to Columbus/CAN.
2002
Ferenc R, Beszédes Á, Tarkiainen M, Gyimóthy T.  2002.  Columbus – Reverse Engineering Tool and Schema for C++. Proceedings of the 18th International Conference on Software Maintenance (ICSM'02). :172-181.