暂无分享,去创建一个
[1] Ronitt Rubinfeld,et al. A Local Algorithm for Constructing Spanners in Minor-Free Graphs , 2016, APPROX-RANDOM.
[2] Ronitt Rubinfeld,et al. Constructing near spanning trees with few local inspections , 2015, Random Struct. Algorithms.
[3] Rephael Wenger,et al. Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.
[4] Boaz Patt-Shamir,et al. Constant-Time Local Computation Algorithms , 2017, Theory of Computing Systems.
[5] Soumojit Sarkar,et al. Fully dynamic randomized algorithms for graph spanners , 2012, TALG.
[6] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.
[7] Dana Ron,et al. Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs , 2014, ESA.
[8] David P. Woodruff,et al. Spanners and sparsifiers in dynamic streams , 2014, PODC.
[9] Bilel Derbel,et al. On the locality of distributed sparse spanner construction , 2008, PODC '08.
[10] Baruch Awerbuch,et al. Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[11] Mohsen Ghaffari,et al. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation , 2018, SODA.
[12] Gregory Schwartzman,et al. Derandomizing local distributed algorithms under bandwidth restrictions , 2016, Distributed Computing.
[13] Oded Goldreich. A Brief Introduction to Property Testing , 2010, Property Testing.
[14] Rina Panigrahy,et al. Spectral sparsification via random spanners , 2012, ITCS '12.
[15] Seth Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons , 2009, Distributed Computing.
[16] Yishay Mansour,et al. A Local Computation Approximation Scheme to Maximum Matching , 2013, APPROX-RANDOM.
[17] Bilel Derbel,et al. Local Computation of Nearly Additive Spanners , 2009, DISC.
[18] Ronitt Rubinfeld,et al. Fast Local Computation Algorithms , 2011, ICS.
[19] Ronitt Rubinfeld,et al. Local Algorithms for Sparse Spanning Graphs , 2014, Algorithmica.
[20] Christoph Lenzen,et al. A Centralized Local Algorithm for the Sparse Spanning Graph Problem , 2018, ICALP.
[21] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[22] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[23] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[24] Yishay Mansour,et al. Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.
[25] Igor Rivin,et al. On some extremal problems in graph theory , 1999 .
[26] Baruch Awerbuch,et al. Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..
[27] Aravind Srinivasan,et al. Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.
[28] Alejandro A. Schäffer,et al. Graph spanners , 1989, J. Graph Theory.
[29] Bilel Derbel,et al. Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time , 2007, DISC.
[30] Michael Elkin,et al. Efficient Algorithms for Constructing Very Sparse Spanners and Emulators , 2016, SODA.
[31] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[32] Michael Elkin,et al. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.
[33] Bilel Derbel,et al. Fast deterministic distributed algorithms for sparse spanners , 2008, Theor. Comput. Sci..
[34] Dana Ron,et al. A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2013, ICALP.
[35] Sudipto Guha,et al. Graph sketches: sparsification, spanners, and subgraphs , 2012, PODS.
[36] Shang-Hua Teng,et al. Spectral Sparsification of Graphs , 2008, SIAM J. Comput..
[37] Massachusetts Instmite. Local Computation Algorithms for Graphs of Non-Constant Degrees , 2014 .
[38] Omer Reingold,et al. New techniques and tighter bounds for local computation algorithms , 2014, J. Comput. Syst. Sci..
[39] Sebastian Krinninger,et al. Fully Dynamic Spanners with Worst-Case Update Time , 2016, ESA.
[40] Noga Alon,et al. Space-efficient local computation algorithms , 2011, SODA.
[41] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, SIAM J. Comput..