Working Paper (78)

361.
Working Paper
Becchetti, L.; Clementi, A.; Natale, E.; Pasquale, F.; Trevisan, L.: Finding a Bounded-Degree Expander Inside a Dense One. (2018), 21 pp.
362.
Working Paper
Bernard, F.; Thunberg, J.; Goncalves, J.; Theobalt, C.: Synchronisation of Partial Multi-Matchings via Non-negative Factorisations. (2018), 18 pp.
363.
Working Paper
Bernard, F.; Thunberg, J.; Swoboda, P.; Theobalt, C.: Higher-order Projected Power Iterations for Scalable Multi-Matching. (2018), 10 pp.
364.
Working Paper
Bhattacharyya, A.; Fritz, M.; Schiele, B.: Bayesian Prediction of Future Street Scenes through Importance Sampling based Optimization. (2018), 14 pp.
365.
Working Paper
Bhattacherjee, D.; Jyothi, S. A.; Bozkurt, I. N.; Tirmazi, M.; Aqeel, W.; Aguirre, A.; Chandrasekaran, B.; Godfrey, P. B.; Laughlin, G. P.; Maggs, B. M. et al.; Singla, A.: cISP: A Speed-of-Light Internet Service Provider. (2018), 15 pp.
366.
Working Paper
Biega, A. J.; Gummadi, K. P.; Weikum, G.: Equity of Attention: Amortizing Individual Fairness in Rankings. (2018), 10 pp.
367.
Working Paper
Bozkurt, I. N.; Aqeel, W.; Bhattacherjee, D.; Chandrasekaran, B.; Godfrey, P. B.; Laughlin, G.; Maggs, B. M.; Singla, A.: Dissecting Latency in the Internet's Fiber Infrastructure. (2018), 15 pp.
368.
Working Paper
Bringmann, K.; Cabello, S.; Emmerich, M. T. M.: Maximum Volume Subset Selection for Anchored Boxes. (2018), 25 pp.
369.
Working Paper
Bringmann, K.; Husfeldt, T.; Magnusson, M.: Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. (2018), 18 pp.
370.
Working Paper
Bringmann, K.; Künnemann, M.: Multivariate Fine-Grained Complexity of Longest Common Subsequence. (2018), 66 pp.
371.
Working Paper
Bringmann, K.; Künnemann, M.; Nusser, A.: Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. (2018), 40 pp.
372.
Working Paper
Bringmann, K.; Ray Chaudhury, B.: Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. (2018), 16 pp.
373.
Working Paper
Bringmann, K.; Wellnitz, P.: Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. (2018), 15 pp.
374.
Working Paper
Bund, J.; Lenzen, C.; Medina, M.: Small Hazard-free Transducers. (2018), 35 pp.
375.
Working Paper
Bund, J.; Lenzen, C.; Medina, M.: Optimal Metastability-Containing Sorting Networks. (2018), 14 pp.
376.
Working Paper
Castelli Aleardi, L.; Salihoglu, S.; Singh, G.; Ovsjanikov, M.: Spectral Measures of Distortion for Change Detection in Dynamic Graphs. (2018)
377.
Working Paper
Chalermsook, P.; Das, S.; Even, G.; Laekhanukit, B.; Vaz, D.: Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. (2018), 28 pp.
378.
Working Paper
Chalermsook, P.; Schmid, A.; Uniyal, S.: A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. (2018), 64 pp.
379.
Working Paper
Cheung, Y. K.; Cole, R.; Tao, Y.: Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. (2018), 16 pp.
380.
Working Paper
Cheung, Y. K.; Cole, R.; Tao, Y.: (Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. (2018), 48 pp.
Go to Editor View