研飞客户端支持数万种期刊查询，助你在阅读和写作中随时了解期刊动态
Information Processing Letters
| 短名 | Inf. Process. Lett. |
| Journal Impact | 0.84 |
| 国际分区 | COMPUTER SCIENCE, INFORMATION SYSTEMS(Q4) |
| 期刊索引 | SCI Q4中科院 4 区 |
| ISSN | 0020-0190, 1872-6119 |
| h-index | 83 |
| 国内分区 | 计算机科学(4区)计算机科学计算机信息系统(4区) |
《Information Processing Letters》邀请提交专注于信息处理和计算基本方面的原创研究文章。这包括广泛理解的理论计算机科学领域的工作。虽然所有科学探究领域的论文都将被考虑，但前提是它们描述的研究贡献可信地受到计算应用的推动，并且涉及严格的方法。此外，解决具有足够广泛兴趣的主题的高质量实验论文也会被考虑。自1971年成立以来，《Information Processing Letters》一直是一个及时传播简短、简洁和重点研究贡献的论坛。为了延续这一传统，并加快审阅过程，手稿在印刷时通常限制在九页以内。
期刊主页投稿网址阅读文献时，研飞即可帮你快速了解期刊，查询影响因子与分区，智能高亮期刊预警！
| 涉及主题 | 计算机科学数学算法组合数学程序设计语言离散数学理论计算机科学数学分析操作系统工程类哲学物理人工智能几何学 |
| 出版信息 | 出版商: Elsevier B.V.，出版周期: Monthly，期刊类型: journal |
| 基本数据 | 创刊年份: 1971，原创研究文献占比: 100.00%，自引率:0.00%， Gold OA占比: 26.32% |
| 平均审稿周期 | 网友分享经验：平均7.5个月 |
| 平均录用比例 | 网友分享经验：约50% |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
手工熬夜修改参考文献？研飞自动匹配期刊，一键轻松成稿，支持 Word/WPS
点击下方按钮，免费开启试用！
最新文章
4/3 rectangle tiling lower bound
2025-2-1
Robust probabilistic temporal logics
2025-2-1
Lower and Upper Bounds on Graph Communicabilities
2025-1-1
Improved Lower Bound for Differentially Private Facility Location
2025-1-1
A Note on the k-restriction Problem
2025-1-1
Weighted Fair Division of Indivisible Items: A Review
2025-1-1
Reduced meet over labelling-based semantics in abstract argumentation
2025-1-1
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
2025-1-1
Regular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi mathvariant="script">D</mml:mi></mml:math>-Length: a Tool for Improved Prefix-Stable Forward Ramsey Factorisations
2025-1-1
Top-down complementation of automata on finite trees
2025-1-1
On Conflict-Free Cuts: Algorithms and Complexity
2025-1-1
Optimal Randomized Algorithms of Weakly-Balanced Multi-Branching AND-OR Trees
2025-1-1
Spanners under the Hausdorff and Fréchet distances
2025-1-1
Improving compressed matrix multiplication using control variate method
2025-1-1
Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound
2025-1-1
Editorial Board
2025-1-1
Counter abstraction for regular open teams
2024-9-16
Editorial Board
2024-8-8
4/3 rectangle tiling lower bound
2024-8-8
Robust probabilistic temporal logics
2024-8-8
Smaller kernels for two vertex deletion problems
2024-8-1
A linear-time algorithm for the center problem in weighted cycle graphs
2024-8-1
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
2024-8-1
Luby's MIS Algorithms Made Self-Stabilizing
2024-8-1
Algorithms for subgraph complementation to some classes of graphs
2024-8-1
A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mn>2</mml:mn><mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mi>k</mml:mi></mml:mrow></mml:msqrt></mml:math>-approximation algorithm for minimum power k edge disjoint st-paths
2024-8-1
Correcting matrix products over the ring of integers
2024-8-1
Editorial Board
2024-8-1
Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound
2024-7-14
Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle and Beyond
2024-7-1
Weighted Fair Division of Indivisible Items: A Review
2024-6-26
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
2024-6-12
Improving compressed matrix multiplication using control variate method
2024-6-12
A Note on the k-restriction Problem
2024-6-3
Hamiltonian cycles of balanced hypercube with disjoint faulty edges
2024-6-1
Reduced meet over labelling-based semantics in abstract argumentation
2024-5-31
Spanners under the Hausdorff and Fréchet distances
2024-5-16
Optimal Randomized Algorithms of Weakly-Balanced Multi-Branching AND-OR Trees
2024-5-10
On conflict-free cuts: Algorithms and complexity
2024-5-8
Top-down complementation of automata on finite trees
2024-5-3
Is this network proper forest-based?
2024-5-1
Regular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi mathvariant="script">D</mml:mi></mml:math>-Length: a Tool for Improved Prefix-Stable Forward Ramsey Factorisations
2024-4-24
Dispersion problem on a convex polygon
2024-4-1
The autocorrelation of a class of quaternary sequences of length pq with high complexity
2024-3-24
Branching bisimulation semantics for quantum processes
2024-3-16
Anti Tai mapping for unordered labeled trees
2024-3-1
Semantic Flowers for Good-for-Games and Deterministic Automata
2024-3-1
The effect of iterativity on adversarial opinion forming
2024-3-1
Deterministic treasure hunt and rendezvous in arbitrary connected graphs
2024-3-1
Computing minimal solutions to the ring loading problem
2024-3-1
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远