3 citations · 6 across the 7 of their papers we have counts for
7 papers
Proceedings Tenth Symposium on Working Formal Methods
Mircea Marin, Adrian Crăciun
The 10th Working Formal Methods Symposium (FROM 2026) was held in Timişoara, Romania on September 15-17, 2026. It was organized jointly by the Faculty of Informatics of West Univer…
Enumerating All Maximal Clique-Partitions of an Undirected Graph
Mircea Marin, Temur Kutsia, Cleo Pau +1
We address the problem of enumerating all maximal clique-partitions of an undirected graph and present an algorithm based on the observation that every maximal clique-partition can…
Regular matching problems for infinite trees
Carlos Camino, Volker Diekert, Besik Dundua +2
We study the matching problem of regular tree languages, that is, "?" where are regular tree languages over the union of finite ranked alphabets $Σ…
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm
Gabriel Istrate, Cosmin Bonchis, Mircea Marin
We analyze the expected running time of WalkSAT, a well-known local search procedure for satisfiability solving, on satisfiable instances of the k-XOR SAT problem. We obtain estima…
Proceedings Third Symposium on Working Formal Methods
Mircea Marin, Adrian Crăciun
This volume contains the proceedings of FROM 2019: the Third Symposium on Working Formal Methods, held on September 3-5, 2019 in Timişoara (Romania). FROM aims to bring together re…
Learning cover context-free grammars from structural data
Mircea Marin, Gabriel Istrate
We consider the problem of learning an unknown context-free grammar when the only knowledge available and of interest to the learner is about its structural descriptions with depth…
Strategies in PRholog
Besik Dundua, Temur Kutsia, Mircea Marin
PRholog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with Rholog calculus. The rules perform nondeterministic…