The cell probe complexity of succinct data structures
暂无分享,去创建一个
[1] Peter Bro Miltersen,et al. On data structures and asymmetric communication complexity , 1994, STOC '95.
[2] Miklós Ajtai,et al. A lower bound for finding predecessors in Yao's cell probe model , 1988, Comb..
[3] Gadiel Seroussi,et al. Vector sets for exhaustive testing of logic circuits , 1988, IEEE Trans. Inf. Theory.
[4] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.
[5] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[6] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[7] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[8] O. Danvy,et al. An Operational Foundation for Delimited Continuations , 2003 .
[9] Anders Møller,et al. Contracts for Cooperation between Web Service Programmers and HTML Designers , 2006, J. Web Eng..
[10] Venkatesan Guruswami,et al. List decoding from erasures: bounds and code constructions , 2001, IEEE Trans. Inf. Theory.
[11] P. Erdös,et al. Intersection Theorems for Systems of Sets , 1960 .
[12] David Thomas,et al. The Art in Computer Programming , 2001 .
[13] Michael E. Saks,et al. Products and help bits in decision trees , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[14] Peter Bro Miltersen,et al. On Data Structures and Asymmetric Communication Complexity , 1998, J. Comput. Syst. Sci..
[15] Jörg Abendroth. Applying pi-Calculus to Practice: An Example of a Unified Security Mechanism , 2003 .
[16] Faith Ellen,et al. Optimal Bounds for the Predecessor Problem and Related Problems , 2002, J. Comput. Syst. Sci..
[17] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[18] Erik D. Demaine,et al. A linear lower bound on index size for text retrieval , 2001, SODA '01.
[19] Glynn Winskel,et al. Domain theory for concurrency , 2003, Theor. Comput. Sci..
[20] Andrzej Filinski,et al. A Denotational Account of Untyped Normalization by Evaluation , 2003 .
[21] Peter Elias,et al. The Complexity of Some Simple Retrieval Problems , 1975, JACM.
[22] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[23] Yuval Rabani,et al. Tighter bounds for nearest neighbor search and related problems in the cell probe model , 2000, STOC '00.
[24] J. Ian Munro,et al. Membership in Constant Time and Almost-Minimum Space , 1999, SIAM J. Comput..
[25] Olivier Danvy,et al. A functional correspondence between monadic evaluators and abstract machines for languages with computational effects , 2003, Theor. Comput. Sci..
[26] Rasmus Pagh. Low Redundancy in Static Dictionaries with Constant Query Time , 2001, SIAM J. Comput..
[27] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[28] Rasmus Pagh. Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time , 1999, ICALP.
[29] Peter Bro Miltersen,et al. Are bitvectors optimal? , 2000, STOC '00.
[30] Peter Bro Miltersen. On the Cell Probe Complexity of Polynomial Evaluation , 1995, Theor. Comput. Sci..
[31] Joel H. Spencer,et al. Families of k-independent sets , 1973, Discret. Math..
[32] Ivan Damgård,et al. Unfair Noisy Channels and Oblivious Transfer , 2003, TCC.
[33] Navin Goyal,et al. A parallel search game , 2005 .
[34] Anna Gál,et al. The Cell Probe Complexity of Succinct Data Structures , 2003, ICALP.
[35] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[36] Faith Ellen,et al. Optimal bounds for the predecessor problem , 1999, STOC '99.
[37] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[38] Yuval Rabani,et al. Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model , 2002, J. Comput. Syst. Sci..
[39] Peter Bro Miltersen. The Bit Probe Complexity Measure Revisited , 1993, STACS.
[40] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..
[41] H. L. Abbott,et al. Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.
[42] Louis Salvail,et al. Computational Collapse of Quantum State with Application to Oblivious Transfer , 2003, TCC.
[43] Rajeev Raman,et al. Succinct Dynamic Data Structures , 2001, WADS.
[44] Bernard Chazelle,et al. A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube , 1999, STOC '99.
[45] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[46] Allan Borodin,et al. Lower bounds for high dimensional nearest neighbor search and related problems , 1999, STOC '99.
[47] Jaikumar Radhakrishnan,et al. Explicit Deterministic Constructions for Membership in the Bitprobe Model , 2001, ESA.