当前期刊: Journal of the ACM Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited*
    J. ACM (IF 1.686) Pub Date : 2020-05-13
    Laasya Bangalore; Ashish Choudhury; Arpita Patra

    The problem of Byzantine Agreement (BA) is of interest to both the distributed computing and cryptography communities. Following well-known results from distributed computing literature, the BA problem in the asynchronous network setting encounters inevitable non-termination issues. The impasse is overcome via randomization that allows construction of BA protocols in two flavors of termination guarantee—with

    更新日期:2020-06-30
  • Distributed Exact Shortest Paths in Sublinear Time
    J. ACM (IF 1.686) Pub Date : 2020-05-13
    Michael Elkin

    The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in O(n) time, where n is the number of vertices in the input graph G. Peleg and Rubinovich [49] showed a lower bound of ˜Ω(D + √ n) for this problem, where D is the hop-diameter of G. Whether or not this problem

    更新日期:2020-06-30
  • Representative Sets and Irrelevant Vertices: New Tools for Kernelization
    J. ACM (IF 1.686) Pub Date : 2020-06-02
    Stefan Kratsch; Magnus WahlströM

    We continue the development of matroid-based techniques for kernelization, initiated by the present authors [47]. We significantly extend the usefulness of matroid theory in kernelization by showing applications of a result on representative sets due to Lovász [51] and Marx [53]. As a first result, we show how representative sets can be used to derive a polynomial kernel for the elusive ALMOST 2-SAT

    更新日期:2020-06-30
  • Fully Online Matching
    J. ACM (IF 1.686) Pub Date : 2020-05-13
    Zhiyi Huang; Ning Kang; Zhihao Gavin Tang; Xiaowei Wu; Yuhao Zhang; Xue Zhu

    We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors’ arrivals. If a vertex remains unmatched until its deadline, then the algorithm must irrevocably either match it to an unmatched neighbor or leave

    更新日期:2020-06-30
  • A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
    J. ACM (IF 1.686) Pub Date : 2020-06-17
    Sharath Raghvendra; Pankaj K. Agarwal

    For point sets A, B ⊂ Rd, ∣A∣ = ∣B∣ = n, and for a parameter ε > 0, we present a Monte Carlo algorithm that computes, in O(npoly(log n, 1/ε)) time, an ε-approximate perfect matching of A and B under any Lp-norm with high probability; the previously best-known algorithm takes Ω(n3/2) time. We approximate the Lp-norm using a distance function, d(⋅, ⋅) based on a randomly shifted quad-tree. The algorithm

    更新日期:2020-06-30
  • A Simple and Approximately Optimal Mechanism for an Additive Buyer
    J. ACM (IF 1.686) Pub Date : 2020-06-16
    Moshe Babaioff; Nicole Immorlica; Brendan Lucier; S. Matthew Weinberg

    更新日期:2020-06-16
  • Embeddability in R3 is NP-hard
    J. ACM (IF 1.686) Pub Date : 2020-06-04
    Arnaud de Mesmay; Yo’av Rieck; Eric Sedgwick; Martin Tancer

    We prove that the problem of deciding whether a two- or three-dimensional simplicial complex embeds into R3 is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an S3 filling is NP-hard. The former stands in contrast with the lower-dimensional cases, which can be solved in linear time, and the latter with a variety of computational problems in 3-manifold

    更新日期:2020-06-04
  • Scene Grammars, Factor Graphs, and Belief Propagation
    J. ACM (IF 1.686) Pub Date : 2020-05-30
    Jeroen Chua; Pedro F. Felzenszwalb

    We describe a general framework for probabilistic modeling of complex scenes and for inference from ambiguous observations. The approach is motivated by applications in image analysis and is based on the use of priors defined by stochastic grammars. We define a class of grammars that capture relationships between the objects in a scene and provide important contextual cues for statistical inference

    更新日期:2020-05-30
  • Planar Graph Perfect Matching Is in NC
    J. ACM (IF 1.686) Pub Date : 2020-05-30
    Nima Anari; Vijay V. Vazirani

    Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC perfect matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder than

    更新日期:2020-05-30
  • The Log-Approximate-Rank Conjecture is False
    J. ACM (IF 1.686) Pub Date : 2020-04-21
    Arkadev Chattopadhyay; Nikhil S. Mande; Suhail Sherif

    We construct a simple and total function F = f ? XOR on 2n variables that has only O(?n) spectral norm, O(n2) approximate rank and O(n2.5) approximate nonnegative rank. We show it has polynomially large randomized bounded-error communication complexity of ?(?n). This yields the first exponential gap between the logarithm of the approximate rank and randomized communication complexity for total functions

    更新日期:2020-04-21
  • Planar Graphs have Bounded Queue-Number
    J. ACM (IF 1.686) Pub Date : 2020-02-24
    Vida Dujmovic; Gwenael Joret; Piotr Micek; Pat Morin; Torsten Ueckerdt; David Wood

    We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has a vertex-partition and a layering, such that each part has a bounded number of vertices in each layer, and the quotient graph has bounded treewidth. This result

    更新日期:2020-02-24
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
AI核心技术
10years
自然科研线上培训服务
材料学研究精选
Springer Nature Live 产业与创新线上学术论坛
胸腔和胸部成像专题
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
杨超勇
周一歌
华东师范大学
段炼
清华大学
廖矿标
李远
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
福州大学
南京大学
王杰
左智伟
电子显微学
何凤
洛杉矶分校
吴杰
赵延川
试剂库存
天合科研
down
wechat
bug