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 82, 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

High-Performance Reversible Data Hiding

Authors: Lin, Ching-Chiuan | Hsueh, Nien-Lin | Shen, Wen-Hsiang

Article Type: Research Article

Abstract: This paper proposes a high-performance reversible data hiding algorithm based on the block difference histogram of a cover image. If a message is to be embedded into an image, the difference of the block at the maximum point is increased by 1 or left unchanged if the message bit is "1" or "0", respectively. Experimental results show that the average payload capacity of the test images can be up to 1.52 bits per pixel (bpp). Average … Show more

Keywords: Reversible data hiding, lossless watermark, steganography

Citation: Fundamenta Informaticae, vol. 82, no. 1-2, pp. 155-169, 2008

Price: EUR 27.50

Classes of Timed Automata and the Undecidability of Universality

Authors: Moura, Arnaldo V. | Pinto, Guilherme A.

Article Type: Research Article

Abstract: Universality for deterministic Timed Büchi Automata (TBA) is PSPACE-complete but becomes highly undecidable when unrestricted nondeterminism is allowed. More precisely, universality for nondeterministic TBA is Π^1_1 -hard and its precise position in the analytical hierarchy is still an open question. In this paper we introduce two types of syntactical restrictions to nondeterministic TBA, which are of independent interest, and show that their universality problem is Π^1_1 -complete. These restrictions define, … Show more

Keywords: Timed Automata, Universality, Analytical Hierarchy

Citation: Fundamenta Informaticae, vol. 82, no. 1-2, pp. 171-184, 2008

Price: EUR 27.50

Information in a Two-Stage Decision Process. General Idea and Classification

Authors: Terlikowski, Tomasz

Article Type: Research Article

Abstract: We introduce the notion of information in a two-stage decision process. We begin by examining the general scheme of a two-stage control problem. The final aim is to give a precise, formal definition of what we mean as information within a decision process.

Keywords: two-stage decision process, variant, informational relation, team, canonical team, objective information, deterministic information

Citation: Fundamenta Informaticae, vol. 82, no. 1-2, pp. 185-212, 2008

Price: EUR 27.50
Show more