发文分析
近年国家/地区发文量统计
| 国家/地区 | 数量 |
|---|---|
| GERMANY (FED REP GER) | 55 |
| USA | 52 |
| France | 48 |
| England | 25 |
| Israel | 24 |
| India | 17 |
| Italy | 17 |
| Canada | 15 |
| Poland | 14 |
| Russia | 13 |
近年机构发文量统计
| 机构 | 数量 |
|---|---|
| CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE (... | 33 |
| INSTITUTE OF MATHEMATICAL SCIENCES (IMSC) INDI... | 9 |
| UNIVERSITE DE PARIS | 9 |
| HOMI BHABHA NATIONAL INSTITUTE | 8 |
| UNIVERSITY OF OXFORD | 8 |
| INSTITUT POLYTECHNIQUE DE PARIS | 7 |
| SORBONNE UNIVERSITE | 7 |
| UNIVERSITE PARIS SACLAY | 7 |
| UNIVERSITY OF BERGEN | 7 |
| DORTMUND UNIVERSITY OF TECHNOLOGY | 6 |
近年文章引用他刊数据
| 文章名称 | 引用次数 |
|---|---|
| Verification of Quantum Computation: An Overview of Exis... | 11 |
| The Operator Approach to Entropy Games | 3 |
| Co-c.e. Sets with Disconnected Complements | 3 |
| Exploration of the T-Interval-Connected Dynamic Graphs: ... | 3 |
| Faster Algorithms for the Constrained k-means Problem | 3 |
| Testing Shape Restrictions of Discrete Distributions | 3 |
| Tighter Bounds and Optimal Algorithms for All Maximal al... | 3 |
| Polynomial Kernels for Vertex Cover Parameterized by Sma... | 3 |
| Revisiting Connected Vertex Cover: FPT Algorithms and Lo... | 3 |
| Designing Cost-Sharing Methods for Bayesian Games | 2 |
近年被他刊引用数据
| 期刊名称 | 引用次数 |
|---|---|
| THEOR COMPUT SCI | 45 |
| J COMPUT SYST SCI | 28 |
| THEOR COMPUT SYST | 25 |
| ALGORITHMICA | 23 |
| DISCRETE APPL MATH | 16 |
| SIAM J COMPUT | 16 |
| LOG METH COMPUT SCI | 13 |
| ACM T ALGORITHMS | 11 |
| IEEE ACCESS | 11 |
| INFORM COMPUT | 10 |