Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact Factor 2024: 0.4
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.
Authors: Koprowski, Przemysław
Article Type: Research Article
Abstract: We present an explicit algorithmic method for computing square roots in quaternion algebras over global fields of characteristic different from 2.
Keywords: square root computation, quaternion algebra, number fields, global fields
DOI: 10.3233/FI-222163
Citation: Fundamenta Informaticae, vol. 190, no. 1, pp. 1-15, 2022
Authors: Mhaskar, Neerja | Smyth, W.F.
Article Type: Research Article
Abstract: The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one potential compaction methodology, the cover of a given string x , initially proposed in a simple form in 1990, but increasingly of interest as more sophisticated variants have been discovered. We then consider covering by a seed ; that is, a cover of a superstring of x . We conclude with many proposals for research directions that could make significant …contributions to string processing in future. Show more
Keywords: strings, quasiperiodicity, covers, seeds
DOI: 10.3233/FI-222164
Citation: Fundamenta Informaticae, vol. 190, no. 1, pp. 17-45, 2022
Authors: Musawi, Seyed Reza | Nazari, Esmaeil
Article Type: Research Article
Abstract: The Knödel graph W Δ,n is a Δ-regular bipartite graph on n ≥ 2Δ vertices where n is an even integer. In this paper We obtain some results about the distances of two vertices in the Knödel graphs and by them, we prove that diam ( W Δ , n ) = 1 + ⌈ n − 2 2 Δ − 2 ⌉ , where Δ ≥ 2 and n ≥ (2Δ – 5)(2Δ – 2) + 4.
Keywords: Knödel Graph, distance, diameter
DOI: 10.3233/FI-222165
Citation: Fundamenta Informaticae, vol. 190, no. 1, pp. 47-62, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]