Combined data structure for previous- and next-smaller-values

Let A be a static array storing n elements from a totally ordered set. We present a data structure of optimal size at most nlog"2(3+22)+o(n) bits that allows us to answer the following queries on A in constant time, without accessing A: (1) previous smaller value queries, where given an index i, we wish to find the first index to the left of i where A is strictly smaller than at i, and (2) next smaller value queries, which search to the right of i. As an additional bonus, our data structure also allows one to answer a third kind of query: given indices i

[1]  Gonzalo Navarro,et al.  Fully compressed suffix trees , 2008, TALG.

[2]  Enno Ohlebusch,et al.  A Compressed Enhanced Suffix Array Supporting Fast String Matching , 2009, SPIRE.

[3]  Gonzalo Navarro,et al.  Compressed full-text indexes , 2007, CSUR.

[4]  Johannes Fischer,et al.  Optimal Succinctness for Range Minimum Queries , 2008, LATIN.

[5]  Renzo Sprugnoli,et al.  Waiting patterns for a printer , 2004, Discret. Appl. Math..

[6]  Roberto Grossi,et al.  Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..

[7]  R. Stanley.  Enumerative Combinatorics: Volume 1 , 2011 .

[8]  S. Srinivasa Rao,et al.  Succinct Ordinal Trees Based on Tree Covering , 2007, ICALP.

[9]  S. Srinivasa Rao,et al.  Space Efficient Suffix Trees , 1998, J. Algorithms.

[10]  Arash Farzan.  Succinct Representation of Trees and Graphs , 2009 .

[11]  Gonzalo Navarro,et al.  Faster entropy-bounded compressed suffix trees , 2009, Theor. Comput. Sci..

[12]  Gonzalo Navarro,et al.  Practical Compressed Suffix Trees , 2010, SEA.

[13]  Johannes Fischer,et al.  Wee LCP , 2009, Inf. Process. Lett..

[14]  Rajeev Raman,et al.  Representing Trees of Higher Degree , 2005, Algorithmica.

[15]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[16]  Kunihiko Sadakane,et al.  Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.

[17]  J. Ian Munro,et al.  A Uniform Approach Towards Succinct Representation of Trees , 2008, SWAT.

[18]  Uzi Vishkin,et al.  Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.

[19]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.

[20]  Rajeev Raman,et al.  Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.

[21]  Gonzalo Navarro,et al.  Fully-functional succinct trees , 2010, SODA '10.

[22]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..