Result 1 to 20 of 179 total
On the complexity of the highway problem. (English)
Theor. Comput. Sci. 460, 70-77 (2012).
1
Two dimensional range minimum queries and Fibonacci lattices. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 217-228 (2012).
2
Succinct representations of binary trees for range minimum queries. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 396-407 (2012).
3
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. (English)
J. Discrete Algorithms 14, 119-135 (2012).
4
Dynamizing succinct tree representations. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 224-235 (2012).
5
Uncertainty in sequential pattern mining. (English)
MacKinnon, Lachlan M. (ed.), Data security and security data. 27th British national conference on databases, BNCOD 27, Dundee, UK, June 29‒July 1, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25703-2/pbk). Lecture Notes in Computer Science 6121, 147-150 (2012).
6
Succinct representations of permutations and functions. (English)
Theor. Comput. Sci. 438, 74-88 (2012).
7
Colouring vertices of triangle-free graphs without forests. (English)
Discrete Math. 312, No. 7, 1372-1385 (2012).
8
Encoding 2D range maximum queries. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 180-189 (2011).
9
Mining sequential patterns from probabilistic databases. (English)
Huang, Joshua Zhexue (ed.) et al., Advances in knowledge discovery and data mining. 15th Pacific-Asia conference, PAKDD 2011, Shenzhen, China, May 24‒27, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-20846-1/pbk). Lecture Notes in Computer Science 6635. Lecture Notes in Artificial Intelligence, 210-221 (2011).
10
Multilevel secure data stream processing. (English)
Li, Yingjiu (ed.), Data and applications security and privacy XXV. 25th annual IFIP WG 11.3 conference, DBSec 2011, Richmond, VA, USA, July 11‒13, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22347-1/pbk). Lecture Notes in Computer Science 6818, 122-137 (2011).
11
An empirical evaluation of extendible arrays. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 447-458 (2011).
12
Max-coloring and online coloring with bandwidths on interval graphs (English)
ACM Transactions on Algorithms 7, No. 3, 35 (2011).
13
Intelligent analytics: integrating business intelligence and web analytics (English)
IJBIR 2, No. 1, 31-45 (2011).
14
Random access to grammar-compressed strings (English)
SODA, 373-389 (2011).
15
Mining sequential patterns from probabilistic databases (English)
PAKDD (2), 210-221 (2011).
16
An empirical evaluation of extendible arrays (English)
SEA, 447-458 (2011).
17
Drhj: the cure to your multicore programming woes (English)
OOPSLA Companion, 5-6 (2011).
18
The design and implementation of the habanero-Java parallel programming language (English)
OOPSLA Companion, 185-186 (2011).
19
Multilevel secure data stream processing (English)
DBSec, 122-137 (2011).
20
Result 1 to 20 of 179 total
Start
Contact
Print
General Help
