发文分析
近年国家/地区发文量统计
| 国家/地区 | 数量 |
|---|---|
| USA | 60 |
| GERMANY (FED REP GER) | 23 |
| France | 18 |
| England | 17 |
| Israel | 17 |
| Canada | 9 |
| India | 9 |
| Austria | 8 |
| Australia | 7 |
| CHINA MAINLAND | 6 |
近年机构发文量统计
| 机构 | 数量 |
|---|---|
| CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE (... | 11 |
| MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT) | 9 |
| UNIVERSITY OF CALIFORNIA SYSTEM | 9 |
| MICROSOFT | 8 |
| CORNELL UNIVERSITY | 7 |
| MAX PLANCK SOCIETY | 7 |
| GOOGLE INCORPORATED | 6 |
| INSTITUTE OF SCIENCE & TECHNOLOGY - AUSTRIA | 6 |
| PRINCETON UNIVERSITY | 5 |
| UNIVERSITY OF LONDON | 5 |
近年文章引用他刊数据
| 文章名称 | 引用次数 |
|---|---|
| Subcubic Equivalences Between Path, Matrix, and Triangle... | 10 |
| Hierarchical Clustering: Objective Functions and Algorit... | 9 |
| Worst-case Optimal Join Algorithms | 6 |
| Spectral Properties of Hypergraph Laplacian and Approxim... | 6 |
| Fair Enough: Guaranteeing Approximate Maximin Shares | 5 |
| The Applied Pi Calculus: Mobile Values, New Names, and S... | 5 |
| Bandits with Knapsacks | 5 |
| Deterministic Edge Connectivity in Near-Linear Time | 5 |
| Threesomes, Degenerates, and Love Triangles | 4 |
| The Salesman's Improved Paths through Forests | 4 |
近年被他刊引用数据
| 期刊名称 | 引用次数 |
|---|---|
| IEEE ACCESS | 197 |
| THEOR COMPUT SCI | 185 |
| ALGORITHMICA | 115 |
| SIAM J COMPUT | 99 |
| J ACM | 75 |
| THEOR COMPUT SYST | 71 |
| ACM T ALGORITHMS | 68 |
| LOG METH COMPUT SCI | 63 |
| IEEE T INFORM THEORY | 60 |
| DISCRETE APPL MATH | 50 |