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.

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

Horváth T., Gyimóthy T, Alexin Z., Kocsis F..  1993.  Interactive diagnosis and testing of logic programs. Third Finnish- Estonian- Hungarian Symposium on Programming Languages and Software Tools. :34-47.

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.

Csirik J, van Vliet A.  1993.  An on-line algorithm for multidimensional bin packing. Oper. Res. Lett.. 13:149–158.

Csirik J.  1993.  The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. J. Algorithms. 15:1–28.

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.

Csirik J, Frenk J.BG, Labbé M.  1993.  Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discrete Applied Mathematics. 45:197–204.

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, 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.

Paakki J., Gyimóthy T, Horváth T..  1994.  Effective Algorithmic Debugging for Inductive Logic Programming. GMD-Studien. 237:175-194.

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.

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

Jelasity M, Dombi J.  1995.  GAs, a Concept of Modeling Species in Genetic Algorithms. Artificial Evolution. 1063:69–85.

Jelasity M., Dombi J..  1995.  Gas, an approach to a solution of the niche radius problem. IEE Conference Publication. :424–429.

Bunke H, Csirik J.  1995.  An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett.. 54:93–96.

Paakki J., Gyimóthy T, Horváth T..  1995.  Independent and-parallelization of logic programs using static slicing. Fourth Symposium on Programming Languages and Software Tools. :307-319.

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.

Bunke H, Csirik J.  1995.  Parametric string edit distance and its application to pattern recognition. IEEE Trans. Systems, Man, and Cybernetics. 25:202–206.

Gyimóthy T, Paakki J..  1995.  Static Slicing of Logic Programs. AADEBUG 2nd International Workshop on Automated and Algorithmic Debugging. :85–105.