《Theory Of Computing Systems》雜志的最新年發(fā)文量為38篇。
這表明該刊在每年都會精選并發(fā)表一定數(shù)量的高質(zhì)量文章，以保持其在計算機：理論方法領域的學術影響力。
該刊聚焦于計算機科學-計算機：理論方法領域的前沿研究，致力于推動該領域新技術和新知識的傳播與應用。同時它積極鼓勵研究人員詳細發(fā)表其高質(zhì)量的實驗研究和理論成果。
該刊的平均審稿周期約為 較慢,6-12周 。
Theory Of Computing Systems 雜志發(fā)文統(tǒng)計
文章名稱引用次數(shù)
- Verification of Quantum Computation: An Overview of Existing Approaches11
- The Operator Approach to Entropy Games3
- Co-c.e. Sets with Disconnected Complements3
- Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring3
- Faster Algorithms for the Constrained k-means Problem3
- Testing Shape Restrictions of Discrete Distributions3
- Tighter Bounds and Optimal Algorithms for All Maximal alpha-gapped Repeats and Palindromes3
- Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators3
- Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels3
- Designing Cost-Sharing Methods for Bayesian Games2
國家/地區(qū)發(fā)文量
- GERMANY (FED REP GER)55
- USA52
- France48
- England25
- Israel24
- India17
- Italy17
- Canada15
- Poland14
- Russia13
