arXiv subjects

Rares Folea

Publications and source records attributed to Rares Folea.

4 recordsLinked to original sources

arXiv2026

Properties of calculus in r-Complexity 2025

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 algorithms. This research describes characteristics such as reflexivity, transitivity, or symmetry and discusses several conversion rules between different classes of r-Complexity, as well as establishing fundamental arithmetic principles. The work also examines the behaviour of the addition property within this system and compares its characteristics with those frequently used in the traditional Bachmann-Landau notation. Through utilizing these properties, this research seeks to promote the exploration and development of novel applications for r-Complexity, as well as accelerating the adoption rate of calculus in this refined complexity model.

cs.CC↗

arXiv2026

Complexity-based code embeddings

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 against different inputs and by tailoring multiple generic complexity functions for the analysed metrics. The used algorithms embeddings are based on r-Complexity . Using the proposed code embeddings, we present an implementation of the XGBoost algorithm that achieves an average F1-score on a multi-label dataset with 11 classes, built using real-world code snippets submitted for programming competitions on the Codeforces platform.

cs.LG↗

arXiv2026

On Plagiarism and Software Plagiarism

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 open-source software solution for detecting code similarity. This research enumerates some of the existing approaches to counter software plagiarism by examining both the academia and legal landscape, including notable lawsuits and court rulings that have shaped the understanding of software copyright infringements in commercial applications. Furthermore, we categorize the classes of detection challenges based on the available artifacts, and we provide a survey of the previously studied techniques in the literature, including solutions based on fingerprinting, software birthmarks, or code embeddings, and exemplify how a subset of them can be applied in the context of Project Martial.

cs.SE↗

arXiv2025

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

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 Bachmann-Landau notation, providing subtle insights even for algorithms that are part of the same conventional complexity class. The architecture-dependent metric represents an enhancement that provides better sensitivity with respect to discrete analysis.

cs.CC↗