The SIAM Journal on Computing aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution. Topics include but are not limited to analysis and design of algorithms, algorithmic game theory, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational biology, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.
SIAM Journal on Computing旨在提供计算机科学和非数值计算的数学和形式方面最重要的工作的报道。提交的资料必须写得清楚,并做出重大的技术贡献。主题包括但不限于算法的分析和设计,算法博弈论,数据结构,计算复杂性,计算代数,组合学和图论的计算方面,计算生物学,计算几何,计算机器人,编程语言的数学方面,人工智能,计算学习,数据库,信息检索,密码学,网络,分布式计算,并行算法和计算机体系结构。
年发文量 44
国人发稿量 2.27
国人发文占比 0.05%
自引率 -
平均录取率0
平均审稿周期 较慢,6-12周
版面费 -
偏重研究方向 工程技术-计算机:理论方法
期刊官网 http://www.siam.org/journals/sicomp.php
投稿链接 http://sicomp.siam.org/cgi-bin/main.plex
期刊高被引文献
A Duality-Based Unified Approach to Bayesian Mechanism Design
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1100113
Bipartite Perfect Matching is in Quasi-NC
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1097870
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1095482
Short Presburger Arithmetic Is Hard
来源期刊:SIAM Journal on ComputingDOI:10.1137/17m1151146
A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1105049
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1099583
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
来源期刊:SIAM Journal on ComputingDOI:10.1137/17m1133245
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1088594
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
来源期刊:SIAM Journal on ComputingDOI:10.1137/18M1201846
A Tight Space Bound for Consensus
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1096785
Exponential Separation of Communication and External Information
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1096293
Algorithmic Bayesian Persuasion
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1098334