热门出版物 - 学术资源搜索

h5 指数:39
h5 中位数:62

h5 指数是指在过去整整 5 年中所发表文章的 h 指数。h 指在 2018-2022 年间发表的 h 篇文章每篇至少都被引用过 h 次的最大值。隐藏

出版物的 h5 中位数，是指出版物的 h5 指数所涵盖的所有文章获得的引用次数的中位值。隐藏

#4 Theoretical Computer Science

标题/作者	引用次数	年份
A Proof of the CSP Dichotomy Conjecture D Zhuk Journal of the ACM (JACM) 67 (5), 1-78	346	2020
Hierarchical Clustering: Objective Functions and Algorithms V Cohen-addad, V Kanade, F Mallmann-trenn, C Mathieu Journal of the ACM (JACM) 66 (4), 1-42	181	2019
Solving Linear Programs in the Current Matrix Multiplication Time MB Cohen, YT Lee, Z Song Journal of the ACM (JACM) 68 (1), 1-39	175	2021
Competitive Caching with Machine Learned Advice T Lykouris, S Vassilvitskii Journal of the ACM (JACM) 68 (4), 1-25	168	2021
The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication M Abadi, B Blanchet, C Fournet Journal of the ACM (JACM) 65 (1), 1-41	123	2017
The Reachability Problem for Petri Nets Is Not Elementary W Czerwiński, S Lasota, R Lazić, JÉ Leroux, F Mazowiecki Journal of the ACM (JACM) 68 (1), 1-28	119	2020
Fair Enough: Guaranteeing Approximate Maximin Shares D Kurokawa, AD Procaccia, J Wang Journal of the ACM (JACM) 65 (2), 1-27	110	2018
Subcubic Equivalences Between Path, Matrix, and Triangle Problems VV Williams, RR Williams Journal of the ACM (JACM) 65 (5), 1-38	97	2018
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device Z Brakerski, P Christiano, U Mahadev, U Vazirani, T Vidick Journal of the ACM (JACM) 68 (5), 1-47	86	2021
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space T Gagie, G Navarro, N Prezza Journal of the ACM (JACM) 67 (1), 1-54	83	2020
Planar Graphs Have Bounded Queue-Number V Dujmović, G Joret, P Micek, P Morin, T Ueckerdt, DR Wood Journal of the ACM (JACM) 67 (4), 1-38	80	2020
Distributed Exact Shortest Paths in Sublinear Time M Elkin Journal of the ACM (JACM) 67 (3), 1-36	79	2020
On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points C Jin, P Netrapalli, R Ge, SM Kakade, MI Jordan Journal of the ACM (JACM) 68 (2), 1-29	74	2021
Faster Polynomial Multiplication over Finite Fields D Harvey, JVD Hoeven, G Lecerf Journal of the ACM (JACM) 63 (6), 1-23	72	2017
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time D Chakraborty, D Das, E Goldenberg, M Koucký, M Saks Journal of the ACM (JACM) 67 (6), 1-22	67	2020
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets MSE Din, É Schost Journal of the ACM (JACM) 63 (6), 1-37	66	2017
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce M Boroujeni, S Ehsani, M Ghodsi, M Hajiaghayi, S Seddighin Journal of the ACM (JACM) 68 (3), 1-41	66	2021
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem O Svensson, J Tarnawski, LA Végh Journal of the ACM (JACM) 67 (6), 1-53	64	2020
The Power of Localization for Efficiently Learning Linear Separators with Noise P Awasthi, MF Balcan, PM Long Journal of the ACM (JACM) 63 (6), 1-27	62	2017
On the Parameterized Complexity of Approximating Dominating Set CS Karthik, B Laekhanukit, P Manurangsi JOURNAL OF THE ACM 66 (5)	62	2019

1 - 20

计算机程序会自动估算并确定日期和引用次数。