Please see this page for a more complete list of preprints, including preprint versions of published papers (when available). The list here strictly includes those in print (or that have already appeared)
2016:
 Gabriel Istrate, Cosmin Bonchiş. Heapability, interactive particle systems, partial orders: results and open problems, Proceedings of the 18th International Conference on Descriptive Complexity of Formal Systems (DCFS’2016), Lecture Notes in Computer Science, vol. 9777, pp. 1828, Springer Verlag, 2016.
 B. Dundua, M. Florido, T. Kutsia and M. Marin. CLP(H): Constraint logic programming for hedges. Theory and Practice of Logic Programming, 16, pp 141162.
 Gabriel Istrate, Cosmin Bonchiş, Liviu P. Dinu. The Minimum Entropy Submodular Set Cover Problem. In Proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA’ 2016), pp. 295306. Lecture Notes in Computer Science, vol. 9618, Springer Verlag , 2016.
 Mircea Marin, Temur Kutsia and Besik Dundua. A rewritebased computational model for functional logic programming. In Proceedings of SCSS 2016, The 7th International Symposium on Symbolic Computation in Software Science. EasyChair Proceedings in Computing (EPiC) (to appear) 2016.
2015:
 James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun and Gabriel Istrate. Short Proofs of the KneserLovász Coloring Principle. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , Lecture Notes in Computer Science vol. 9135, pp. 4455. 2015.
• Gabriel Istrate, Cosmin Bonchis. Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley’s process. In Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM’ 2015), Lecture Notes in Computer Science 9133, pp. 261271. Springer Verlag, 2015. 
Temur Kutsia, Mircea Marin Regular expression ordersorted unification and matching. J. Symbolic Computation 67: 4267 (2015)
 Gabriel Istrate. Reachability and Recurrence in a Modular Generalization of Annihilating Random Walks (and lightsout games) to hypergraphs. Theoretical Computer Science (available online as Article in Press), 2015.
 Gabriel Istrate. Identifying almostsorted permutations from TCP buffer dynamics. Scientific Annals of Computer Science (special issue dedicated to professor Sergiu Rudeanu’ s 80th birthday), XXV (1), pp. 133154, 2015.
2014:
 Mircea Marin and Gabriel Istrate. Learning cover contextfree grammars from structural data. In Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing, (ICTAC’14). Springer Verlag, Lecture Notes in Computer Science, 2014. Journal version appeared in a special issue of Scientific Annals of Computer Science 24(2) 253286 (2014)
 Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin. Constraint Logic Programming for Hedges: A Semantic Reconstruction. FLOPS 2014, 285301
2012:
 Gabriel Istrate, Madhav V. Marathe and S. S. Ravi. Adversarial scheduling in discrete models of social dynamics. Mathematical Structures in Computer Science, 22(5), pp. 788815, 2012.

Temur Kutsia, Mircea Marin. Solving, Reasoning, and Programming in Common Logic. SYNASC 2012: 119126
 Gabriel Istrate. Review of Handbook of largescale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós. SIGACT News 43(2): 2528 (2012)