JOLACM - volume 67 - 2020 论文列表 |
点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
Michel X. Goemans Thomas Rothvoss
电商所评分:4
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.Ola Svensson Jakub Tarnawski László A. Végh
电商所评分:10
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.Diptarka Chakraborty Debarati Das Elazar Goldenberg Michal Koucký Michael E. Saks
电商所评分:7
Invited Articles Foreword.电商所评分:6
Semantic Optimization of Conjunctive Queries.Pablo Barceló Diego Figueira Georg Gottlob Andreas Pieris
电商所评分:7
A Unified Translation of Linear Temporal Logic to ω-Automata.Javier Esparza Jan Kretínský Salomon Sickert
电商所评分:8
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes.Hassan Ashtiani Shai Ben-David Nicholas J. A. Harvey Christopher Liaw Abbas Mehrabian Yaniv Plan
电商所评分:6
电商所评分:4
A Proof of the CSP Dichotomy Conjecture.电商所评分:1
Invited Articles Foreword.电商所评分:9
Universally Composable Security.电商所评分:1
Parallelism in Randomized Incremental Algorithms.Guy E. Blelloch Yan Gu Julian Shun Yihan Sun
电商所评分:1
Oracle-efficient Online Learning and Auction Design.Miroslav Dudíte Nika Haghtalab Haipeng Luo Robert E. Schapire Vasilis Syrgkanis Jennifer Wortman Vaughan
电商所评分:8
电商所评分:7
A Simple and Approximately Optimal Mechanism for an Additive Buyer.Moshe Babaioff Nicole Immorlica Brendan Lucier S. Matthew Weinberg
电商所评分:6
The Log-Approximate-Rank Conjecture Is False.Arkadev Chattopadhyay Nikhil S. Mande Suhail Sherif
电商所评分:7
Planar Graphs Have Bounded Queue-Number.Vida Dujmovic Gwenaël Joret Piotr Micek Pat Morin Torsten Ueckerdt David R. Wood
电商所评分:4
Planar Graph Perfect Matching Is in NC.电商所评分:6
Embeddability in R3 is NP-hard.Arnaud de Mesmay Yo'av Rieck Eric Sedgwick Martin Tancer
电商所评分:3
Scene Grammars, Factor Graphs, and Belief Propagation.Jeroen Chua Pedro F. Felzenszwalb
电商所评分:5
Sharath Raghvendra Pankaj K. Agarwal
电商所评分:5
Fully Online Matching.Zhiyi Huang Ning Kang Zhihao Gavin Tang Xiaowei Wu Yuhao Zhang Xue Zhu
电商所评分:1
Representative Sets and Irrelevant Vertices: New Tools for Kernelization.Stefan Kratsch Magnus Wahlström
电商所评分:2
Distributed Exact Shortest Paths in Sublinear Time.电商所评分:7
The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited.Laasya Bangalore Ashish Choudhury Arpita Patra
电商所评分:8
电商所评分:4
Invited Article Foreword.电商所评分:1
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.Dariusz R. Kowalski Miguel A. Mosteiro
电商所评分:10
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization.电商所评分:10
Frege Systems for Quantified Boolean Logic.Olaf Beyersdorff Ilario Bonacina Leroy Chew Ján Pich
电商所评分:6
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree.Vishwas Bhargava Shubhangi Saraf Ilya Volkovich
电商所评分:2
Yuval Emek Shay Kutten Ron Lavi Yangguang Shi
电商所评分:8
Differential Equation Invariance Axiomatization.电商所评分:5
Detecting an Odd Hole.Maria Chudnovsky Alex Scott Paul D. Seymour Sophie Spirkl
电商所评分:4
Foundations of Context-aware Preference Propagation.Paolo Ciaccia Davide Martinenghi Riccardo Torlone
电商所评分:3
Silence.电商所评分:2
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space.Travis Gagie Gonzalo Navarro Nicola Prezza
电商所评分:10
Matrix Multiplication, a Little Faster.电商所评分:1