Acta Informatica

短名Acta Inform.
Journal Impact0.20
国际分区COMPUTER SCIENCE, INFORMATION SYSTEMS(Q4)
期刊索引SCI Q4中科院 4 区
ISSN0001-5903, 1432-0525
h-index43
国内分区计算机科学(4区)计算机科学计算机信息系统(4区)

ACTA INFORMATICA 提供关于程序、计算系统和信息结构的设计和分析的形式化方法的文章的国际传播,以及理论计算机科学的相关领域,如自动机理论、计算机科学中的逻辑和算法。感兴趣的主题包括:• 编程语言的语义• 用于并发、分布式、反应式和移动系统的模型和建模语言• 用于定时、混合和概率系统的模型和建模语言• 规范、程序分析和验证• 模型检查和定理证明• 模态、时间、一阶和高阶逻辑及其变体• 约束逻辑、SAT/SMT 求解技术• 数据库、半结构化数据和有限模型理论的理论方面• 人工智能的理论方面、知识表示、描述逻辑• 自动机理论、形式语言、术语和图形重写• 基于游戏的模型、综合• 类型理论RY,类型演算• 代数、代数和分类方法• 性能、可靠性和可靠性分析的形式方面• 信息和网络安全的基础• 并行、分布式和随机算法• 算法的设计和分析• 网络和通信协议的基础。

期刊主页投稿网址
涉及主题计算机科学数学程序设计语言算法计算理论理论计算机科学哲学离散数学组合数学人工智能操作系统物理语言学数学分析工程类生物
出版信息出版商: Springer New York出版周期: Monthly期刊类型: journal
基本数据创刊年份: 1971原创研究文献占比100.00%自引率:0.00%Gold OA占比: 45.00%
平均审稿周期 网友分享经验:>12周,或约稿
平均录用比例网友分享经验:容易

期刊引文格式

这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。

并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。

只有1位作者的期刊

有2位作者的期刊

有3位作者的期刊

有5位以上作者的期刊

书籍引用格式

以下是创作和编辑的书籍的参考文献的示例。

学位论文引用格式

网页引用格式

这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。

专利引用格式

最新文章

Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm

2024-8-31

Linear-size suffix tries and linear-size CDAWGs simplified and improved

2024-8-23

Parameterized aspects of distinct kemeny rank aggregation

2024-8-15

Word-representable graphs from a word’s perspective

2024-8-10

A closer look at Hamiltonicity and domination through the lens of diameter and convexity

2024-8-3

Cycle encoding-based parameter synthesis for timed automata safety

2024-7-30

The longest letter-duplicated subsequence and related problems

2024-7-20

Invariant relations for affine loops

2024-5-13

Reachability analysis of linear systems

2024-4-9

Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking

2024-3-29

Distance-edge-monitoring sets of networks

2024-3-19

An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus

2024-3-13

Exact distributed quantum algorithm for generalized Simon’s problem

2024-3-10

New families of Laplacian borderenergetic graphs

2024-2-26

Approximating subset sum ratio via partition computations

2024-1-12

Neighborhood mutual remainder: self-stabilizing distributed implementation and applications

2023-12-18

n-PS-codes, 2-infix-outfix codes and some related classes of codes

2023-12-15

Balancing m-ary search trees with compressions on the fringe

2023-12-15

Editorial 2023: changes and invariants

2023-11-3

A decision procedure for string constraints with string/integer conversion and flat regular constraints

2023-10-24

Discovering workflow nets of concurrent iterative processes

2023-9-14

The second step in characterizing a three-word code

2023-9-8

On first-order runtime enforcement of branching-time properties

2023-8-3

Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms

2023-8-1

Testing membership for timed automata

2023-7-17

Simple chain automaton random number generator for IoT devices

2023-6-8

Constrained polynomial zonotopes

2023-5-5

On the undecidability and descriptional complexity of synchronized regular expressions

2023-4-10

Toward a theory of program repair

2023-3-27

On partial information retrieval: the unconstrained 100 prisoner problem

2022-12-30

Decentralized runtime verification of message sequences in message-based systems

2022-10-10

Exploration of k-edge-deficient temporal graphs

2022-8-1

Preface to Klaus-Jörn Lange Festschrift

2022-8-1

Properties of graphs specified by a regular language

2022-8-1

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances

2022-8-1

Pushdown automata and constant height: decidability and bounds

2022-7-27

Reoptimization of parameterized problems

2022-7-25

The regular languages of wire linear AC$$^0$$

2022-7-25

Careful synchronization of partial deterministic finite automata

2022-7-22

Operational complexity and pumping lemmas

2022-7-20

Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times

2022-7-19

Alternating complexity of counting first-order logic for the subword order

2022-6-26

Lamplighter groups and automata

2022-6-8

Depth-first search in directed planar graphs, revisited

2022-6-4

Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs

2022-4-20

Reactive bisimulation semantics for a process algebra with timeouts

2022-4-8

Translation validation of coloured Petri net models of programs on integers

2022-4-6

From regular expression matching to parsing

2022-3-30

$$\mathcal {L}$$-reduction computation revisited

2022-3-24

Minimum status of trees with a given degree sequence

2022-2-17

帮你贴心管理全部的文献

研飞ivySCI,高效的论文管理

投稿经验分享

分享我的经验,帮你走得更远

Built withby Ivy Science
Copyright © 2020-2024
版权所有:南京青藤格致信息科技有限公司