-
1
-
-
84864334361
-
-
January
-
Apache: Xerces-c++ xml parser (January 2012), http://xerces.apache.org/ xerces-c/
-
(2012)
Xerces-c++ Xml Parser
-
-
-
2
-
-
84880338581
-
Succinct trees in practice
-
Blelloch, G.E., Halperin, D. (eds.) SIAM
-
Arroyuelo, D., Cánovas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX, pp. 84-97. SIAM (2010)
-
(2010)
ALENEX
, pp. 84-97
-
-
Arroyuelo, D.1
Cánovas, R.2
Navarro, G.3
Sadakane, K.4
-
3
-
-
77952795119
-
Fast in-memory xpath search using compressed indexes
-
Arroyuelo, D., Claude, F., Maneth, S., Mäkinen, V., Navarro, G., Nguyen, K., Sirén, J., Välimäki, N.: Fast in-memory xpath search using compressed indexes. In: ICDE, pp. 417-428 (2010)
-
(2010)
ICDE
, pp. 417-428
-
-
Arroyuelo, D.1
Claude, F.2
Maneth, S.3
Mäkinen, V.4
Navarro, G.5
Nguyen, K.6
Sirén, J.7
Välimäki, N.8
-
4
-
-
34547532086
-
A uni.ed access bound on comparison-based dynamic dictionaries
-
Badoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A uni.ed access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2), 86-96 (2007)
-
(2007)
Theor. Comput. Sci.
, vol.382
, Issue.2
, pp. 86-96
-
-
Badoiu, M.1
Cole, R.2
Demaine, E.D.3
Iacono, J.4
-
5
-
-
29544442998
-
Representing trees of higher degree
-
Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
-
(2005)
Algorithmica
, vol.43
, Issue.4
, pp. 275-292
-
-
Benoit, D.1
Demaine, E.D.2
Munro, J.I.3
Raman, R.4
Raman, V.5
Rao, S.S.6
-
6
-
-
34250206975
-
Compressed indexes for dynamic text collections
-
Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3(2) (2007)
-
(2007)
ACM Transactions on Algorithms
, vol.3
, Issue.2
-
-
Chan, H.L.1
Hon, W.K.2
Lam, T.W.3
Sadakane, K.4
-
8
-
-
33746086325
-
Engineering the LOUDS Succinct Tree Representation
-
Álvarez, C., Serna, M. (eds.) WEA 2006. Springer, Heidelberg
-
Delpratt, O., Rahman, N., Raman, R.: Engineering the LOUDS Succinct Tree Representation. In: Álvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 134-145. Springer, Heidelberg (2006)
-
(2006)
LNCS
, vol.4007
, pp. 134-145
-
-
Delpratt, O.1
Rahman, N.2
Raman, R.3
-
9
-
-
43349096828
-
Engineering succinct dom
-
Delpratt, O., Raman, R., Rahman, N.: Engineering succinct dom. In: EDBT, pp. 49-60 (2008)
-
(2008)
EDBT
, pp. 49-60
-
-
Delpratt, O.1
Raman, R.2
Rahman, N.3
-
10
-
-
79954703766
-
Succinct representation of dynamic trees
-
Farzan, A., Munro, J.I.: Succinct representation of dynamic trees. Theor. Comput. Sci. 412(24), 2668-2678 (2011);
-
(2011)
Theor. Comput. Sci.
, vol.412
, Issue.24
, pp. 2668-2678
-
-
Farzan, A.1
Munro, J.I.2
-
11
-
-
84864350083
-
-
prelim. version
-
prelim. version ICALP 2009
-
ICALP 2009
-
-
-
12
-
-
0024860011
-
The cell probe complexity of dynamic data structures
-
Johnson, D.S. (ed.) ACM
-
Fredman, M.L., Saks, M.E.: The cell probe complexity of dynamic data structures. In: Johnson, D.S. (ed.) STOC, pp. 345-354. ACM (1989)
-
(1989)
STOC
, pp. 345-354
-
-
Fredman, M.L.1
Saks, M.E.2
-
13
-
-
33751016062
-
A simple optimal representation for balanced parentheses
-
Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3), 231-246 (2006)
-
(2006)
Theor. Comput. Sci.
, vol.368
, Issue.3
, pp. 231-246
-
-
Geary, R.F.1
Rahman, N.2
Raman, R.3
Raman, V.4
-
14
-
-
33846642491
-
Succinct ordinal trees with level-ancestor queries
-
Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2(4), 510-534 (2006)
-
(2006)
ACM Transactions on Algorithms
, vol.2
, Issue.4
, pp. 510-534
-
-
Geary, R.F.1
Raman, R.2
Raman, V.3
-
15
-
-
0024770899
-
Space-efficient static trees and graphs
-
IEEE Computer Society
-
Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549-554. IEEE Computer Society (1989)
-
(1989)
FOCS
, pp. 549-554
-
-
Jacobson, G.1
-
16
-
-
0036306861
-
Succinct representation of balanced parentheses and static trees
-
Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762-776 (2001)
-
(2001)
SIAM J. Comput.
, vol.31
, Issue.3
, pp. 762-776
-
-
Munro, J.I.1
Raman, V.2
-
17
-
-
26844480640
-
Representing dynamic binary trees succinctly
-
Munro, J.I., Raman, V., Storm, A.J.: Representing dynamic binary trees succinctly. In: SODA, pp. 529-536 (2001)
-
(2001)
SODA
, pp. 529-536
-
-
Munro, J.I.1
Raman, V.2
Storm, A.J.3
-
18
-
-
35048820071
-
Succinct Representations of Functions
-
Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. Springer, Heidelberg
-
Munro, J.I., Rao, S.S.: Succinct Representations of Functions. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1006-1015. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3142
, pp. 1006-1015
-
-
Munro, J.I.1
Rao, S.S.2
-
20
-
-
21144449026
-
Succinct Dynamic Dictionaries and Trees
-
Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. Springer, Heidelberg
-
Raman, R., Rao, S.S.: Succinct Dynamic Dictionaries and Trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 357-368. Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2719
, pp. 357-368
-
-
Raman, R.1
Rao, S.S.2
-
21
-
-
77951686861
-
Fully-functional succinct trees
-
Charikar, M. (ed.) SIAM
-
Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Charikar, M. (ed.) SODA, pp. 134-149. SIAM (2010)
-
(2010)
SODA
, pp. 134-149
-
-
Sadakane, K.1
Navarro, G.2
-
22
-
-
0037647948
-
Xmark: A benchmark for xml data management
-
Morgan Kaufmann
-
Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: Xmark: A benchmark for xml data management. In: VLDB, pp. 974-985. Morgan Kaufmann (2002)
-
(2002)
VLDB
, pp. 974-985
-
-
Schmidt, A.1
Waas, F.2
Kersten, M.L.3
Carey, M.J.4
Manolescu, I.5
Busse, R.6
-
23
-
-
0022093855
-
Self-adjusting binary search trees
-
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652-686 (1985)
-
(1985)
J. ACM
, vol.32
, Issue.3
, pp. 652-686
-
-
Sleator, D.D.1
Tarjan, R.E.2
-
24
-
-
0003237296
-
Data Structures and Network Algorithms
-
Tarjan, R.E.: Data Structures and Network Algorithms. SIAM (1987)
-
(1987)
SIAM
-
-
Tarjan, R.E.1
-
25
-
-
70350502910
-
-
January
-
W3C: Document object model (January 2009), http://www.w3.org/DOM/
-
(2009)
Document Object Model
-
-
-
26
-
-
35348836049
-
Querying and maintaining a compact xml storage
-
Williamson, C.L., Zurko, M.E., Patel-Schneider, P.F., Shenoy, P.J. (eds.) ACM
-
Wong, R.K., Lam, F., Shui, W.M.: Querying and maintaining a compact xml storage. In: Williamson, C.L., Zurko, M.E., Patel-Schneider, P.F., Shenoy, P.J. (eds.) WWW, pp. 1073-1082. ACM (2007)
-
(2007)
WWW
, pp. 1073-1082
-
-
Wong, R.K.1
Lam, F.2
Shui, W.M.3
|