You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 56, issue 1-2

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact 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.

results per page

A Simple and Scalable Algorithm for the IP Address Lookup Problem

Authors: Lee, Inbok | Park, Kunsoo | Choi, Yanghee | Chung, Sung Kwon

Article Type: Research Article

Abstract: The IP address lookup problem is to find the longest matching IP prefix from a routing table for a given IP address and it has been a central bottleneck in speeding up the Internet. In this paper we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm does the IP address lookup in O(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without … Show more

Keywords:

Citation: Fundamenta Informaticae, vol. 56, no. 1-2, pp. 181-190, 2003

Price: EUR 27.50

Compact Suffix Array — A Space-Efficient Full-Text Index

Authors: Mäkinen, Veli

Article Type: Research Article

Abstract: Suffix array is a widely used full-text index that allows fast searches on the text. It is constructed by sorting all suffixes of the text in the lexicographic order and storing pointers to the suffixes in this order. Binary search is used for fast searches on the suffix array. Compact suffix array is a compressed form of the suffix array that still allows binary searches, but the search times are also dependent on the compression. In this paper, we give efficientmethods for constructing and querying compact suffix arrays. We also study practical issues, such as the trade off between compression … Show more

Keywords: Suffix array, index compression, full-text index, string matching

Citation: Fundamenta Informaticae, vol. 56, no. 1-2, pp. 191-210, 2003

Price: EUR 27.50
Show more