Near-Optimal Online Multiselection in Internal and External Memory, Jonathan P. Sorenson, Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao
Ankur Gupta

On the Size of Succinct Indices, Alexander Golynski, Ankur Gupta
Ankur Gupta

Near-optimal online multiselection in internal and external memory, Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
Ankur Gupta

Near-optimal online multiselection in internal and external memory, Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
Jonathan P. Sorenson

Near-Optimal Online Multiselection in Internal and External Memory, Jonathan P. Sorenson, Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao
Scholarship and Professional Work - LAS

Theory and Implementation of Online Multiselection Algorithms, Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Satti, Jonathan Sorenson
Scholarship and Professional Work - LAS

Theory and Implementation of Online Multiselection Algorithms, Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
Ankur Gupta

Theory and Implementation of Online Multiselection Algorithms, Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
Jonathan P. Sorenson

A Framework for Dynamizing Succinct Data Structures, Ankur Gupta, Wing K. Hon, Rahul Shah, Jeffery S. Vitter
Ankur Gupta

Online Sorting via Searching and Selection, Ankur Gupta, Anna Kispert, Jonathan Sorenson
Scholarship and Professional Work - LAS

Online Sorting via Searching and Selection, Ankur Gupta, Anna Kispert, Jonathan P. Sorenson
Ankur Gupta

Online Sorting via Searching and Selection, Ankur Gupta, Anna Kispert, Jonathan P. Sorenson
Jonathan P. Sorenson

On Searching Compressed String Collections Cache-Obliviously, Ankur Gupta, Paolo Ferragina, Roberto Grossi, Rahul Shah, Jeffrey Vitter
Scholarship and Professional Work - LAS

On Searching Compressed String Collections Cache-Obliviously, Ankur Gupta, Paolo Ferragina, Roberto Grossi, Rahul Shah, Jeffrey Vitter
Ankur Gupta

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform., Roberto Grossi, Ankur Gupta, Jeffery Vitter
Scholarship and Professional Work - LAS

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform., Roberto Grossi, Ankur Gupta, Jeffery Vitter
Ankur Gupta

A Framework for Dynamizing Succinct Data Structures, Ankur Gupta, Wing K. Hon, Rahul Shah, Jeffery S. Vitter
Scholarship and Professional Work - LAS

On the Size of Succinct Indices, Alexander Golynski, Ankur Gupta
Scholarship and Professional Work - LAS

On the Size of Succinct Indices, Alexander Golynski, Ankur Gupta, Roberto Grossi, Rajeev Raman, Satti Rao
Scholarship and Professional Work - LAS

On the Size of Succinct Indices, Alexander Golynski, Ankur Gupta, Roberto Grossi, Rajeev Raman, Satti Rao
Ankur Gupta

Compressed data structures: dictionaries and data-aware measures, Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffery Vitter
Scholarship and Professional Work - LAS

Compressed dictionaries: Space measures, data sets, and experiments, Ankur Gupta, Wing-kai Hon, Rahul Shah, Jeffery S. Vitter
Ankur Gupta

When indexing equals compression: Experiments with compressing suffix arrays and applications, Roberto Grossi, Ankur Gupta, Jeffrey Vitter
Scholarship and Professional Work - LAS

When indexing equals compression: Experiments with compressing suffix arrays and applications, Roberto Grossi, Ankur Gupta, Jeffrey Vitter
Ankur Gupta