-
1
-
-
70350393266
-
Hash, displace, and compress
-
Fiat, A., and Sanders, P., eds., ESA, Springer
-
Belazzougui, D.; Botelho, F. C.; and Dietzfelbinger, M. 2009. Hash, displace, and compress. In Fiat, A., and Sanders, P., eds., ESA, volume 5757 of Lecture Notes in Computer Science, 682-693. Springer.
-
(2009)
Lecture Notes in Computer Science
, vol.5757
, pp. 682-693
-
-
Belazzougui, D.1
Botelho, F.C.2
Dietzfelbinger, M.3
-
2
-
-
0003670507
-
-
ISBN 0-12-091152-3: Academic Press, chapter 25
-
Berlekamp, E. R.; Conway, J. H.; and Guy, R. K. 1982. Winning Ways for your Mathematical Plays, volume 2. ISBN 0-12-091152-3: Academic Press, chapter 25.
-
(1982)
Winning Ways for Your Mathematical Plays
, vol.2
-
-
Berlekamp, E.R.1
Conway, J.H.2
Guy, R.K.3
-
3
-
-
66149167320
-
Efficient algorithms to rank and unrank permutations in lexicographic order
-
Bonet, B. 2008. Efficient algorithms to rank and unrank permutations in lexicographic order. In AAAI-Workshop on Search in AI and Robotics.
-
(2008)
AAAI-Workshop on Search in AI and Robotics
-
-
Bonet, B.1
-
6
-
-
38249012602
-
New methods for using cayley graphs in interconnection networks
-
Cooperman, G., and Finkelstein, L. 1992. New methods for using cayley graphs in interconnection networks. Discrete Applied Mathematics 37/38:95-118.
-
(1992)
Discrete Applied Mathematics
, vol.37-38
, pp. 95-118
-
-
Cooperman, G.1
Finkelstein, L.2
-
9
-
-
27344444060
-
Large-scale parallel breadth-first search
-
Veloso, M. M.; Kambhampati, S.; Veloso, M. M.; and Kambhampati, S., eds., AAAI Press / The MIT Press
-
Korf, R. E., and Schultze, P. 2005. Large-scale parallel breadth-first search. In Veloso, M. M.; Kambhampati, S.; Veloso, M. M.; and Kambhampati, S., eds., AAAI, 1380-1385. AAAI Press / The MIT Press.
-
(2005)
AAAI
, pp. 1380-1385
-
-
Korf, R.E.1
Schultze, P.2
-
12
-
-
36348993090
-
Twenty-six moves suffice for Rubik's cube
-
DOI 10.1145/1277548.1277581, ISSAC 2007 - Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation
-
Kunkle, D., and Cooperman, G. 2007. Twenty-six moves suffice for rubik's cube. In ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, 235-242. New York, NY, USA: ACM. (Pubitemid 350158146)
-
(2007)
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
, pp. 235-242
-
-
Kunkle, D.1
Cooperman, G.2
-
14
-
-
44849137198
-
NVIDIA Tesla: A unified graphics and computing architecture
-
DOI 10.1109/MM.2008.31
-
Lindholm, E.; Nickolls, J.; Oberman, S.; and Montrym, J. 2008. NVIDIA Tesla: A unified graphics and computing architecture. IEEE Micro 28(2):39-55. (Pubitemid 351796170)
-
(2008)
IEEE Micro
, vol.28
, Issue.2
, pp. 39-55
-
-
Lindholm, E.1
Nickolls, J.2
Oberman, S.3
Montrym, J.4
-
15
-
-
0032762510
-
I/O-complexity of graph algorithms
-
Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
-
Munagala, K., and Ranade, A. 1999. I/O-complexity of graph algorithms. In SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, 687-694. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics.
-
(1999)
SODA '99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 687-694
-
-
Munagala, K.1
Ranade, A.2
-
16
-
-
0035975708
-
Ranking and unranking permutations in linear time
-
DOI 10.1016/S0020-0190(01)00141-7, PII S0020019001001417
-
Myrvold, W., and Ruskey, F. 2001. Ranking and unranking permutations in linear time. Information Processing Letters 79(6):281-284. (Pubitemid 32771125)
-
(2001)
Information Processing Letters
, vol.79
, Issue.6
, pp. 281-284
-
-
Myrvold, W.1
Ruskey, F.2
-
17
-
-
49049088756
-
Gpu computing
-
Owens, J. D.; Houston, M.; Luebke, D.; Green, S.; Stone, J. E.; and Phillips, J. C. 2008. Gpu computing. Proceedings of the IEEE 96(5):879-899.
-
(2008)
Proceedings of the IEEE
, vol.96
, Issue.5
, pp. 879-899
-
-
Owens, J.D.1
Houston, M.2
Luebke, D.3
Green, S.4
Stone, J.E.5
Phillips, J.C.6
-
19
-
-
32944479332
-
Breadth-first heuristic search
-
Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170(4-5):385-408.
-
(2006)
Artificial Intelligence
, vol.170
, Issue.4-5
, pp. 385-408
-
-
Zhou, R.1
Hansen, E.2
|