Lessons Learned from Exploring the Backtracking Paradigm on the GPU
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 425-437
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Debunking the 100X GPU vs. CPU mythACM SIGARCH Computer Architecture News, 2010
- Real-time KD-tree construction on graphics hardwareACM Transactions on Graphics, 2008
- GPU ComputingProceedings of the IEEE, 2008
- From pull-down data to protein interaction networks and complexes with biological relevanceBioinformatics, 2008
- Accelerating Large Graph Algorithms on the GPU Using CUDA2008
- MS2Grouper: Group assessment and synthetic replacement of duplicate proteomic tandem mass spectraJournal of the American Society for Mass Spectrometry, 2005
- KD-tree acceleration structures for a GPU raytracer2005
- Identification of Tertiary Structure Resemblance in Proteins Using a Maximal Common Subgraph Isomorphism AlgorithmJournal of Molecular Biology, 1993
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- On cliques in graphsIsrael Journal of Mathematics, 1965