Information Processing Letters最新文献

英文中文

Faster and simpler online computation of string net frequency 更快更简单的在线计算弦网频率

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2026-01-15 DOI: 10.1016/j.ipl.2026.106620

Shunsuke Inenaga

An occurrence of a repeated substring u in a string S is called a net occurrence if extending the occurrence to the left or to the right decreases the number of occurrences to 1. The net frequency (NF) of a repeated substring u in a string S is the number of net occurrences of u in S. Very recently, Guo et al. [SPIRE 2024] proposed an online O(nlog σ)-time algorithm that maintains a data structure of O(n) space which answers Single-NF queries in

O (m \log σ + σ^{2})

time and reports all answers of the All-NF problem in O(nσ²) time. Here, n is the length of the input string S, m is the query pattern length, and σ is the alphabet size. The σ² term is a major drawback of their method since computing string net frequencies is originally motivated for Chinese language text processing where σ can be thousands large. This paper presents an improved online O(nlog σ)-time algorithm, which answers Single-NF queries in O(mlog σ) time and reports all answers to the All-NF problem in output-optimal

O (| {NF}^{+} (S) |)

time, where

{NF}^{+} (S)

is the set of substrings of S paired with their positive NF values. We note that

| {NF}^{+} (S) | = O (n)

always holds. In contrast to Guo et al.’s algorithm that is based on Ukkonen’s suffix tree construction, our algorithm is based on Weiner’s suffix tree construction.

如果将重复子字符串u在字符串S中出现的次数向左或向右扩展会使出现次数减少到1，则称为净出现。字符串S中重复子串u的净频率（NF）是u在S中净出现的次数。最近，Guo等人[SPIRE 2024]提出了一种在线O（nlog σ）时间算法，该算法维护O(n)空间的数据结构，该数据结构在O（mlogσ+σ2）时间内回答单NF查询，并在O（nσ2）时间内报告所有所有NF问题的答案。这里，n是输入字符串S的长度，m是查询模式的长度，σ是字母表的大小。σ2项是他们的方法的一个主要缺点，因为计算字符串网络频率最初是为了中文文本处理而设计的，其中σ可以是几千。本文提出了一种改进的在线O（nlog σ）时间算法，该算法在O（mlog σ）时间内回答单NF查询，并在输出最优的O（|) NF+(S)|）时间内报告全NF问题的所有答案，其中NF+(S)是S的子串与其正NF值配对的集合。我们注意到|NF+(S)|=O(n)总是成立的。与Guo等人基于Ukkonen后缀树构造的算法不同，我们的算法是基于Weiner后缀树构造的。

{"title":"Faster and simpler online computation of string net frequency","authors":"Shunsuke Inenaga","doi":"10.1016/j.ipl.2026.106620","DOIUrl":"10.1016/j.ipl.2026.106620","url":null,"abstract":"<div><div>An occurrence of a repeated substring u in a string S is called a net occurrence if extending the occurrence to the left or to the right decreases the number of occurrences to 1. The net frequency (NF) of a repeated substring u in a string S is the number of net occurrences of u in S. Very recently, Guo et al. [SPIRE 2024] proposed an online O(nlog σ)-time algorithm that maintains a data structure of O(n) space which answers Single-NF queries in <math><mrow><mi>O</mi><mo>(</mo><mi>m</mi><mi>log</mi><mi>σ</mi><mo>+</mo><msup><mi>σ</mi><mn>2</mn></msup><mo>)</mo></mrow></math> time and reports all answers of the All-NF problem in O(nσ2) time. Here, n is the length of the input string S, m is the query pattern length, and σ is the alphabet size. The σ2 term is a major drawback of their method since computing string net frequencies is originally motivated for Chinese language text processing where σ can be thousands large. This paper presents an improved online O(nlog σ)-time algorithm, which answers Single-NF queries in O(mlog σ) time and reports all answers to the All-NF problem in output-optimal <math><mrow><mi>O</mi><mo>(</mo><mo>|</mo><msup><mi>NF</mi><mo>+</mo></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow><mo>|</mo><mo>)</mo></mrow></math> time, where <math><mrow><msup><mi>NF</mi><mo>+</mo></msup><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow></mrow></math> is the set of substrings of S paired with their positive NF values. We note that <math><mrow><mrow><mo>|</mo></mrow><msup><mi>NF</mi><mo>+</mo></msup><mrow><mrow><mo>(</mo><mi>S</mi><mo>)</mo></mrow><mo>|</mo><mo>=</mo><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></mrow></math> always holds. In contrast to Guo et al.’s algorithm that is based on Ukkonen’s suffix tree construction, our algorithm is based on Weiner’s suffix tree construction.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"193 ","pages":"Article 106620"},"PeriodicalIF":0.6,"publicationDate":"2026-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146022656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Universal approximation theorem for neural networks with inputs from a topological vector space 输入为拓扑向量空间的神经网络的通用逼近定理

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2026-01-13 DOI: 10.1016/j.ipl.2026.106623

Vugar E. Ismailov

We study feedforward neural networks with inputs from a topological vector space (TVS-FNNs). Unlike traditional feedforward neural networks, TVS-FNNs can process a broader range of inputs, including sequences, matrices, functions and more. We prove a universal approximation theorem for TVS-FNNs, which demonstrates their capacity to approximate any continuous function defined on this expanded input space.

我们研究了输入来自拓扑向量空间的前馈神经网络（tvs - fnn）。与传统的前馈神经网络不同，tvs - fnn可以处理更广泛的输入，包括序列、矩阵、函数等。我们证明了tvs - fnn的一个普适逼近定理，证明了它们能够逼近在这个扩展的输入空间上定义的任何连续函数。

引用次数: 0

The k-center problem of uncertain points on graphs 图上不确定点的k中心问题

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2026-01-07 DOI: 10.1016/j.ipl.2026.106621

Haitao Xu, Jingru Zhang

In this paper, we study the k-center problem of uncertain points on a graph. Given are an undirected simple graph

G = (V, E)

and a set

P

of n uncertain points where each uncertain point with a non-negative weight has m possible locations on G each associated with a probability. The problem aims to find k centers (points) on G so as to minimize the maximum weighted expected distance of uncertain points to their own expected closest centers. No previous work exist for the k-center problem of uncertain points on undirected graphs. We propose exact algorithms that solve respectively the case of

k = 2

in O(|E|²m²nlog |E|mnlog mn) time and the problem with k ≥ 3 in

{O (\min {| E |}^{k} m^{k} n^{k + 1} {k \log | E | m n \log m, | E |}^{k} n^{\frac{k}{2}} m^{\frac{k^{2}}{2}} \log | E | m n})

time, provided with the distance matrix of G. In addition, an O(|E|mnlog mn)-time algorithmic approach is given for the one-center case.

本文研究了图上不确定点的k中心问题。给定一个无向简单图G=（V，E）和一个包含n个不确定点的集合P，其中每个非负权的不确定点在G上有m个可能的位置，每个位置与一个概率相关。该问题的目标是在G上找到k个中心（点），使不确定点到自己的期望最近中心的最大加权期望距离最小。对于无向图上不确定点的k中心问题，目前尚无相关研究。在距离矩阵为g的情况下，分别提出了k=2在O（|E|2m2nlog |E|mnlog mn）时间内和k ≥ 3在O（min{|E|kmknk+1klog|E|mnlogm,|E|knk2mk22log|E|mn}）时间内求解的精确算法，并给出了单中心情况下的O（|E|mnlog mn）时间算法方法。

{"title":"The k-center problem of uncertain points on graphs","authors":"Haitao Xu, Jingru Zhang","doi":"10.1016/j.ipl.2026.106621","DOIUrl":"10.1016/j.ipl.2026.106621","url":null,"abstract":"<div><div>In this paper, we study the k-center problem of uncertain points on a graph. Given are an undirected simple graph <math><mrow><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></math> and a set <math><mi>P</mi></math> of n uncertain points where each uncertain point with a non-negative weight has m possible locations on G each associated with a probability. The problem aims to find k centers (points) on G so as to minimize the maximum weighted expected distance of uncertain points to their own expected closest centers. No previous work exist for the k-center problem of uncertain points on undirected graphs. We propose exact algorithms that solve respectively the case of <math><mrow><mi>k</mi><mo>=</mo><mn>2</mn></mrow></math> in O(|E|2m2nlog |E|mnlog mn) time and the problem with k ≥ 3 in <math><mrow><msup><mrow><mi>O</mi><mo>(</mo><mi>min</mi><mo>{</mo><mo>|</mo><mi>E</mi><mo>|</mo></mrow><mi>k</mi></msup><msup><mi>m</mi><mi>k</mi></msup><msup><mi>n</mi><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup><msup><mrow><mi>k</mi><mi>log</mi><mo>|</mo><mi>E</mi><mo>|</mo><mi>m</mi><mi>n</mi><mi>log</mi><mi>m</mi><mo>,</mo><mo>|</mo><mi>E</mi><mo>|</mo></mrow><mi>k</mi></msup><msup><mi>n</mi><mfrac><mi>k</mi><mn>2</mn></mfrac></msup><msup><mi>m</mi><mfrac><msup><mi>k</mi><mn>2</mn></msup><mn>2</mn></mfrac></msup><mrow><mi>log</mi><mo>|</mo><mi>E</mi><mo>|</mo><mi>m</mi><mi>n</mi><mo>}</mo><mo>)</mo></mrow></mrow></math> time, provided with the distance matrix of G. In addition, an O(|E|mnlog mn)-time algorithmic approach is given for the one-center case.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"193 ","pages":"Article 106621"},"PeriodicalIF":0.6,"publicationDate":"2026-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145977795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A linear-time algorithm for the two-color one-dimensional buttons & scissors 双色一维按钮&剪刀的线性时间算法

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2026-01-07 DOI: 10.1016/j.ipl.2026.106622

Suguru Hayata , Hiro Ito

The problem of determining whether a given board of the puzzle Buttons & Scissors is solvable is known to be NP-complete. On the other hand, when the board is restricted to one dimension, it is known to be solvable in O(n³)-time for a board of size (length) n. This also holds when the button colors are limited to two colors. We provide a simple linear-time algorithm to determine whether an input of the Two-Color One-Dimensional Buttons & Scissors problem is solvable. The algorithm uses a necessary and sufficient condition after applying a linear-time preprocessing.

确定“按钮和剪刀”谜题中给定的棋盘是否可解的问题被称为np完全问题。另一方面，当棋盘被限制为一维时，对于大小（长度）为n的棋盘，已知在O（n3）时间内可解。当按钮颜色被限制为两种颜色时也是如此。我们提供了一个简单的线性时间算法来确定双色一维按钮剪刀问题的输入是否可解。该算法在进行线性时间预处理后，使用了一个充分必要条件。

引用次数: 0

EvenPath in directed single-crossing graphs 有向单交图中的偶径

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2025-11-26 DOI: 10.1016/j.ipl.2025.106613

Archit Chauhan , Chetan Gupta , Vimal Raj Sharma

Given a directed graph G and two of its vertices s and t, the EvenPath problem is to find an even-length path from s to t. The decision version of EvenPath problem for general directed graphs was shown to be NP-

complete

by LaPaugh and Papadimitriou [1]. Thus, it makes sense to discover the classes of graphs for which the EvenPath problem can be solved efficiently. The EvenPath problem for directed planar graphs and directed single-crossing-minor-free graphs is known to be solvable in polynomial-time [2, 3]. In our work, we extend the classes of graphs for which the EvenPath problem can be solved in polynomial-time to directed single-crossing graphs. Our polynomial-time algorithm essentially reduces the EvenPath problem for a directed single-crossing graph to several instances of the EvenPath problem and 3-DisjointPaths problem for directed planar graphs.

给定一个有向图G和它的两个顶点s和t， EvenPath问题是寻找一条从s到t的偶数长度的路径。一般有向图的EvenPath问题的决策版本由LaPaugh和Papadimitriou[1]证明是np完全的。因此，发现能有效解决偶数路径问题的图的类别是有意义的。已知有向平面图和有向单交无次图的偶数路径问题在多项式时间内可解[2,3]。在我们的工作中，我们将偶数路径问题可以在多项式时间内解决的图类扩展到有向单交图。我们的多项式时间算法本质上将有向单交叉图的偶数路径问题简化为有向平面图的偶数路径问题和3-DisjointPaths问题的几个实例。

引用次数: 0

Fault-tolerant distributed trigger counting 容错分布式触发器计数

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2025-11-04 DOI: 10.1016/j.ipl.2025.106612

Manish Kumar , Manish Kumar

In this paper, we address the Fault-Tolerant Distributed Trigger Counting (FTDTC) problem under the presence of crash faults, exploring both explicit and implicit settings. In the explicit setting, we aim to count all triggers across the entire network, whereas, in the implicit setting, we consider a subset of nodes¹ for trigger counting. We investigated the message complexity of FTDTC problem in the crash fault synchronous and fully-connected distributed network. We present randomized (Monte Carlo) algorithms that achieve sublinear and subquadratic message complexity in the socalled implicit version and explicit version, respectively, when tolerating more than a constant fraction of the faulty nodes. Our fault-tolerant distributed trigger counting algorithms are resilient to any number of faulty nodes, up to

(n - polylog n)

在本文中，我们研究了在存在崩溃故障的情况下容错分布式触发计数（FTDTC）问题，探索了显式和隐式设置。在显式设置中，我们的目标是对整个网络中的所有触发器进行计数，而在隐式设置中，我们考虑节点1的子集进行触发器计数。研究了崩溃故障同步全连接分布式网络中FTDTC问题的消息复杂度。我们提出了随机（蒙特卡罗）算法，分别在所谓的隐式版本和显式版本中实现次线性和次二次消息复杂度，当容忍超过常数部分的故障节点时。我们的容错分布式触发计数算法对任何数量的故障节点都具有弹性，最高可达（n - polylogn）。

引用次数: 0

Reachability in graphs having linear 2-arboricity two is NL-hard 具有线性2-任意2的图中的可达性是NL-hard

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2025-10-10 DOI: 10.1016/j.ipl.2025.106611

Ronak Bhadra, Raghunath Tewari

A linear k-diforest is a directed forest consisting of directed paths of length at most k. Linear k-arboricity of a directed graph is defined as the minimum number of linear k-diforests needed to partition the edges of the graph. We show that the problem of deciding reachability in directed graphs having linear 2-arboricity two is

NL

-hard and the same is also true for directed graphs having linear 1-arboricity three. Our proof also implies that deciding reachability in such graphs remains hard even when a decomposition into two linear 2-diforests or three linear 1-diforests is provided. We further extend our results for a more restricted notion of linear arboricity, called geometric linear arboricity.

线性k-diforest是由长度最多为k的有向路径组成的有向森林。有向图的线性k-树性定义为划分图边所需的最小线性k-diforest数。我们证明了判定具有线性2-任意性2的有向图的可达性问题是NL-hard的，对于具有线性1-任意性3的有向图也是如此。我们的证明还表明，即使提供了分解为两个线性2-双森林或三个线性1-双森林的图，也很难确定图中的可达性。我们进一步推广了线性树性的一个更严格的概念，称为几何线性树性。

引用次数: 0

Practical committing attacks against Rocca-S 对Rocca-S实施实际攻击

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2025-10-01 DOI: 10.1016/j.ipl.2025.106610

Ryunosuke Takeuchi , Yosuke Todo , Tetsu Iwata

This paper shows practical committing attacks against Rocca-S, an authenticated encryption with associated data scheme designed for 6G applications. Previously, the best complexity of the attack was 2⁶⁴ by Derbez et al. in ToSC 2024(1)/FSE 2024. We show that the committing attack against Rocca by Takeuchi et al. in ToSC 2024(2)/FSE 2025 can be applied to Rocca-S, where Rocca is an earlier version of Rocca-S. We show a concrete test vector of our attack. We also point out a committing attack that exploits equivalent keys.

本文展示了针对Rocca-S的实际攻击，Rocca-S是为6G应用程序设计的带有相关数据方案的身份验证加密。此前，Derbez等人在ToSC 2024(1)/FSE 2024中给出的最佳攻击复杂度为264。我们证明Takeuchi等人在ToSC 2024(2)/FSE 2025中对Rocca的攻击可以应用于Rocca- s，其中Rocca是Rocca- s的早期版本。我们展示了攻击的具体测试向量。我们还指出了一种利用等效密钥的提交攻击。

引用次数: 0

The Steiner path aggregation problem 斯坦纳路径聚合问题

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2025-09-26 DOI: 10.1016/j.ipl.2025.106608

Da Qi Chen , Daniel Hathcock , D. Ellis Hershkowitz , R. Ravi

In the Steiner Path Aggregation Problem, our goal is to aggregate paths in a directed network into a single arborescence without significantly disrupting the paths. In particular, we are given a directed multigraph with colored arcs, a root, and k terminals, each of which has a monochromatic path to the root. Our goal is to find an arborescence in which every terminal has a path to the root, and its path does not switch colors too many times. We give an efficient algorithm that finds such a solution with at most

2 \log_{\frac{4}{3}} k

color switches. Up to constant factors this is the best possible universal bound, as there are graphs requiring at least

\log_{2} k

color switches.

在Steiner路径聚合问题中，我们的目标是在不显著破坏路径的情况下，将有向网络中的路径聚合成单个树形。特别地，我们给出了一个有向多图，它有彩色的弧，一个根和k个端点，每个端点都有一条到根的单色路径。我们的目标是找到一个树，其中每个终端都有一条到根的路径，并且它的路径不会频繁地切换颜色。我们给出了一个有效的算法，该算法最多使用2log43 (k)个颜色切换来找到这样的解。在常数因子范围内，这是最好的通称界，因为有些图需要至少log2 k个颜色切换。

引用次数: 0

The harmonious coloring game 和谐的填色游戏

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters

Pub Date : 2025-09-25 DOI: 10.1016/j.ipl.2025.106609

Cláudia Linhares Sales , Thiago Marcilon , Nicolas Martins , Nicolas Nisse , Rudini Sampaio

A harmonious k-coloring of a graph G is a 2-distance proper k-coloring of its vertices such that each edge is uniquely identified by the colors of its endpoints. Here, we introduce its game version: the harmonious coloring game. In this two-player game, Alice and Bob alternately select an uncolored vertex and assigns to it a color in

{1, \dots, k}

with the constraint that, at every turn, the set of colored vertices induces a valid partial harmonious coloring. Alice wins if all vertices are colored; otherwise, Bob wins. The harmonious game chromatic number

χ_{h g} (G)

is the minimum integer k such that Alice has a winning strategy with k colors. In this paper, we prove the PSPACE-hardness of three variants of this game. As a by-product, we prove that a variant introduced by Chen et al. in 1997 of the classical graph coloring game is PSPACE-hard even in graphs with diameter two. We also obtain lower and upper bounds for

χ_{h g} (G)

in graph classes, such as paths, cycles, grids and forests of stars.

图G的和谐k-着色是其顶点的2距离固有k-着色，使得每条边都由其端点的颜色唯一标识。在这里，我们介绍一下它的游戏版本：和谐着色游戏。在这个双人游戏中，Alice和Bob轮流选择一个未上色的顶点，并在{1，…，k}中为其分配一个颜色，同时约束是，在每一轮中，上色顶点集合都会产生一个有效的部分和谐上色。如果所有顶点都有颜色，则Alice获胜；否则，鲍勃赢。和谐博弈色数χhg(G)是最小整数k，使得Alice拥有k种颜色的获胜策略。本文证明了该对策的三种变体的pspace -硬度。作为副产品，我们证明了Chen等人在1997年引入的经典图着色游戏的一个变体即使在直径为2的图中也是PSPACE-hard的。我们还得到了图类中χhg(G)的下界和上界，如路径、循环、网格和星形森林。

{"title":"The harmonious coloring game","authors":"Cláudia Linhares Sales , Thiago Marcilon , Nicolas Martins , Nicolas Nisse , Rudini Sampaio","doi":"10.1016/j.ipl.2025.106609","DOIUrl":"10.1016/j.ipl.2025.106609","url":null,"abstract":"<div><div>A harmonious k-coloring of a graph G is a 2-distance proper k-coloring of its vertices such that each edge is uniquely identified by the colors of its endpoints. Here, we introduce its game version: the harmonious coloring game. In this two-player game, Alice and Bob alternately select an uncolored vertex and assigns to it a color in <math><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi><mo>}</mo></math> with the constraint that, at every turn, the set of colored vertices induces a valid partial harmonious coloring. Alice wins if all vertices are colored; otherwise, Bob wins. The harmonious game chromatic number <math><msub><mrow><mi>χ</mi></mrow><mrow><mi>h</mi><mi>g</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> is the minimum integer k such that Alice has a winning strategy with k colors. In this paper, we prove the PSPACE-hardness of three variants of this game. As a by-product, we prove that a variant introduced by Chen et al. in 1997 of the classical graph coloring game is PSPACE-hard even in graphs with diameter two. We also obtain lower and upper bounds for <math><msub><mrow><mi>χ</mi></mrow><mrow><mi>h</mi><mi>g</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> in graph classes, such as paths, cycles, grids and forests of stars.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"192 ","pages":"Article 106609"},"PeriodicalIF":0.6,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Information Processing Letters

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀