International Journal of Foundations of Computer Science (INT J FOUND COMPUT S)

Publisher: World Scientific Publishing

Journal description

The International Journal of Foundations of Computer Science publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: Algebraic theory of computing and formal systems, Analysis and design of algorithms, Automata and formal languages, Categories in computer science, Combinatorics, Complexity theory, Computational biology and DNA computing, Computer theorem proving, Concurrency, Constructive logic, Crytography, Database theory, Logic and semantics of programs, Logic in artificial intelligence, Logic programming, Models of computation, Program verification and synthesis, Proof and specification in computer science, Quantum computing, Theories and models of internet computing, Theory of learning and inductive inference, Theory of parallel and distributed computing, and Type theory.

Current impact factor: 0.30

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2014 Impact Factor 0.296
2013 Impact Factor 0.326
2012 Impact Factor 0.42
2011 Impact Factor 0.379
2010 Impact Factor 0.459
2009 Impact Factor 0.512
2008 Impact Factor 0.554
2007 Impact Factor 0.656
2006 Impact Factor 0.5

Impact factor over time

Impact factor

Additional details

5-year impact 0.39
Cited half-life 7.80
Immediacy index 0.00
Eigenfactor 0.00
Article influence 0.25
Website International Journal of Foundations of Computer Science website
Other titles International journal of foundations of computer science (Online), Foundations of computer science
ISSN 0129-0541
OCLC 47442835
Material type Document, Periodical, Internet resource
Document type Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details

World Scientific Publishing

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author cannot archive a post-print version
  • Restrictions
    • 12 months embargo
  • Conditions
    • Author's pre-print on any website or open access repository
    • Author's post-print on author's personal website, institutional repository, subject repository or funding agency designated repository
    • Publisher's version/PDF cannot be used
    • Set statement to accompany pre-print and authors post-print - see policy
    • Must link to publisher version with DOI
  • Classification
    ​ yellow

Publications in this journal

  • International Journal of Foundations of Computer Science 08/2015; 26(05):iii-iii. DOI:10.1142/S0129054115010017
  • International Journal of Foundations of Computer Science 08/2015; 26(05):625-642. DOI:10.1142/S0129054115500355
  • International Journal of Foundations of Computer Science 08/2015; 26(05):599-609. DOI:10.1142/S0129054115500331
  • [Show abstract] [Hide abstract]
    ABSTRACT: A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set's complement. The use of symmetric representation is shown to be important when studying the time complexity of algorithms. A symmetric data structure called a flip list is defined, and it is employed for the Clique, Independent Set, and Vertex Cover problems in a case study. The classic reductions among these problems require the complement of either a graph's edge set or a subset of its vertices. Flip lists can be complemented in constant time with no increase in space. When a flip list is used to represent the edge set of a graph, Clique, Independent Set, and Vertex Cover are shown to have identical (and strongly exponential) time complexity when the classical complexity parameter of input length is used. On the other hand, when a flip list is used to represent a set of numbers as input for the Partition problem, an algorithm can be built that retains strongly sub-exponential time complexity. This provides new evidence with respect to which NP- complete problems should be classified as sub-exponential. Symmetric representation has the advantage of space efficiency, at most linear-time and space complement operations, and symmetry in representing sparse and dense sets. These features can have a significant impact on complexity studies.
    International Journal of Foundations of Computer Science 08/2015; 26(05):557-581. DOI:10.1142/S0129054115500318
  • International Journal of Foundations of Computer Science 08/2015; 26(05):611-624. DOI:10.1142/S0129054115500343
  • International Journal of Foundations of Computer Science 08/2015; 26(05):643-666. DOI:10.1142/S0129054115500367
  • International Journal of Foundations of Computer Science 08/2015; 26(05):583-598. DOI:10.1142/S012905411550032X
  • [Show abstract] [Hide abstract]
    ABSTRACT: Given a graph G=(V,E) and two positive integers j and k, an L(j,k)-edge-labeling is a function f assigning to edges of E colors from a set {0,1,…,Kf} such that |f(e)-f(e')|≥j if e and e′ are adjacent, i.e. they share a common endpoint, |f(e)-f(e')|≥k if e and e′ are not adjacent and there exists an edge adjacent to both e and e′. The aim of the L(j,k)-edge-labeling problem consists of finding a coloring function f such that the value of kf is minimum. This minimum value is called λj,k′(G). This problem has already been studied on hexagonal, squared and triangular grids, but mostly not coinciding upper and lower bounds on λj,k′ have been proposed. In this paper we close some of these gaps or find better bounds on λj,k′ in the special cases j=1,2 and k=1. Moreover, we propose tight L(j,k)-edge-labelings for eight-regular grids.
    International Journal of Foundations of Computer Science 06/2015; 26(04):523-535. DOI:10.1142/S012905411550029X
  • [Show abstract] [Hide abstract]
    ABSTRACT: It is known that deciding whether or not a team in a soccer tournament in progress can still win or, more generally, can obtain a certain position is NP-complete. We show that deciding whether or not a team is guaranteed a certain minimum position is coNP-complete. We also show that deciding with regards to goal difference, the standard tie-breaker for teams having the same number of points, whether or not a team can reach a certain position is NP-complete.
    International Journal of Foundations of Computer Science 06/2015; 26(04):477-486. DOI:10.1142/S0129054115500264
  • [Show abstract] [Hide abstract]
    ABSTRACT: Permutation polynomials with low differential uniformity are important candidate functions to design substitution boxes of block ciphers. In this paper, we investigate several classes of differential 4-uniform binomial and trinomial permutation polynomials over the finite field 𝔽2n of 2n elements.
    International Journal of Foundations of Computer Science 06/2015; 26(04):487-497. DOI:10.1142/S0129054115500276
  • [Show abstract] [Hide abstract]
    ABSTRACT: A program which eventually stops but does not halt “too quickly” halts at a time which is algorithmically compressible. This result — originally proved in [4] — is proved in a more general setting. Following Manin [11] we convert the result into an anytime algorithm for the halting problem and we show that the stopping time (cut-off temporal bound) cannot be significantly improved.
    International Journal of Foundations of Computer Science 06/2015; 26(04):465-475. DOI:10.1142/S0129054115500252
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper is concerned with the study of possibility of performing changes to existing running programs with the use of the RAM and RASP models of computation. A new model of computation is defined with the capability of performing runtime changes. Theoretical properties, including time and space complexities, of the defined models are presented and proven. A number of simple empirical tests are conducted in order to prove the ability to perform runtime changes as well as support obtained theoretical results. The paper concludes that the defined model has virtually no affect on performance when there are no changes and the performance with changes is easily manageable. Moreover, the results can be used to develop runtime change capabilities for a wide range of programming languages and paradigms.
    International Journal of Foundations of Computer Science 06/2015; 26(04):441-463. DOI:10.1142/S0129054115500240
  • [Show abstract] [Hide abstract]
    ABSTRACT: In computer networks area, the minimal dominating sets (MDS) and maximal independent sets (MIS) structures are very useful for creating virtual network overlays. Often, these set structures are used for designing efficient protocols in wireless sensor and ad-hoc networks. In this paper, we give a particular interest to one kind of these sets, called Independent Strong Dominating Set (ISD-set). In addition to its domination and independence properties, the ISD-set considers also node’s degrees that make it very useful in practical applications where nodes with larger degrees play important role in the networks. For example, some network clustering protocols chose nodes with large degrees to be cluster-heads, which is exactly the result obtained by an ISD-set algorithm. Thence, we propose the first distributed self-stabilizing algorithm for computing an ISD-set of an arbitrary graph (called ISDS). Then, we prove that ISDS algorithm operates under the unfair distributed scheduler and converges after at most (n + 1) rounds requiring only O(log ∆) space memory per node where ∆ is the maximum node degree. The complexity of ISDS algorithm in rounds has the same order as the best known self-stabilizing algorithms for finding MDS and MIS. Moreover, performed simulations and comparisons with well-known self-stabilizing algorithms for MDS and MIS problems showed the efficiency of ISDS, especially for reducing the cardinality of dominating sets founded by the algorithms.
    International Journal of Foundations of Computer Science 04/2015;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Feature selection is the problem of identifying a subset of the most relevant features in the context of model construction. This problem has been well studied and plays a vital role in machine learning. In this paper we present three randomized algorithms for feature selection. They are generic in nature and can be applied for any learning algorithm. Proposed algorithms can be thought of as a random walk in the space of all possible subsets of the features. We demonstrate the generality of our approaches using three different applications. The simulation results show that our feature selection algorithms outperforms some of the best known algorithms existing in the current literature.
    International Journal of Foundations of Computer Science 04/2015; 26(03):321-341. DOI:10.1142/S0129054115500185
  • [Show abstract] [Hide abstract]
    ABSTRACT: In spectral graph theory, the Laplacian energy of undirected graphs has been studied extensively. However, there has been little work yet for digraphs. Recently, Perera and Mizoguchi (2010) introduced the directed Laplacian matrix L=D-A and directed Laplacian energy LE(G)=Σi=1nλi2 using the second spectral moment of L for a digraph G with n vertices, where D is the diagonal out-degree matrix, and A=(aij) with aij=1 whenever there is an arc (i,j) from the vertex i to the vertex j and 0 otherwise. They studied the directed Laplacian energies of two special families of digraphs (simple digraphs and symmetric digraphs). In this paper, we extend the study of Laplacian energy for digraphs which allow both simple and symmetric arcs. We present lower and upper bounds for the Laplacian energy for such digraphs and also characterize the extremal graphs that attain the lower and upper bounds. We also present a polynomial algorithm to find an optimal orientation of a simple undirected graph such that the resulting oriented graph has the minimum Laplacian energy among all orientations. This solves an open problem proposed by Perera and Mizoguchi at 2010.
    International Journal of Foundations of Computer Science 04/2015; 26(03):367-380. DOI:10.1142/S0129054115500203
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this note we consider the following problem: Given a graph G and a subgraph H, what is the smallest subset E′E(G) of edges in G that needs to be deleted from the graph to make it H-free? Several algorithmic results are presented. First, using the general framework of Courcelle [9], we show that, for a fixed subgraph H, the problem can be solved in linear time on graphs of bounded treewidth. It is known that the constant hidden in the big-O notation of Courcelle algorithm is big which makes the approach impractical. Thus, we present two explicit linear time dynamic programming algorithms on graphs of bounded treewidth for restricted settings of the problem with reasonable constants. Third, using the linear time algorithm for graphs of bounded treewidth, we design a Baker's type polynomial time approximation scheme for the problem on planar graphs.
    International Journal of Foundations of Computer Science 04/2015; 26(03):399-411. DOI:10.1142/S0129054115500227