4 citations · 6 across the 4 of their papers we have counts for
4 papers
Properties of calculus in r-Complexity 2025
Rares Folea, Emil Slusanschi
This paper presents a series of general properties of the r-Complexity calculus, a complexity measurement for assessing the performance and asymptotic behaviour of real-world algor…
Complexity-based code embeddings
Rares Folea, Radu Iacob, Emil Slusanschi +1
This paper presents a generic method for transforming the source code of various algorithms to numerical embeddings, by dynamically analysing the behaviour of computer programs aga…
On Plagiarism and Software Plagiarism
Rares Folea, Emil Slusanschi
This paper explores the complexities of automatic detection of software similarities, in relation to the unique challenges of digital artifacts, and introduces Project Martial, an…
A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
Rares Folea, Emil-Ioan Slusanschi
This paper presents a refined complexity calculus model: r-Complexity, a new asymptotic notation that offers better complexity feedback for similar programs than the traditional Ba…