Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Home Topics Titles Quotes Blog Featured Help
Balint Molnar
Eötvös Loránd University of Budapest
Budapest, Hungary

Bálint Molnár is an associate professor at Eötvös Loránd University’s Faculty of Informatics in Budapest, Hungary. He teaches courses on methodologies of information systems development, enterprise resource planning (ERP), integrated systems, web technologies for enterprise information systems, and service science.

Bálint’s research areas include formal and mathematical methods for information systems modeling, ERP systems, complex information systems, business process modeling, the semantic web, enterprise architectures, service-oriented architecture (SOA), service science, and the application of data science methods to the world of information systems. He participates in research projects at the university and supervises several doctoral students. His work on information systems and their formal modeling led to the introduction of hypergraphs and homology into the formal modeling of business processes and information system architecture.

Bálint has published more than 250 papers and serves on the editorial boards for the Electronic Journal of Information Systems Evaluation and the European Journal of Applied Economics. He is a regular reviewer for several scientific conferences and journals, including the Conference on Enterprise Information Systems (CENTERIS), Journal of Computing and Information Technology (CIT), and IEEE Access, and a member of many professional organizations (János Bolyai Mathematical Society, John von Neumann Computer Society, ISACA, the ACM). He formerly worked as a consultant and project manager in the Hungarian Public Administration.

Bálint has been a reviewer for Computing Reviews since 2014. He has written more than 50 reviews.


Algorithms for constructing computably enumerable sets
Supowit K., Springer International Publishing, Cham, Switzerland, 2023. 183 pp.  Type: Book (9783031269035)

Computational complexity (historically called recursive functions in logic) is a very specific area of computational theory, and even within this domain the book discusses a very specific subfield: the theoretical construction of enumerable sets.<...


Quick start guide to large language models: strategies and best practices for using ChatGPT and other LLMs
Ozdemir S., Pearson, Hoboken, NJ, 2023. 288 pp.  Type: Book (0138199191)

This book is devoted to the hot topics of large language models (LLMs) and generative artificial intelligence (AI). It can be considered as a guidebook that introduces readers to the realm of natural language processing (NLP) by exploiting open-so...


Simple type theory: a practical logic for expressing and reasoning about mathematical ideas
Farmer W., BIRKHAUSER, Basel, Switzerland, 2023. 312 pp.  Type: Book (3031211138)

The book is an introduction to one of the dialects of type theory. All type theories are grounded in logic. The promise of simple type theory is that it can be understood and handled much easier than other versions of type theory, for example, dep...


Artificial intelligence: an introduction for the inquisitive reader
Chen R., Chen C., CRC Press, Boca Raton, FL, 2022. 344 pp.  Type: Book (978-1-032103-47-1)

Chen and Chen present a comprehensive overview of the past decades from a computer science (CS) and artificial intelligence (AI) point of view. The book is not a scientific or technical/technology elaboration since a part of it, or more exactly se...


Deep learning for cognitive computing systems: technological advancements and applications
Sumithra M., Dhanaraj R., Iwendi C., Manoharan A., DE GRUYTER, Berlin, Germany, 2022. 300 pp.  Type: Book (3110750503)

Deep learning for cognitive computing systems is a bird’s-eye view of deep learning and the neighboring, whether loosely or strongly coupled, areas. It is a collection of several authors’ publications....


Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy