MTBA - magyar nyelvû telefonbeszéd-adatbázis. Híradástechnika. LVII:35-39.. 2002.
On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note). Euro-Par. 2400:573–577.. 2002.
Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment. PPSN. 2439:172–183.. 2002.
Recognizing Design Patterns in C++ programs with the integration of Columbus and Maisa. Acta Cybernetica. 15:669-682.. 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.. 2002.
Static and Dynamic Slicing of Constraint Logic Programs. Automated Software Engineering. 9:41–65.. 2002.
Theory Revision with Queries: DNF Formulas. Machine Learning. 47:257–295.. 2002.
Union slices for program maintenance. International Conference on Software Maintenance, 2002. Proceedings.. :12-21.. 2002.
Various Hyperplane Classifiers Using Kernels Feature Spaces. Conference of PhD students on Computer Sciences, Volume of Extended Abstracts. :63.. 2002.
Various Robust Search Methods in a Hungarian Speech recognition System. Conference of PhD students on Computer Sciences, Volume of Extended Abstracts. :35.. 2002.
XML Semantics Extension. Acta Cybern.. 15:509–528.. 2002.
Application of Feature Transformation and Learning Methods in Phoneme Classification. Engineering of Intelligent Systems : 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2001, LNAI vol. 2070. :502-512.. 2001.
Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.. 2001.
Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.. 2001.
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.. 2001.
Buying a Constant Competitive Ratio for Paging. Algorithms –- ESA 2001. :98–108.. 2001.
Columbus – Tool for Reverse Engineering Large Object Oriented Software Systems. Proceedings of the 7th Symposium on Programming Languages and Software Tools (SPLST 2001). :16–27.. 2001.
The Debug slicing of logic programs. Acta Cybernetica. 15:257–278.. 2001.
Fast Independent Component Analysis in Kernel Feature Spaces. SOFSEM 2001: Theory and Practice of Informatics: 28th Conference on Current Trends in Theory and Practice of Informatics, LNAI vol. 2234. :271-281.. 2001.
Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem. Optimization Theory: Recent Developments from Mátraháza. :19–31.. 2001.
Learning logic programs with structured background knowledge. Artif. Intell.. 128:31–97.. 2001.
A Nonlinearized Discriminant Analysis and its Application to Speech Impediment Therapy. Text, Speech and Dialogue : 4th International Conference, TSD 2001, LNAI vol. 2166. :249-257.. 2001.
An Optimization Based Algorithm for Determining Eigenpairs of Large Real Matrices. ANNALES UNIVERSITATIS SCIENTIARUM BUDAPESTINENSIS DE ROLANDO EÖTVÖS NOMINATAE SECTIO COMPUTATORICA. 20:237-253.. 2001.
Recognizing Design Patterns in C++ programs with the integration of Columbus and Maisa. Proceedings of the 7th Symposium on Programming Languages and Software Tools (SPLST 2001). :58–70.. 2001.