• Search: "Polynomial evaluation with preprocessing"

Showing 1 - 2 of 2

1

The cell probe complexity of succinct data structures
GAL, Anna ; MILTERSEN, Peter Bro
Automata, languages and programming (ICALP 2003)Theoretical computer science. 379(3):405-417

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Conference
Save to List
2

The Cell Probe Complexity of Succinct Data Structures
Gál, Anna ; Miltersen, Peter Bro ; Anna Gál and Peter Bro Miltersen ; et al.
Lecture Notes in Computer Science ISBN: 9783540404934
Miltersen, P B & Gal, A 2007, 'The Cell Probe Complexity of Succinct Data Structures', Theoretical Computer Science, vol. 379, no. 3, pp. 405-417. https://doi.org/10.1016/j.tcs.2007.02.047
Gal, A & Miltersen, P B 2003, The Cell Probe Complexity of Succinct Data Structures. in J C M Baeten, J K Lenstra, J Parrow & G J Wöeginger (eds), Automata, Languages and Programming : 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30-July 4, 2003 Proceedings. Springer, Lecture Notes in Computer Science, vol. 2719, pp. 442-453, International Colloquium on Automata, Languages and Programming. ICALP 2003, Eindhoven, Netherlands, 30/06/2003. https://doi.org/10.1007/3-540-45061-0_28

data structures lower bounds Cell probe model Polynomial evaluation wi... Cell probe complexity Succinct data structures …
Academic journal
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter