Published in: LIPIcs, Volume 190, 19th International Symposium on Experimental Algorithms (SEA 2021)
Seungbum Jo, Wooyoung Park, and Srinivasa Rao Satti. Practical Implementation of Encoding Range Top-2 Queries. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jo_et_al:LIPIcs.SEA.2021.10, author = {Jo, Seungbum and Park, Wooyoung and Satti, Srinivasa Rao}, title = {{Practical Implementation of Encoding Range Top-2 Queries}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.10}, URN = {urn:nbn:de:0030-drops-137827}, doi = {10.4230/LIPIcs.SEA.2021.10}, annote = {Keywords: Range top-2 query, Range minimum query, Cartesian tree, Succinct encoding} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, and Srinivasa Rao Satti. A Framework for In-place Graph Algorithms. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chakraborty_et_al:LIPIcs.ESA.2018.13, author = {Chakraborty, Sankardeep and Mukherjee, Anish and Raman, Venkatesh and Satti, Srinivasa Rao}, title = {{A Framework for In-place Graph Algorithms}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.13}, URN = {urn:nbn:de:0030-drops-94760}, doi = {10.4230/LIPIcs.ESA.2018.13}, annote = {Keywords: DFS, BFS, in-place algorithm, space-efficient graph algorithms, logspace} }
Published in: LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Gonzalo Navarro, Rajeev Raman, and Srinivasa Rao Satti. Asymptotically Optimal Encodings for Range Selection. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 291-301, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{navarro_et_al:LIPIcs.FSTTCS.2014.291, author = {Navarro, Gonzalo and Raman, Rajeev and Satti, Srinivasa Rao}, title = {{Asymptotically Optimal Encodings for Range Selection}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {291--301}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-77-4}, ISSN = {1868-8969}, year = {2014}, volume = {29}, editor = {Raman, Venkatesh and Suresh, S. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.291}, URN = {urn:nbn:de:0030-drops-48502}, doi = {10.4230/LIPIcs.FSTTCS.2014.291}, annote = {Keywords: Data Structures, Order Statistics, Succinct Data Structures, Space-efficient Data Structures} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Roberto Grossi, Alessio Orlandi, Rajeev Raman, and S. Srinivasa Rao. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 517-528, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{grossi_et_al:LIPIcs.STACS.2009.1847, author = {Grossi, Roberto and Orlandi, Alessio and Raman, Rajeev and Rao, S. Srinivasa}, title = {{More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {517--528}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1847}, URN = {urn:nbn:de:0030-drops-18470}, doi = {10.4230/LIPIcs.STACS.2009.1847}, annote = {Keywords: } }
Feedback for Dagstuhl Publishing