| 2006 | CiE | Can General Relativistic Computers Break the Turing Barrier?. | Istvn Nmeti, Hajnal Andrka |
| 2006 | SOFSEM | New Physics and Hypercomputation. | Istvn Nmeti, Hajnal Andrka |
| 1989 | MFCS | On the Strength of Temporal Proofs. | Hajnal Andrka, Istvn Nmeti, Ildik Sain |
| 1985 | FCT | A unifying theorem for algebraic semantics and dynamic logics. | Hajnal Andrka, Irne Guessarian, Istvn Nmeti |
| 1981 | FCT | Some Universal Algebraic and Model Theoretic Results in Computer Science. | Hajnal Andrka, Istvn Nmeti |
| 1981 | FCT | Dynamic Algebras of Programs. | Istvn Nmeti |
| 1981 | MFCS | A Characterization of Floyd-Provable Programs. | Hajnal Andrka, Istvn Nmeti, Ildik Sain |
| 1980 | COLING | Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies. | Hajnal Andrka, Tams Gergely, Istvn Nmeti |
| 1979 | FCT | Henkin-type semantics for program-schemes to turn negative results to positive. | Hajnal Andrka, Istvn Nmeti, Ildik Sain |
| 1979 | MFCS | Completeness Problems in Verification of Programs and Program Schemes. | Hajnal Andrka, Istvn Nmeti, Ildik Sain |
| 1975 | IJCAI | On the Role of Mathematical Language Concept in the Theory of Intelligent Systems. | Hajnal Andrka, Tams Gergely, Istvn Nmeti |
| 1975 | IJCAI | Definition Theory as Basis for a Creative Problem Solver. | T. Gorgely, Hajnal Andrka, Istvn Nmeti |