Search results for "bit-probe"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
64	M. Ziaur Rahman, J. Ian Munro	Integer Representation and Counting in the Bit Probe Model.	ISAAC	2007	DBLP DOI BibTeX RDF	bit probe model, data structure, lower bound, Gray code
43	Emanuele Viola	Bit-probe lower bounds for succinct data structures.	STOC	2009	DBLP DOI BibTeX RDF	bit-probe, cell-probe, logarithmic form, ternary value, lower bound, dictionary, succinct data structure, membership query
32	Rasmus Pagh	On the cell probe complexity of membership and perfect hashing.	STOC	2001	DBLP DOI BibTeX RDF
28	Corina E. Patrascu, Mihai Patrascu	On Dynamic Bit-Probe Complexity.	ICALP	2005	DBLP DOI BibTeX RDF
28	Peter Bro Miltersen	The Bit Probe Complexity Measure Revisited.	STACS	1993	DBLP DOI BibTeX RDF
25	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh 0001	The Quantum Complexity of Set Membership.	FOCS	2000	DBLP DOI BibTeX RDF	quantum complexity, static set membership problem, bit table, quantum bit-probe model, black-box unitary transform, oracle calls, basis state superposition, space-probe tradeoff, computational complexity, query processing, lower bounds, quantum computing, upper bounds, linear algebra, linear algebra, set theory, probes, query answering, query algorithm
25	Jaikumar Radhakrishnan, Venkatesh Raman 0001, S. Srinivasa Rao 0001	Explicit Deterministic Constructions for Membership in the Bitprobe Model.	ESA	2001	DBLP DOI BibTeX RDF
22	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh 0001	The Quantum Complexity of Set Membership.	Algorithmica	2002	DBLP DOI BibTeX RDF
18	Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy	Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes.	MFCS	2020	DBLP DOI BibTeX RDF
18	Mikhail A. Raskin	A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model.	ICALP	2017	DBLP DOI BibTeX RDF
18	Mikhail A. Raskin	A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model.	CoRR	2016	DBLP BibTeX RDF
18	Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti	Integer representations towards efficient counting in the bit probe model.	J. Discrete Algorithms	2014	DBLP DOI BibTeX RDF
18	Andrei E. Romashchenko	Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error.	Theory Comput. Syst.	2014	DBLP DOI BibTeX RDF
18	Emanuele Viola	Bit-Probe Lower Bounds for Succinct Data Structures.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
18	Andrei E. Romashchenko	Pseudo-random graphs and bit probe schemes with one-sided error	CoRR	2011	DBLP BibTeX RDF
18	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
18	Andrei E. Romashchenko	Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error.	CSR	2011	DBLP DOI BibTeX RDF
18	M. Ziaur Rahman, J. Ian Munro	Integer Representation and Counting in the Bit Probe Model.	Algorithmica	2010	DBLP DOI BibTeX RDF
18	Emanuele Viola	Bit-Probe Lower Bounds for Succinct Data Structures.	Electron. Colloquium Comput. Complex.	2009	DBLP BibTeX RDF
18	Mihai Patrascu, Corina E. Tarnita	On dynamic bit-probe complexity.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
10	Gianni Franceschini, Roberto Grossi	No sorting? better searching!	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Implicit data structures, in-place algorithms, searching, sorting