Chrobak M, Csirik J, Imreh C, Noga J, Sgall J, Woeginger GJ.  2001.  The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.

Csirik J, Imreh C, Noga J, Seiden SS, Woeginger GJ.  2001.  Buying a Constant Competitive Ratio for Paging. Algorithms –- ESA 2001. :98–108.

Szilágyi G., Harmath L., Gyimóthy T..  2001.  The Debug slicing of logic programs. Acta Cybernetica. 15:257–278.

Guest E., Berry E., Baldock R.A, Fidrich M., Smith M.A.  2001.  Robust point correspondence applied to two- and three-dimensional image registration. IEEE Transactions on Pattern Analysis and Machine Intelligence. 23:165-179.

Ferenc R, Sim SElliott, Holt RC, Koschke R, Gyimóthy T.  2001.  Towards a Standard Schema for C/C++. Proceedings of the 8th Working Conference on Reverse Engineering (WCRE 2001). :49–58.

Szilágyi G, Thanos AM.  2000.  PAGELEARN: Learning Semantic Functions of Attribute Grammars in Parallel.

Szilagyi G, Gyimothy T, Maluszynski J.  2000.  Slicing of Constraint Logic Programs. Automated and Algorithmic Debugging.

Csirik J, Johnson DS, Kenyon C, Orlin JB, Shor PW, Weber RR.  2000.  On the Sum-of-squares Algorithm for Bin Packing. Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing. :208–217.

Jelasity M.  2000.  Towards Automatic Domain Knowledge Extraction for Evolutionary Heuristics. Parallel Problem Solving from Nature PPSN VI. :755–764.

Jelasity M.  2000.  Towards Automatic Domain Knowledge Extraction for Evolutionary Heuristics. Parallel Problem Solving from Nature PPSN VI. :755–764.

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.

Sloan RH, Turán G.  1999.  On Theory Revision with Queries. Proceedings of the Twelfth Annual Conference on Computational Learning Theory. :41–52.

Sloan RH, Takata K, Turán G.  1998.  On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell.. 24:193–209.

Kalmár Z, Szepesvári C, Lörincz A.  1998.  Module-Based Reinforcement Learning: Experiments with a Real Robot. Machine Learning. 31:55–85.

Szepesvári C.  1998.  Non-Markovian Policies in Sequential Decision Problems. Acta Cybern.. 13:305-318.

Alon N., Azar Y., Csirik J., Epstein L., Sevastianov S.V, Vestjens A.PA, Woeginger G.J.  1998.  On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica. 21:104–118.

Schrettner L., Gyimóthy T, Alexin Z., Tocki J..  1998.  Parallel execution of object functional queries. Annales Universitatis Scientiarum Budapestinensis de Rolando Eotvos Nominatae Sectio Computarotica. 17:339-355.

Szilágyi G., Gyimóthy T, Maluszynski J..  1998.  Slicing of Constraint Logic Programs. Linköping Electronic Articles in Computer and Information Science. 3:1-27.

Szepesvári C., Lörincz A..  1997.  Approximate Inverse-Dynamics based Robust Control using Static and Dynamic State Feedback. Applications of Neural Adaptive Control Technology. :151–197.

Szepesvári C.  1997.  The Asymptotic Convergence-Rate of Q-learning. NIPS. :1064–1070.

Quatrehomme G, Cotin S, Subsol G, Delingette H, Garidel Y, Grévin G, Fidrich M, Bailet P, Ollier A.  1997.  A Fully Three-Dimensional Method for Facial Reconstruction Based on Deformable Models. Journal of Forensic Sciences. 42:649-652.

Szepesvári C., Lörincz A..  1997.  High Precision Neurocontrol of a Chaotic Bioreactor. Nonlinear Analysis. 30:1669–1676.

Szepesvári C., Lörincz A..  1997.  Integrated Architecture for Motion-control and Path-planning. Journal of Robotic Systems. 15:1–15.

Szepesvári C.  1997.  Learning and Exploitation Do Not Conflict Under Minimax Optimality. ECML. 1224:242–249.

Sloan RH, Turán G.  1997.  Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. EuroCOLT. 1208:38–50.