Horváth T, Sloan RH, Turán G.  1997.  Learning Logic Programs by Using the Product Homomorphism Method. COLT. :10–20.

Turán G, Vatan F.  1997.  Linear decision lists and partitioning algorithms for the construction of neural networks. Foundations of Computational Mathematics. :414–423.

Angluin D, Krikis M, Sloan RH, Turán G.  1997.  Malicious Omissions and Errors in Answers to Membership Queries. Machine Learning. 28:211–255.

Szepesvári C, Cimmer S, Lörincz A.  1997.  Neurocontroller using dynamic state feedback for compensatory control. Neural Networks. 10:1691–1708.

French M., Szepesvari C., Rogers E..  1997.  Uncertainty, performance, and model dependency in approximate adaptive nonlinear control. Proceedings of the 36th IEEE Conference on Decision and Control. 3:3046-3051vol.3.

Szepesvári C, Lörincz A.  1996.  Approximate geometry representations and sensory fusion. Neurocomputing. 12:267–287.

Littman ML, Szepesvári C.  1996.  A Generalized Reinforcement-Learning Model: Convergence and Applications. ICML. :310–318.

Horváth T, Sloan RH, Turán G.  1996.  Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop. 1314:315–336.

Fomin T, Rozgonyi T, Szepesvári C, Lörincz A.  1996.  Self-Organizing Multi-Resolution Grid for Motion Planning and Control. Int. J. Neural Syst.. 7:757.

Schrettner L., Gyimóthy T, Alexin Z., Toczki J..  1995.  Parallel execution of object functional queries. Fourth Symposium on Programming Languages and Software Tools. :447-459.

Sloan RH, Turán G.  1994.  Learning with Queries but Incomplete Information (Extended Abstract). COLT. :237–245.

Szepesvári C, Lörincz A.  1993.  Behavior of an Adaptive Self-organizing Autonomous Agent Working with Cues and Competing Concepts. Adaptive Behaviour. 2:131–160.

Hajnal A, Maass W, Pudlák P, Szegedy M, Turán G.  1993.  Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci.. 46:129–154.

Maass W, Schnitger G, Szemerédi E, Turán G.  1993.  Two Tapes Versus One for Off-Line Turing Machines. Computational Complexity. 3:392–401.

Maass W, Schnitger G, Szemerédi E, Turán G.  1993.  Two Tapes Versus One for Off-Line Turing Machines. Computational Complexity. 3:392–401.

Faigle U, Schrader R, Turán G.  1992.  The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.

Fritzson P., Shahmehri N., Kamkar M., Gyimóthy T.  1992.  Generalized algorithmic debugging and testing. ACM Lett. Program. Lang. Syst.. 1:303–322.

Gyimóthy T, Alexin Z., Szűcs R..  1992.  Integrated Graphic Enviroment to Develop Applications Based on Attribute Grammars. Lecture Notes in Computer Science. 641:51-58.

Fritzson P, Gyimóthy T, Kamkar M, Shahmehri N.  1991.  Generalized Algorithmic Debugging and Testing. PLDI. :317–326.

Toczki J., Simon E., Garai T., Kocsis T., Gyimóthy T.  1986.  Automatic compiler generation. Proceedings of 1st Symposium on Automata, Languages and Programming Systems. :289-297.

Gyimóthy T, Simon E., Makay Á..  1983.  An implementation of the HLP. Acta Cybernetica - Szeged. 6:315-327.