Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting

Author： Kaplan Haim   Ramos Edgar   Sharir Micha  

Publisher： Springer Publishing Company

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.45, Iss.1, 2011-01, pp. : 3-33

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Range Counting over Multidimensional Data Streams

By Suri Subhash   Toth Csaba D.   Zhou Yunhong  

Discrete & Computational Geometry, Vol. 36, Iss. 4, 2006-12 ,pp. : 633-655

Springer Publishing Company

Access to resources Recommend Favorite

THE RANGE OF TREE-INDEXED RANDOM WALK

By  

Journal of the Institute of Mathematics of Jussieu, Vol. 15, Iss. 2, 2016-04 ,pp. : 271-317

Cambridge University Press

Access to resources Recommend Favorite

On long-range dependence of random measures

By  

Advances in Applied Probability, Vol. 48, Iss. 4, 2017-01 ,pp. : 1235-1255

Cambridge University Press

Access to resources Recommend Favorite

The Effect of Corners on the Complexity of Approximate Range Searching

By Arya Sunil   Malamatos Theocharis   Mount David  

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 398-443

Springer Publishing Company

Access to resources Recommend Favorite

Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space

By Afshani Peyman   Hamilton Chris   Zeh Norbert  

Discrete & Computational Geometry, Vol. 45, Iss. 4, 2011-06 ,pp. : 824-850

Springer Publishing Company

Access to resources Recommend Favorite