Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
暂无分享,去创建一个
[1] Peter Bro Miltersen. On the Cell Probe Complexity of Polynomial Evaluation , 1995, Theor. Comput. Sci..
[2] Omri Weinstein,et al. Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[3] Mihai Patrascu,et al. Unifying the Landscape of Cell-Probe Lower Bounds , 2010, SIAM J. Comput..
[4] Christopher Umans,et al. Fast Modular Composition in any Characteristic , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[5] Ronald de Wolf,et al. Bounds for small-error and zero-error quantum algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[6] Allan Grønlund Jørgensen,et al. New Unconditional Hardness Results for Dynamic and Online Problems , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[7] Mihai Patrascu. Lower bounds for 2-dimensional range counting , 2007, STOC '07.
[8] Mikkel Thorup. Mihai Pǎtraşcu: obituary and open problems , 2013, SIGA.
[9] Erik D. Demaine,et al. Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..
[10] Rina Panigrahy,et al. Lower Bounds on Near Neighbor Search via Metric Expansion , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[11] Kasper Green Larsen. The cell probe complexity of dynamic range counting , 2011, STOC '12.
[12] Pankaj K. Agarwal. Range Searching , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[13] Yitong Yin,et al. Cell-Probe Proofs , 2010, TOCT.
[14] Andrew Chi-Chih Yao,et al. Should Tables Be Sorted? , 1981, JACM.
[15] Erik D. Demaine,et al. Tight bounds for the partial-sums problem , 2004, SODA '04.
[16] Anna Gál,et al. The cell probe complexity of succinct data structures , 2007, Theor. Comput. Sci..
[17] Maarten Löffler,et al. Range Searching , 2016, Encyclopedia of Algorithms.
[18] Allan Grønlund Jørgensen,et al. Range selection and median: tight cell probe lower bounds and adaptive data structures , 2011, SODA '11.
[19] Michael E. Saks,et al. The cell probe complexity of dynamic data structures , 1989, STOC '89.
[20] Peter Sanders,et al. Towards optimal range medians , 2011, Theor. Comput. Sci..
[21] Kasper Green Larsen. Higher Cell Probe Lower Bounds for Evaluating Polynomials , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[22] Joseph JáJá,et al. Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting , 2004, ISAAC.
[23] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[24] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .