StringologyTimes

Data Structures and Algorithms: 2017/9/15-21

1: Optimal broadcasting in networks with faulty nodes
2: Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
3: Technical Report: Accelerating Dynamic Graph Analytics on GPUs
4: On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry
5: The Orthogonal Vectors Conjecture for Branching Programs and Formulas
6: String Attractors
7: Differential Privacy on Finite Computers
8: Process-oriented Iterative Multiple Alignment for Medical Process Mining
9: The Geometric Block Model
10: Lexico-minimum Replica Placement in Multitrees
11: New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine
12: Approximations for Generalized Unsplittable Flow on Paths with Application to Power Systems Optimization
13: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
14: Learning Neural Networks with Two Nonlinear Layers in Polynomial Time
15: Cache-Aware Lock-Free Concurrent Hash Tries
16: Crossing Patterns in Nonplanar Road Networks
17: Improving spliced alignment for identification of ortholog groups and multiple CDS alignment
18: Tilt Assembly: Algorithms for Micro-Factories That Build Objects with Uniform External Forces
19: Inference in Graphical Models via Semidefinite Programming Hierarchies
20: BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage
21: Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation
22: Dependent randomized rounding for clustering and partition systems with knapsack constraints
23: Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
24: Near Optimal Sketching of Low-Rank Tensor Regression
25: Accelerating PageRank using Partition-Centric Processing
26: Sorting with Recurrent Comparison Errors
27: A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries
28: Non-Depth-First Search against Independent Distributions on an AND-OR Tree