The success of initiatives recently launched to help create more new treatments hinges on bridging the sociological divides that persist in drug discovery and development.
New bounds on the locality of several classical symmetry breaking tasks in distributed networks are presented and a new technique for reducing symmetry breaking problems on low arboricity graphs to low degree graphs is introduced.
This article gives an algorithm that computes a (1 − 1 − 0))-approximate maximum weight matching in O(i) time, that is, optimal <i>linear time</i> for any fixed ε, and should be appealing in all applications that can tolerate a negligible relative error.
This paper proves that the decision tree complexity of 3SUM is O(n<sup>3/2</sup> √/log n) and proves that improved bounds for k-variate linear degeneracy testing for all odd k ≥ 3 are lead directly to improved bounds on triangle enumeration, dynamic graph algorithms, and string matching data structures.
It is established that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity and a deterministic algorithm to find aminimum spanning tree of a graph with vertices and edges that runs in time is presented.
It is proved that any randomized algorithm that solves an LCL problem in sublogarithmic time can be sped up to run in O(T_{LLL}) time, which is the complexity of the distributed Lovasz local lemma problem, currently known to be Ω( log log n) and 2^{O(sqrt{log log n})} on bounded degree graphs.
This article develops a couple of new techniques for constructing (α, β)-spanners and presents an additive (1,6)-spanner of size O, an economical agent that assigns costs and values to paths in the graph, and shows that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs.
This paper gives new and efficient reductions from 3SUM to offline SetDisjointness and offline SetIntersection and introduces new conditional lower bounds for dynamic versions of Maximum Cardinality Matching, which introduce a new technique for obtaining amortized lower bounds.
A distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times and another algorithm which provides (½-ε) approximation in general graphs in O(logε-1log n) time, improving on the previously known algorithms.
This paper gives an APBSP algorithm for edge-capacitated graphs running in O(n(3+ω)/2) time and a slightly faster O( n2.657)-time algorithm for vertex-capactitated graphs, and makes use of new hybrid products the authors call the distance-max-min product and dominance-distance product.