Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Brandon Dixon
2010 – today
- 2012
[c14]Paul Kilgo, Brandon Dixon, Monica Anderson: Computing 2D Robot Workspace in Parallel with CUDA. SIMPAR 2012: 287-298- 2011
- [j13]Li Ding, Dana Steil, Brandon Dixon, Allen S. Parrish, David Brown: A relation context oriented approach to identify strong ties in social networks. Knowl.-Based Syst. 24(8): 1187-1195 (2011)
- [j12]Dana Steil, Jeremy R. Pate, Nicholas A. Kraft, Randy K. Smith, Brandon Dixon, Li Ding, Allen S. Parrish: Patrol Routing Expression, Execution, Evaluation, and Engagement. IEEE Transactions on Intelligent Transportation Systems 12(1): 58-72 (2011)
2000 – 2009
- 2009
- [j11]Li Ding, Brandon Dixon, Allen S. Parrish: IRAS: An Inmates' Risk Assessment System. I. J. Comput. Appl. 16(2): 91-97 (2009)
- [c13]Li Ding, Dana Steil, Matthew Hudnall, Brandon Dixon, Randy K. Smith, David Brown, Allen S. Parrish: PerpSearch: An integrated crime detection system. ISI 2009: 161-163
- [c12]Li Ding, Xiaoyan Hong, Brandon Dixon: An Efficient Support of Range Queries over DHTs. PDPTA 2009: 67-73
- [c11]Li Ding, Bo Gu, Xiaoyan Hong, Brandon Dixon: Articulation Node Based Routing in Delay Tolerant Networks. PerCom Workshops 2009: 1-6
- 2008
- [c10]Li Ding, Brandon Dixon: Using an edge-dual graph and k-connectivity to identify strong connections in social networks. ACM Southeast Regional Conference 2008: 475-480
- 2005
- [j10]Allen S. Parrish, Susan V. Vrbsky, Brandon Dixon, Weigang Ni: Optimizing disk storage to support statistical analysis operations. Decision Support Systems 38(4): 621-628 (2005)
- [j9]Michael Davis, Randy K. Smith, Brandon Dixon, Allen S. Parrish, David Cordes: Utilizing commodity hardware and software to distribute a real-world application: maximizing reuse while improving performance. Softw., Pract. Exper. 35(7): 621-641 (2005)
- 2003
- [j8]Allen S. Parrish, Brandon Dixon, David Cordes, Susan V. Vrbsky, David Brown: CARE: An Automobile Crash Data Analysis Tool. IEEE Computer 36(6): 22-32 (2003)
- 2001
- [j7]Allen S. Parrish, Brandon Dixon, David Cordes: A conceptual foundation for component-based software deployment. Journal of Systems and Software 57(3): 193-200 (2001)
- [c9]Allen S. Parrish, Brandon Dixon, David Cordes: Binary software components in the undergraduate computer science curriculum. SIGCSE 2001: 332-336
- 2000
- [j6]Joanne E. Hale, Allen S. Parrish, Randy K. Smith, Brandon Dixon: Enhancing the Cocomo Estimation Models. IEEE Software 17(6): 45-49 (2000)
- [c8]Allen S. Parrish, David W. Cordes, Brandon Dixon, John McGregor: Class development and testing in the small. ACM Southeast Regional Conference 2000: 139-145
- [c7]D. J. Jackson, Russell L. Pimmel, Allen S. Parrish, Brandon Dixon, David Cordes, Richard B. Borie: Logic design programming assignments in a first-year course. Computers and Their Applications 2000: 412-414
- [c6]Allen S. Parrish, Brandon Dixon, David P. Hale, Joanne E. Hale: A Case Study Approach to Teaching Component Based Software Engineering. CSEE&T 2000: 140-
- [c5]Andy Bond, David Cordes, Brandon Dixon, Allen S. Parrish: Software Component Engineering: Meta-Framework and Technologies - Introduction. HICSS 2000
1990 – 1999
- 1999
- [j5]Nenad Jukic, Susan V. Vrbsky, Allen S. Parrish, Brandon Dixon, Boris Jukic: A Belief-Consistent Multilevel Secure Relational Data Model. Inf. Syst. 24(5): 377-400 (1999)
- [j4]John C. Lusth, Brandon Dixon: A Characterization of Important algorithms for Quantum-Dot Cellular Automata. Inf. Sci. 113(3-4): 193-204 (1999)
- 1997
- [j3]Brandon Dixon, Robert Endre Tarjan: Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Algorithmica 17(1): 11-18 (1997)
- [j2]Brandon Dixon, John Swallow: High-performance sorting algorithms for the CRAY T3D parallel computer. The Journal of Supercomputing 10(4): 371-395 (1997)
- 1994
- [c4]Brandon Dixon, Robert Endre Tarjan: Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Canada-France Conference on Parallel and Distributed Computing 1994: 13-22
- [c3]Brandon Dixon: Concurrency in an O(log log N) Priority Queue. Canada-France Conference on Parallel and Distributed Computing 1994: 59-71
- 1993
- [c2]
- 1992
- [j1]Brandon Dixon, Monika Rauch, Robert Endre Tarjan: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM J. Comput. 21(6): 1184-1192 (1992)
- [c1]Brandon Dixon, Arjen K. Lenstra: Massively Parallel Elliptic Curve Factorin. EUROCRYPT 1992: 183-193
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:11 CET by the dblp team