Hamann L, Vidács L, Gogolla M, Kuhlmann M.  2012.  Abstract Runtime Monitoring with USE. Proceedings of CSMR 2012 (16th European Conference on Software Maintenance and Reengineering). :549-552.

Vidács L, Dévai R, Ferenc R, Gyimóthy T.  2012.  Developer Support for Understanding Preprocessor Macro Expansions. Proceedings of International Conference on Advanced Software Engineering & Its Applications (ASEA 2012). 340:121-130.

Fülöp LJenő, Tóth G, Vidács L, Beszédes Á, Demeter H, Farkas L, Gyimóthy T, Balogh G.  2012.  Predictive Complex Event Processing: A conceptual framework for combining Complex Event Processing and Predictive Analytics. Proceedings of Fifth Balkan Conference in Informatics (BCI 2012). :26-31.

Nagy C, Vidács L, Ferenc R, Gyimóthy T, Kocsis F, Kovács I.  2011.  Complexity Measures in 4GL Environment. Computational Science and Its Applications - ICCSA 2011, Lecture Notes in Computer Science. 6786:293-309.

Nagy C, Vidács L, Ferenc R, Gyimóthy T, Kocsis F, Kovács I.  2011.  Solutions for Reverse Engineering 4GL Applications, Recovering the Design of a Logistical Wholesale System. Proceedings of CSMR 2011 (15th European Conference on Software Maintenance and Reengineering). :343-346.

Tóth G, Fülöp LJenő, Vidács L, Beszédes Á, Demeter H, Farkas L, Gyimóthy T.  2010.  Complex event processing synergies with predictive analytics.

Nagy C, Vidács L, Ferenc R, Gyimóthy T, Kocsis F, Kovács I.  2010.  MAGISTER: Quality assurance of Magic applications for software developers and end users. Software Maintenance (ICSM), 2010 IEEE International Conference on. :1-6.

Vidács L, Beszédes Á, Gyimóthy T.  2009.  Combining preprocessor slicing with C/C++ language slicing. Science of Computer Programming. 74:399-413.

Vidács L.  2009.  Refactoring of C/C++ Preprocessor Constructs at the Model Level. Proceedings of ICSOFT 2009, 4th International Conference on Software and Data Technologies. :232-237.

Vidács L.  2009.  Refactoring of C/C++ Preprocessor Constructs at the Model Level. Proceedings of ICSOFT 2009, 4th International Conference on Software and Data Technologies. :232-237.

Vidács L.  2009.  Software Maintenance Methods for Preprocessed Languages.

Vidács L.  2009.  Software Maintenance Methods for Preprocessed Languages.

Vinkó T, Ratz D.  2004.  A Multidimensional Branch-and-Prune Method for Interval Global Optimization. Numerical Algorithms. 37:391–399.

Vidács L, Beszédes Á.  2003.  Opening Up The C/C++ Preprocessor Black Box. Proceedings of the Eight Symposium on Programming Languages and Software Tools (SPLST’03). :45-57.

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.

Vicsi K, Tóth L, Kocsor A, Gordos G, Csirik J.  2002.  MTBA - magyar nyelvû telefonbeszéd-adatbázis. Híradástechnika. LVII:35-39.

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.

Alon N., Azar Y., Csirik J., Epstein L., Sevastianov S.V, Vestjens A.PA, Woeginger G.J.  1998.  On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica. 21:104–118.

Turán G, Vatan F.  1997.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.

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

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, Vatan F.  1994.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS. :553–564.

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