Turán G.  1993.  Lower Bounds for PAC Learning with Queries. COLT. :384–391.

Maass W, Turán G.  1992.  Lower Bound Methods and Separation Results for On-Line Learning Models. Machine Learning. 9:107–145.

Gröger HDietmar, Turán G.  1993.  A Liniear lower bound for the size of threshold circuits. Bulletin of the EATCS. 50:220–221.

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

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

Kókai G, Csirik J, Gyimóthy T.  1997.  Learning the Syntax and Semantic Rules of an ECG Grammar. AI*IA. 1321:171–182.

Gyimóthy T, Horváth T..  1997.  Learning semantic functions of attribute grammars. Nordic J. of Computing. 4:287–302.

Horváth T, Turán G.  2001.  Learning logic programs with structured background knowledge. Artif. Intell.. 128:31–97.

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

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

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

Kókai G., Alexin Z., Gyimóthy T.  1996.  Learning Biomedical Patterns. 1314:159-168.

Tsapara I, Turán G.  1998.  Learning Atomic Formulas with Prescribed Properties. COLT. :166–174.

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