Efficient computation of sparse structures
暂无分享,去创建一个
Aravind Srinivasan | Ehab Morsy | Peter Robinson | Gopal Pandurangan | David G. Harris | A. Srinivasan | Gopal Pandurangan | Peter Robinson | E. Morsy
[1] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[2] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[3] Micah Sherr,et al. Fair Maximal Independent Sets , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.
[4] Rajmohan Rajaraman,et al. Topology control and routing in ad hoc networks: a survey , 2002, SIGA.
[5] Jukka Suomela,et al. Survey of local algorithms , 2013, CSUR.
[6] Jonas Holmerin,et al. Towards optimal lower bounds for clique and chromatic number , 2003, Theor. Comput. Sci..
[7] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[8] N. Alon,et al. The Probabilistic Method: Alon/Probabilistic , 2008 .
[9] Roger Wattenhofer,et al. Local Computation , 2010, J. ACM.
[10] Shay Kutten,et al. Distributed Symmetry Breaking in Hypergraphs , 2014, DISC.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Maxim Sviridenko,et al. Concentration and moment inequalities for polynomials of independent random variables , 2012, SODA.
[13] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[14] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1985, JACM.
[15] Joel H. Spencer,et al. Turán's theorem for k-graphs , 1972, Discret. Math..
[16] Pierre Fraigniaud,et al. Local Distributed Decision , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[17] L. Moser,et al. AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .
[18] Naveen Chauhan,et al. Balancing Energy Consumption to Maximize Network Lifetime in Data- Gathering Sensor Networks , 2013 .
[19] Zsolt Tuza,et al. One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete , 1993, SIAM J. Comput..
[20] D. Sivakumar,et al. Algorithmic derandomization via complexity theory , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.