The numerical performance of algorithms can be studied using test sets or procedures that
generate such problems. This paper proposes various methods for generating linear …

Lightweight cryptography (LWC) is a compact and advancing cryptography protocol. Internet
of Things (IoT) is a cutting edge technology which is developed for resource constrained …

This paper addresses the problem of generating synthetic test cases for experimentation in
linear programming. We propose a method which maps instance generation and instance …

Cryptographic algorithms are composed of many complex mathematical functions. When
analyzing the complexity of these algorithms, one fixes priory the overall complexity of the …

A combination of evolutionary algorithms and statistical techniques is used to analyze the
worst-case computational complexity of two sorting algorithms. It is shown that excellent …

Instance generation is crucial for linear programming algorithms, especially for the
evaluation and verification of corresponding methods. This study proposes a general …

On why an algorithmic time complexity measure can be system invariant rather than system
independent - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …

Software complexity: A statistical case study through insertion sort - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Help Search My account Sign in …

This paper proposes an approximate string matching with k-mismatches when calculating
the generalized edit distance. When the edit distance is generalized, more sophisticated …

Optimisation algorithms require careful tuning and analysis to perform well in practice. Their
performance is strongly affected by algorithm parameter choices, software, and hardware …