[ skip to content ]
- Desh Ranjan
- Professor & Chair
- Computer Science Department
- 3303 Engr and Comp Sci Bldg
-
Norfolk,
VA
23529
- 757-683-7711
- dranjan@odu.edu
-
Education
- Cornell University,
1992
- Major: Computer Science
- Degree: Ph. D.
- Cornell University,
1990
- Major: Computer Science
- Degree: M.S.
- Indian Institute of Technology,
1987
- Major: Computer Science
- Degree: Bachelor of Technology
-
Research Interests
- Dr. Ranjan is primarily interested in the development of efficient algorithms and bioinformatics tools for solving biologically
important problems. The scholar's more general research and teaching interests are in efficient data structure and algorithm
design and analysis, computational complexity theory, parallel computation, discrete mathematics, and optimization and approximation
-
Book Chapters
- Barnett, J., Lodder, J., Pengelley, D., Pivkina, I., and Ranjan, D. Designing student projects for teaching and learning discrete mathematics and computer science via primary historical sources,
In Recent Developments in Introducting a Historical Dimesnion in Mathematics Education.. Washington, D.C.: Mathematical Association of America.
- Ranjan, D. (2009). Counting Triangulations of a Convex Polygon, In Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules,
and Articles. (pp. 209-215). Mathematical Association of America MAA Notes 74.
-
Articles
- Vasudevan, B., Yelavarthi, P., Sengupta-Gopalan, C., and Ranjan, D. Bioinformatics Analysis of Glutamine synthetase in alfalfa using cis-find.
- Yelavarthi, P., and Ranjan, D. Efficient Sequential and Parallel Methods for computing unextendable maximal motifs.
- On the Complexity of And-Parallel Implementations of Logic Programming. Parallel Processing Letters
- Ranjan, D., Savage, J., and Zubair, M. Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010
- Dubhashi, D., and Ranjan, D. Two techniques for Negative Dependence: FKG and Coupling of Markov Chains. Discrete Mathematics
- Dubhashi, D., Jonasson, J., and Ranjan, D. (2007). Positive Influence and Negative Dependence. Combinatorics, Probability, and Computing, 16 (1), (pp. 29-47).
- Dal Palu, A., Pontelli, E., and Ranjan, D. (2006). Sequential and Parallel Algorithms for the NCA Problem on Pure Pointer Machines. Theoretical Computer Science, 352 (1-3), (pp. 108-135).
- Pontelli, E., and Ranjan, D. (2005). A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines. Theory of Computing Systems, 38 (1), (pp. 115-130).
- Harary, F., and Ranjan, D. (2005). Identity Orientation of Complete Bipartite Graphs. Discrete Mathematics, 290 (2/3), (pp. 173-182).
-
Presentations
- Bioinformatics at NMSU
- Sponsoring Organization: NMSU
- Date: 2006
- Authors/Presenters:
Ranjan, D.
- NMSU Center for Research Excellence in Bioinformatics and Computational Biology
- Sponsoring Organization: NSF, NSF-HRD Joint Annual Meeting
- Date: 2005
- Authors/Presenters:
Ranjan, D.
- 2009: NMSU Millionaire Researcher, New Mexico State University
- 2008: NMSU Millionaire Researcher, New Mexico State University
- 2006: Outstanding Faculty Achievement Award, New Mexico State University
- Sage Graduate Fellowship, Cornell University
- 2007: University Research Council Distinguished Career Award for Exceptional Achievements in Creative Scholarly Activity, New Mexico State University
-
Contracts, Grants and Sponsored Research