Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
暂无分享,去创建一个
Kyomin Jung | David P. Woodruff | Sofya Raskhodnikova | Madhav Jha | Arnab Bhattacharyya | Elena Grigorescu
[1] Edith Cohen,et al. Polylog-time and near-linear work approximation scheme for undirected shortest paths , 1994, STOC '94.
[2] Noga Alon,et al. OPTIMAL PREPROCESSING FOR S ANSWERING ON-LINE PRODUCT QUERIE , 1987 .
[3] Sofya Raskhodnikova. Transitive-Closure Spanners: A Survey , 2010, Property Testing.
[4] Mikkel Thorup,et al. Roundtrip spanners and roundtrip routing in directed graphs , 2002, SODA '02.
[5] Sandeep Sen,et al. Approximate distance oracles for unweighted graphs in expected O(n2) time , 2006, TALG.
[6] Giri Narasimhan,et al. Fast algorithms for constructing t-spanners and paths with stretch t , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[7] Michiel H. M. Smid,et al. Euclidean spanners: short, thin, and lanky , 1995, STOC '95.
[8] Mikkel Thorup,et al. Shortcutting Planar Digraphs , 1995, Combinatorics, Probability and Computing.
[9] Bernard Chazelle. Computing on a Free Tree via Complexity-Preserving Mappings , 1984, FOCS.
[10] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[11] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[12] William Hesse,et al. Directed graphs requiring large numbers of shortcuts , 2003, SODA '03.
[13] Kyomin Jung,et al. Transitive-Closure Spanners , 2008, SIAM J. Comput..
[14] Nicola Santoro,et al. Trade-Offs in Non-Reversing Diameter , 1994, Nord. J. Comput..
[15] Lenore Cowen,et al. Compact routing with minimum stretch , 1999, SODA '99.
[16] Kyomin Jung,et al. Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners , 2012, SIAM J. Discret. Math..
[17] Mikkel Thorup,et al. On Shortcutting Digraphs , 1992, WG.
[18] Mikkel Thorup,et al. Compact routing schemes , 2001, SPAA '01.
[19] Michael Elkin,et al. Computing almost shortest paths , 2001, TALG.
[20] Richard J. Lipton,et al. Lower Bounds for Constant Depth Circuits for Prefix Problems , 1983, ICALP.
[21] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[22] Raimund Seidel. Understanding the Inverse Ackermann Function , 2006 .
[23] Marina Blanton,et al. Dynamic and Efficient Key Management for Access Hierarchies , 2009, TSEC.
[24] Alejandro A. Schäffer,et al. Graph spanners , 1989, J. Graph Theory.
[25] Baruch Awerbuch,et al. Communication-time trade-offs in network synchronization , 1985, PODC '85.
[26] Michael E. Saks,et al. Local Monotonicity Reconstruction , 2010, SIAM J. Comput..
[27] Andrew Chi-Chih Yao,et al. Space-time tradeoff for answering range queries (Extended Abstract) , 1982, STOC '82.
[28] Mikkel Thorup,et al. Parallel Shortcutting of Rooted Trees , 1997, J. Algorithms.
[29] Lenore Cowen,et al. Compact roundtrip routing in directed networks , 2004, J. Algorithms.
[30] Bernard Chazelle,et al. Property-Preserving Data Reconstruction , 2004, Algorithmica.
[31] Giri Narasimhan,et al. Geometric spanner networks , 2007 .
[32] Richard J. Lipton,et al. Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..
[33] Eli Upfal,et al. A trade-off between space and efficiency for routing tables , 1989, JACM.
[34] Shay Solomon. An optimal-time construction of sparse Euclidean spanners with tiny diameter , 2011, SODA '11.
[35] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.