Search results for "Srinivasa Rao Satti"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao	On Space Efficient Two Dimensional Range Minimum Data Structures.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao	External Memory Planar Point Location with Logarithmic Updates.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	S. Srinivasa Rao, B. Satyanarayana, M. M. M. Sarcar	Simulated verification of NC part programs from 2D images.	Int. J. Computer Integrated Manufacturing	2011	DBLP DOI BibTeX RDF
1	Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao	Encoding 2-D Range Maximum Queries	CoRR	2011	DBLP BibTeX RDF
1	Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao	Optimal Indexes for Sparse Bit Vectors	CoRR	2011	DBLP BibTeX RDF
1	J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao	Succinct Representations of Permutations and Functions	CoRR	2011	DBLP BibTeX RDF
1	Pooya Davoodi, S. Srinivasa Rao	Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet.	TAMC	2011	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao	Path Minima Queries in Dynamic Weighted Trees.	WADS	2011	DBLP DOI BibTeX RDF
1	Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao	Encoding 2D Range Maximum Queries.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti	Succinct indexes for strings, binary relations and multilabeled trees.	ACM Transactions on Algorithms	2011	DBLP DOI BibTeX RDF
1	Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann	Random Access to grammar-Compressed Strings.	SODA	2011	DBLP BibTeX RDF
1	Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti	Integer Representations towards Efficient Counting in the Bit Probe Model.	TAMC	2011	DBLP DOI BibTeX RDF
1	Jyrki Katajainen, S. Srinivasa Rao	A compact data structure for representing a dynamic multiset.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao	On Space Efficient Two Dimensional Range Minimum Data Structures.	ESA	2010	DBLP DOI BibTeX RDF
1	Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao	More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries	CoRR	2009	DBLP BibTeX RDF
1	Arash Farzan, Rajeev Raman, S. Srinivasa Rao	Universal Succinct Representations of Trees?	ICALP	2009	DBLP DOI BibTeX RDF
1	Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao	More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.	STACS	2009	DBLP DOI BibTeX RDF
1	Rasmus Pagh, Srinivasa Rao Satti	Secondary indexing in one dimension: beyond b-trees and bitmap indexes.	PODS	2009	DBLP DOI BibTeX RDF	range query, b-tree, bitmap index
1	Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann	Compressing Binary Decision Diagrams	CoRR	2008	DBLP BibTeX RDF
1	Rasmus Pagh, S. Srinivasa Rao	Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes	CoRR	2008	DBLP BibTeX RDF
1	Paolo Ferragina, S. Srinivasa Rao	Tree Compression and Indexing.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann	Compressing Binary Decision Diagrams.	ECAI	2008	DBLP DOI BibTeX RDF
1	Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao	External memory planar point location with logarithmic updates.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	dynamic data structure, external memory, point location, planar subdivisions
1	Alexander Golynski, Rajeev Raman, S. Srinivasa Rao	On the Redundancy of Succinct Data Structures.	SWAT	2008	DBLP DOI BibTeX RDF
1	Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao	Adaptive searching in succinctly encoded binary relations and tree-structured documents.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao	On the Size of Succinct Indices.	ESA	2007	DBLP DOI BibTeX RDF
1	Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao	Succinct indexes for strings, binary relations and multi-labeled trees.	SODA	2007	DBLP DOI BibTeX RDF
1	Meng He, J. Ian Munro, S. Srinivasa Rao	Succinct Ordinal Trees Based on Tree Covering.	ICALP	2007	DBLP DOI BibTeX RDF
1	Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti	Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures
1	Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti	Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets	CoRR	2007	DBLP BibTeX RDF
1	Alexander Golynski, J. Ian Munro, S. Srinivasa Rao	Rank/select operations on large alphabets: a tool for text indexing.	SODA	2006	DBLP DOI BibTeX RDF
1	Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao	Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.	CPM	2006	DBLP DOI BibTeX RDF	intersection problem, multi-labeled trees, conjunctive queries, succinct data structures, labeled trees
1	David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao	Representing Trees of Higher Degree.	Algorithmica	2005	DBLP DOI BibTeX RDF	Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures
1	Anna Pagh, Rasmus Pagh, S. Srinivasa Rao	An optimal Bloom filter replacement.	SODA	2005	DBLP DOI BibTeX RDF
1	Meng He, J. Ian Munro, S. Srinivasa Rao	A categorization theorem on suffix arrays with applications to space efficient text indexes.	SODA	2005	DBLP DOI BibTeX RDF
1	Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari	Longest increasing subsequences in sliding windows.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	J. Ian Munro, S. Srinivasa Rao	Succinct Representations of Functions.	ICALP	2004	DBLP DOI BibTeX RDF
1	Rajeev Raman, S. Srinivasa Rao	Succinct Dynamic Dictionaries and Trees.	ICALP	2003	DBLP DOI BibTeX RDF
1	J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao	Succinct Representations of Permutations.	ICALP	2003	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao	Computing Refined Buneman Trees in Cubic Time.	WABI	2003	DBLP DOI BibTeX RDF
1	S. Srinivasa Rao	Time-space trade-offs for compressed suffix arrays.	Inf. Process. Lett.	2002	DBLP DOI BibTeX RDF
1	Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao	Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.	SODA	2002	DBLP DOI BibTeX RDF
1	Juha Kärkkäinen, S. Srinivasa Rao	Full-Text Indexes in External Memory.	Algorithms for Memory Hierarchies	2002	DBLP DOI BibTeX RDF
1	J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao	Space Efficient Suffix Trees.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao	Explicit Deterministic Constructions for Membership in the Bitprobe Model.	ESA	2001	DBLP DOI BibTeX RDF
1	Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao	Succinct Dynamic Data Structures.	WADS	2001	DBLP DOI BibTeX RDF
1	Venkatesh Raman, S. Srinivasa Rao	Static Dictionaries Supporting Rank.	ISAAC	1999	DBLP DOI BibTeX RDF
1	Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao	A Simplified NP-Complete MAXSAT Problem.	Inf. Process. Lett.	1998	DBLP DOI BibTeX RDF
1	J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao	Space Efficient Suffix Trees.	FSTTCS	1998	DBLP DOI BibTeX RDF

Publications of Srinivasa Rao Satti S. Srinivasa Rao ( http://dblp.L3S.de/Authors/Srinivasa_Rao_Satti )