The cell probe complexity of dynamic range counting
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] Andrew Chi-Chih Yao,et al. Should Tables Be Sorted? , 1981, JACM.
[3] Amos Fiat,et al. How to find a battleship , 1989, Networks.
[4] Michael E. Saks,et al. The cell probe complexity of dynamic data structures , 1989, STOC '89.
[5] Erik D. Demaine,et al. Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..
[6] Mihai Patrascu. Lower bounds for 2-dimensional range counting , 2007, STOC '07.
[7] Mihai Patrascu. (Data) STRUCTURES , 2008, FOCS.
[8] Mihai Patrascu,et al. Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.
[9] Rina Panigrahy,et al. Lower Bounds on Near Neighbor Search via Metric Expansion , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[10] Allan Grønlund Jørgensen,et al. Range selection and median: tight cell probe lower bounds and adaptive data structures , 2011, SODA '11.
[11] Mikkel Thorup,et al. Don't rush into a union: take time to find your roots , 2011, STOC '11.
[12] Mihai Patrascu,et al. Unifying the Landscape of Cell-Probe Lower Bounds , 2010, SIAM J. Comput..
[13] Mihai Pa caron,et al. Unifying the Landscape of Cell-Probe Lower Bounds , 2011 .