International Journal of Foundations of Computer Science (INT J FOUND COMPUT S)
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
Additional details
5year impact  0.39 

Cited halflife  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  01290541 
OCLC  47442835 
Material type  Document, Periodical, Internet resource 
Document type  Internet Resource, Computer File, Journal / Magazine / Newspaper 
Publisher details
 Preprint
 Author can archive a preprint version
 Postprint
 Author cannot archive a postprint version
 Restrictions
 12 months embargo
 Conditions
 Author's preprint on any website or open access repository
 Author's postprint 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 preprint and authors postprint  see policy
 Must link to publisher version with DOI
 Classificationyellow
Publications in this journal
 International Journal of Foundations of Computer Science 09/2015; 26(06):769801. DOI:10.1142/S0129054115500434

Article: Jumping Grammars
International Journal of Foundations of Computer Science 09/2015; 26(06):709731. DOI:10.1142/S0129054115500409  International Journal of Foundations of Computer Science 09/2015; 26(06):677695. DOI:10.1142/S0129054115500380
 International Journal of Foundations of Computer Science 09/2015; 26(06):697707. DOI:10.1142/S0129054115500392
 [Show abstract] [Hide abstract]
ABSTRACT: Several factors have to be taken into account in the design of large interconnection networks. Optimal design is important both to achieve good performance and to reduce the cost of construction and maintenance. Practical communication networks are exposed to failures of network components. Failures between nodes and connections happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. Robustness of the network topology is a key aspect in the design of computer networks. A variety of measures have been proposed in the literature to quantify the robustness of networks and a number of graphtheoretic parameters have been used to derive formulas for calculating network reliability. In this paper, we study the vulnerability of interconnection networks to the failure of individual nodes, using a graphtheoretic concept of domination and strongweak domination numbers of the transformation graph G^{xy+} as a measure of network robustness.International Journal of Foundations of Computer Science 09/2015; 26(6):667675. DOI:10.1142/S0129054115500379 
Article: Alberto Apostolico
International Journal of Foundations of Computer Science 08/2015; 26(05):iiiiii. DOI:10.1142/S0129054115010017  [Show abstract] [Hide abstract]
ABSTRACT: In sequence comparison, finding local similarities in given strings is a very important wellknown problem. In this work we introduce two local sequence similarity query problems, and present algorithms for them. Our algorithms use a data structure that supports constant time longest common extension queries. This data structure is created only once, and in time linear in the size of the input strings. After this step all subsequent local similarity queries can be answered very fast. Existing algorithms take significantly more time in answering these queries.International Journal of Foundations of Computer Science 08/2015; 26(05):625642. DOI:10.1142/S0129054115500355  [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 subexponential time complexity. This provides new evidence with respect to which NP complete problems should be classified as subexponential. Symmetric representation has the advantage of space efficiency, at most lineartime 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):557581. DOI:10.1142/S0129054115500318  [Show abstract] [Hide abstract]
ABSTRACT: A method for constructing piecewise differentially 4uniform permutations has been recently introduced by Zha, Hu and Sun. By using this method, we provide two new infinite families of differentially 4uniform permutations from the known APN functions. The CCZ inequivalence between these constructed functions and the known differentially 4uniform permutations are also investigated by computation.International Journal of Foundations of Computer Science 08/2015; 26(05):599609. DOI:10.1142/S0129054115500331  [Show abstract] [Hide abstract]
ABSTRACT: Group signatures are typically used to authenticate the signer of message while preserving the privacy of the signer. Group signature should be minimized to reduce potential communication overhead. We propose a novel short group signature scheme that generates constantsize group public key and constantsize group signature. The scheme, using pairingfriendly elliptic curves, is efficient in construction. We give the security proof under XDH and ECDL hardness assumptions in the BMW model. Furthermore, we propose two group membership revocation methods which provide revocation information only to verifiers. One revocation method exposes partial private key of revoked users, which requires less revocation information. The other revocation method includes mixed private key information without revealing the real private keys of revoked users. This method is simple in revocation check.International Journal of Foundations of Computer Science 08/2015; 26(05):611624. DOI:10.1142/S0129054115500343  [Show abstract] [Hide abstract]
ABSTRACT: We introduce asynchronous variants of the parallel communicating systems of pushdown automata of CsuhajVarjú et al. These are obtained by using a response symbol in addition to the usual query symbols. Our main result states that centralized asynchronous parallel communicating systems of pushdown automata of degree n that work in returning mode have exactly the same expressive power as nhead pushdown automata. This holds in the nondeterministic as well as in the deterministic case. In addition, it is shown that the class of binary relations that is computed by centralized asynchronous parallel communicating systems of pushdown automata of degree two that are working in returning mode coincides with the class of pushdown relations.International Journal of Foundations of Computer Science 08/2015; 26(05):643666. DOI:10.1142/S0129054115500367  [Show abstract] [Hide abstract]
ABSTRACT: The kisoperimetric edge connectivity is a more refined network reliability index than edge connectivity. The kisoperimetric edge connectivity of a connected graph G is defined as γk(G) = min{/[X, X]/: X ⊆ V (G), /X/ ≥ k, /X/ ≥ k}. Let βk (G) = min{/[X,X]/: X ⊆ V (G), /X/ = k}. A graph G is called a γkoptimal graph if γk (G) = βk (G). An edge cut S = [X,X] is called a γkcut if /S/ = γk (G), X ⊆ V (G), /X/ ≥ k and /X/ ≥ k. Moreover, G is called a superγk graph if every γkcut [X,X] of G has the property that either /X/ = k or /X/ = k. Let G be a graph of order at least 2k with k ≥ 2. In this paper, we prove that for any pair u, v of nonadjacent vertices in G, if /N(u)∩N(v)/ ≥ k+1 when neither u nor v lies on a triangle, or /N(u)∩N(v)/ ≥ 2k1 when u or v lies on a triangle, then G is γkoptimal. Moreover, if G is a trianglefree graph, and /N(u)∩v(v)/ ≥ k+1 for all pairs u, v of nonadjacent vertices in G, then G is either superγk or isomorphic to Kk+1,k+1.International Journal of Foundations of Computer Science 08/2015; 26(05):583598. 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)edgelabeling 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)edgelabeling 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)edgelabelings for eightregular grids.International Journal of Foundations of Computer Science 06/2015; 26(04):523535. DOI:10.1142/S012905411550029X 
Article: Soccer is Harder Than Football
[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 NPcomplete. We show that deciding whether or not a team is guaranteed a certain minimum position is coNPcomplete. We also show that deciding with regards to goal difference, the standard tiebreaker for teams having the same number of points, whether or not a team can reach a certain position is NPcomplete.International Journal of Foundations of Computer Science 06/2015; 26(04):477486. DOI:10.1142/S0129054115500264  [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):441463. DOI:10.1142/S0129054115500240  [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 4uniform binomial and trinomial permutation polynomials over the finite field 𝔽2n of 2n elements.International Journal of Foundations of Computer Science 06/2015; 26(04):487497. 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 (cutoff temporal bound) cannot be significantly improved.International Journal of Foundations of Computer Science 06/2015; 26(04):465475. DOI:10.1142/S0129054115500252
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.