( en | de | ru )

 

Disambiguation of "Satti, Srinivasa Rao"

Author of the publication

copydeleteadd this publication to your clipboard
Set and array based hybrid data structure solution for Frequent Pattern Mining.

, and . ICDIM, page 14-19. IEEE, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Srinivasa Rao Bandi

Pulugurta Srinivasa Rao

Srinivasa Rao Goddu

Srinivasa Marimganti

Edgar Sattinger

 

Other publications of authors with the same name

Integer Representations towards Efficient Counting in the Bit Probe Model., , , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 206-217. Springer, (2011)Dynamic Compressed Strings with Random Access., , , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 504-515. Springer, (2013)Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems., , and . CoRR, (2017)Compact Encodings and Indexes for the Nearest Larger Neighbor Problem., , and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 53-64. Springer, (2015)Approximate query processing over static sets and sliding windows., , , and . Theor. Comput. Sci., (2021)Encodings for Range Selection and Top-k Queries., , , , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 553-564. Springer, (2013)Approximate Query Processing over Static Sets and Sliding Windows., , , and . ISAAC, volume 123 of LIPIcs, page 54:1-54:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Succinct Navigational Oracles for Families of Intersection Graphs on a Circle., , , , , and . CoRR, (2020)Optimal In-place Algorithms for Basic Graph Problems., , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 126-139. Springer, (2020)Optimal In-place Algorithms for Basic Graph Problems., , and . CoRR, (2019)