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

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.

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

Turán G, Vatan F.  1996.  A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett.. 59:251–254.

Turán G.  1995.  On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.

Fidrich M, Thirion J-P.  1995.  Multiscale Extraction of Features from Medical Images. CAIP. 970:637–642.

Fidrich M, Thirion J-P.  1995.  Multiscale Representation and Analysis of Features from Medical Images. CVRMed. 905:358–364.

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.

Maass W, Turán G.  1994.  Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. Machine Learning. 14:251–269.

Turán G, Vatan F.  1994.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS. :553–564.

Maass W, Turán G.  1994.  How fast can a threshold gate learn? in "computational learning theory and natural learning systems:

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

Blázsik Z, Hujter M, Pluhár A, Tuza Z..  1993.  Graphs with no induced C4 and 2K2. Discrete Mathematics. 115:51–55.

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.  1993.  Lower Bounds for PAC Learning with Queries. COLT. :384–391.

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.

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

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

Toczki J, Kocsis F, Gyimóthy T, Dányi G., Kókai G.  1990.  SYS/3 - A Software Development Tool. CC. 477:193–207.

Toczki J., Gyimóthy T, Horváth T., Kocsis F..  1989.  Generating modular compilers in PROF-LP. Proceedings of the Workshop on Compiler Compilers and High Speed Compilation. :156-166.

Toczki J., Gyimóthy T, Kocsis F..  1989.  SYS-DL, a system development language supporting software quality assurance. First Finnish-Hungarian Workshop on Programming Languages and Software Tools. :307-317.

Toczki J., Gyimóthy T, Kocsis F., Horváth T..  1988.  Automatic Software Generation in Practice: New Features in the HLP/PAS System. Specialized Languages as Tools for Programming Technology. :103–119.