Dynamic dictionary with conditional perfectly balanced binary search
International Journal on Information Technologies and Security · 01.06.2026 · 18 (2) · 35-46
DOI: 10.59035/sbee8343 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal on Information Technologies and Security, online erschienen am 01.06.2026. Verfasst von Vladislav Vasilev und 1 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper we derived a novel dynamic dictionary set of algorithms that support perfectly balanced binary searches asymptotically. The dynamic dictionary is part of our FSP_vgv open-source C# package that aims to implement a portable version of Octave/Matlab in order to enable faster iterative design. Our package does not attempt to outdate other software, but fills specialized needs listed in this work. By processing the version control commit history of the FSP_vgv package we validate empirically that with unknown research horizon the time spent developing grows exponentially in the volume of production code. We identify an exponential growth parameter related to how intuitive a programming language is which also controls the research time hence proving the need for highly intuitive and portable languages.
Zitieren
APA
Vasilev, V., & Iliev, G. (2026). Dynamic dictionary with conditional perfectly balanced binary search. International Journal on Information Technologies and Security, 18(2), 35-46. https://doi.org/10.59035/sbee8343
Vancouver
Vasilev V, Iliev G. Dynamic dictionary with conditional perfectly balanced binary search. International Journal on Information Technologies and Security. 2026;18(2):35-46. doi:10.59035/sbee8343
BibTeX
@article{Vasilev2026,
author = {Vasilev, Vladislav and Iliev, Georgi},
title = {Dynamic dictionary with conditional perfectly balanced binary search},
journal = {International Journal on Information Technologies and Security},
year = {2026},
volume = {18},
number = {2},
pages = {35--46},
doi = {10.59035/sbee8343}
}
EUVIMED