Toczki J., Gyimóthy T, Jáhni G..  1988.  Implementation of a LOTOS precompiler in PROF-LP. Proceedings of the Fourth Conference of Program Designers. :31-36.

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.

Jelasity M.  1997.  A Wave Analysis of the Subset Sum Problem. ICGA. :89–96.

Jelasity M, Dombi J.  1998.  GAS, A Concept on Modeling Species in Genetic Algorithms. Artif. Intell.. 99:1–19.

Jelasity M.  1998.  UEGO, an Abstract Niching Technique for Global Optimization. PPSN. 1498:378–387.

Jelasity M., Toth B., Vinko T..  1999.  Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). 1:623-630Vol.1.

Kocsor A, A., Jr. K, László T, Márk J, László F, Tibor G, János C.  1999.  A Segment-Based Statistical Speech Recognition System for Isolated/Continuous Number Recognition. Proceedings of the 6th Fenno-Ugric Symposium on Software Technology (FUSST'99). :201-211.

Kocsor A, Tóth L, Kuba, Jr. A, Kovács K, Jelasity M, Gyimóthy T, Csirik J.  2000.  A Comparative Study of Several Feature Space Transformation and Learning Methods for Phoneme Classification. International Journal of Speech Technology. 2:263-276.

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.

Csirik J., Johnson DS, Kenyon C.  2001.  Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.

Csirik J, Johnson DS.  2001.  Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.

Ortigosa PM, García I., Jelasity M.  2001.  Reliability and Performance of UEGO, a Clustering-based Global Optimizer. Journal of Global Optimization. 19:265–289.

Jelasity M.  2001.  The shape of evolutionary search : discovering and representing search space structure.

Ortigosa P.M, García I., Jelásity M..  2001.  Two Approaches for Parallelizing the UEGO Algorithm. Optimization Theory: Recent Developments from Mátraháza. :159–177.

Jelasity M, Ortigosa PMartínez, García I.  2001.  UEGO, an Abstract Clustering Technique for Multimodal Global Optimization. Journal of Heuristics. 7:215–233.

Eiben A.E, Jelasity M..  2002.  A critical note on experimental research methodology in EC. Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600). 1:582-587vol.1.

Jelasity M., PreusB M., Van Steen M., Paechter B..  2002.  Maintaining Connectivity in a Scalable and Robust Distributed Environment. 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02). :389-394.

Jelasity M, Preuß M.  2002.  On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note). Euro-Par. 2400:573–577.

Jelasity M, Preuß M, Eiben A.E.  2002.  Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment. PPSN. 2439:172–183.

Jelasity M., Press M., Paechter B..  2002.  A scalable and robust framework for distributed applications. Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600). 2:1540-1545vol.2.

Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic computation of generalised median strings. Pattern Analysis & Applications. 6:185–193.

Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.

Kiss Á, Jász J, Lehotai G., Gyimóthy T.  2003.  Interprocedural Static Slicing of Binary Executables. Proceedings of the 3rd IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003). :118–127.