☰

Narsingh Deo - Publications

Affiliations: 
University of Central Florida, Orlando, FL, United States 
Area:
Computer Science
Website:
http://www.cs.ucf.edu/~deo/
Tree Info Similar researchers PubMed Report error

62 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Raj S, Hussain F, Husein Z, Torosdagli N, Turgut D, Deo N, Pattanaik S, Chang CJ, Jha SK. A theorem proving approach for automatically synthesizing visualizations of flow cytometry data. Bmc Bioinformatics. 18: 245. PMID 28617220 DOI: 10.1186/S12859-017-1662-4  0.545
2013 Deo N, Jha SK. Big-Data-Driven Control Strategies for Complex Networks Journal of Information Technology & Software Engineering. 2013: 1-2. DOI: 10.4172/2165-7866.1000E117  0.338
2012 Vasudevan M, Deo N. Efficient community identification in complex networks Social Network Analysis and Mining. 2: 345-359. DOI: 10.1007/S13278-012-0077-5  0.464
2008 Nanda S, Deo N. The derivation and use of a scalable model for network attack identification and path prediction Journal of Networks. 3: 64-71. DOI: 10.4304/Jnw.3.4.64-71  0.533
2008 Cami A, Deo N. Techniques for analyzing dynamic random graph models of Web-like networks: An overview Networks. 51: 211-255. DOI: 10.1002/Net.V51:4  0.75
2008 Tener G, Deo N. Attacks on hard instances of graph isomorphism Journal of Combinatorial Mathematics and Combinatorial Computing. 64: 203-225.  0.4
2007 Micikevicius P, Deo N. Exploring topological properties of NMR graphs Proceedings of the 7th Ieee International Conference On Bioinformatics and Bioengineering, Bibe. 1304-1307. DOI: 10.1109/BIBE.2007.4375736  0.775
2007 Deo N, Cami A. Preferential deletion in dynamic models of web-like networks Information Processing Letters. 102: 156-162. DOI: 10.1016/J.Ipl.2006.12.009  0.713
2006 Nikoloski Z, Deo N, Kucera L. Correlation model of worm propagation on scale-free networks Complexus. 3: 169-182. DOI: 10.1159/000094198  0.587
2006 Balakrishnan H, Deo N. Discovering communities in complex networks Proceedings of the Annual Southeast Conference. 2006: 280-285. DOI: 10.1145/1185448.1185512  0.564
2006 Balakrishnan H, Deo N. Detecting communities using bibliographic metrics 2006 Ieee International Conference On Granular Computing. 293-298.  0.569
2006 Deo N, Cami A. Mining parameters that characterize the communities in web-like networks 2006 Ieee International Conference On Granular Computing. 188-193.  0.724
2005 Deo N, Balakrishnan H. Bibliometric approach to community discovery Proceedings of the Annual Southeast Conference. 2: 241-242. DOI: 10.1145/1167253.1167264  0.576
2005 Deo N, Cami A. A birth-death dynamic model of scale-free networks Proceedings of the Annual Southeast Conference. 2: 226-227. DOI: 10.1145/1167253.1167260  0.675
2005 Micikevicius P, Deo N. Cluster computing for determining three-dimensional protein structure Journal of Supercomputing. 34: 243-271. DOI: 10.1007/S11227-005-1168-0  0.769
2004 Litow B, Deo N. Graph compression and the zeros of polynomials Information Processing Letters. 92: 39-44. DOI: 10.1016/J.Ipl.2004.06.004  0.414
2002 Abdalla A, Deo N. Random-tree diameter and the diameter-constrained MST International Journal of Computer Mathematics. 79: 651-663. DOI: 10.1080/00207160211289  0.673
2002 Deo N, Micikevicius P. Coarse-grained parallelization of distance-bound smoothing for the molecular conformation problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2571: 55-66. DOI: 10.1007/3-540-36385-8_6  0.776
2001 Deo N, Gupta P. Graph-theoretic web algorithms: An overview Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2060: 91-102. DOI: 10.1007/3-540-48206-7_8  0.461
2000 Deo N, Abdalla A. Computing a diameter-constrained minimum spanning tree in parallel Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1767: 17-31.  0.365
1999 Rajan K, Deo N. Computational experience with a parallel algorithm for tetrangle inequality bound smoothing. Bulletin of Mathematical Biology. 61: 987-1008. PMID 17886753 DOI: 10.1006/Bulm.1999.0123  0.414
1999 Nievergelt J, Deo N, Marzetta A. Memory-efficient enumeration of constrained spanning trees Information Processing Letters. 72: 47-53. DOI: 10.1016/S0020-0190(99)00117-9  0.4
1998 Medidi M, Deo N. Parallel Dictionaries Using AVL Trees Journal of Parallel and Distributed Computing. 49: 146-155. DOI: 10.1006/Jpdc.1998.1432  0.735
1998 Deo N, Medidi M, Prasad SK. Load balancing in parallel battlefield management simulation on local- and shared-memory architectures Computer Systems Science and Engineering. 13: 55-65.  0.666
1996 Boldon B, Deo N, Kumar N. Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine Parallel Computing. 22: 369-382. DOI: 10.1016/0167-8191(95)00010-0  0.32
1995 Perumalla KS, Deo N. Parallel Algorithms For Maximum Subsequence And Maximum Subarray Parallel Processing Letters. 5: 367-373. DOI: 10.1142/S0129626495000345  0.36
1995 Nievergelt J, Deo N. Metric graphs elastically embeddable in the plane Information Processing Letters. 55: 309-315. DOI: 10.1016/0020-0190(95)00103-J  0.438
1994 Deo N, Jain A, Medidi M. An optimal parallel algorithm for merging using multiselection Information Processing Letters. 50: 81-87. DOI: 10.1016/0020-0190(94)00009-3  0.711
1994 Deo N, Jain A, Medidi M. Parallel Construction of (a, b)-Trees Journal of Parallel and Distributed Computing. 23: 442-448. DOI: 10.1006/Jpdc.1994.1154  0.729
1993 Cáceres E, Deo N, Sastry S, Szwarcfiter JL. On Finding Euler Tours In Parallel Parallel Processing Letters. 3: 223-231. DOI: 10.1142/S0129626493000265  0.461
1993 Das SK, Deo N, Prasad S. Reverse binary graphs Mathematical and Computer Modelling. 17: 49-60. DOI: 10.1016/0895-7177(93)90252-T  0.68
1992 Deo N, Medidi M. Parallel Algorithms for Terminal-Pair Reliability Ieee Transactions On Reliability. 41: 201-209. DOI: 10.1109/24.257782  0.738
1992 Das SK, Ghosh J, Deo N. Stirling networks: a versatile combinatorial topology for multiprocessor systems Discrete Applied Mathematics. 37: 119-146. DOI: 10.1016/0166-218X(92)90128-W  0.567
1992 Deo N, Prasad S. Parallel heap: An optimal parallel priority queue The Journal of Supercomputing. 6: 87-98. DOI: 10.1007/Bf00128644  0.586
1992 Aggarwal V, Deo N, Sarkar D. The knapsack problem with disjoint multiple-choice constraints Naval Research Logistics. 39: 213-227. DOI: 10.1002/Nav.3220390206  0.369
1990 Das SK, Deo N. Notes on “Divide-and-Conquer-Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model” 1 Ieee Transactions On Circuits and Systems. 37: 962-965. DOI: 10.1109/31.55074  0.343
1990 Das SK, Deo N, Prasad S. Parallel graph algorithms for hypercube computers Parallel Computing. 13: 143-158. DOI: 10.1016/0167-8191(90)90143-W  0.403
1990 Das SK, Deo N, Prasad S. Two minimum spanning forest algorithms on fixed-size hypercube computers Parallel Computing. 15: 179-187. DOI: 10.1016/0167-8191(90)90041-7  0.409
1989 Deo N, Harary F, Schwenk AJ. An eigenvector characterization of conspectral graphs having cospectral joins Annals of the New York Academy of Sciences. 555: 159-166. DOI: 10.1111/J.1749-6632.1989.Tb22447.X  0.419
1989 Deo N, Krishnamoorthy MS. Toeplitz Networks and Their Properties Ieee Transactions On Circuits and Systems. 36: 1089-1092. DOI: 10.1109/31.192418  0.616
1989 Das SK, Deo N. Parallel coloring of graphs: Two approximate algorithms International Journal of Computer Mathematics. 27: 147-158. DOI: 10.1080/00207168908803716  0.595
1988 Das SK, Deo N. Divide-and-Conquer-Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model Ieee Transactions On Circuits and Systems. 35: 312-322. DOI: 10.1109/31.1744  0.62
1988 Yoo YB, Deo N. A Comparison of Algorithms for Terminal-Pair Reliability Ieee Transactions On Reliability. 37: 210-215. DOI: 10.1109/24.3743  0.41
1988 Buell DA, Carlson DA, Chow YC, Culik K, Deo N, Finkel R, Houstis EN, Jacob Son EM, Kedem ZM, Kowalik JS, Kuekes PJ, Martin JL, Michael GA, Ostlund NS, Potter J, et al. Parallel algorithms and architectures report of a workshop The Journal of Supercomputing. 1: 301-325. DOI: 10.1007/Bf00154341  0.366
1987 Deo N, Krishnamoorthy MS, Langston MA. Exact and Approximate Solutions for the Gate Matrix Layout Problem Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 6: 79-84. DOI: 10.1109/Tcad.1987.1270248  0.64
1986 Quinn MJ, Deo N. An upper bound for the speedup of parallel best-bound branch-and-bound algorithms Bit. 26: 35-43. DOI: 10.1007/Bf01939360  0.402
1984 Quinn MJ, Deo N. Parallel Graph Algorithms Acm Computing Surveys (Csur). 16: 319-348. DOI: 10.1145/2514.2515  0.497
1984 Prabhu GM, Deo N. On the power of a perturbation for testing non-isomorphism of graphs Bit. 24: 302-307. DOI: 10.1007/Bf02136028  0.615
1984 Deo N, Pang C. Shortest‐path algorithms: Taxonomy and annotation Networks. 14: 275-323. DOI: 10.1002/Net.3230140208  0.408
1982 Deo N, Prabhu G, Krishnamoorthy MS. Algorithms for Generating Fundamental Cycles in a Graph Acm Transactions On Mathematical Software (Toms). 8: 26-42. DOI: 10.1145/355984.355988  0.67
1982 Mateti P, Deo N. Parallel algorithms for the single source shortest path problem Computing. 29: 31-49. DOI: 10.1007/Bf02254849  0.447
1979 Krishnamoorthy MS, Deo N. Node-Deletion NP-Complete Problems Siam Journal On Computing. 8: 619-625. DOI: 10.1137/0208049  0.379
1979 Deo N. Minimum-length fundamental cycle set Ieee Transactions On Circuits and Systems. 26: 894-895. DOI: 10.1109/Tcs.1979.1084563  0.321
1979 Krishnamoorthy MS, Deo N. Complexity of the minimum‐dummy‐activities problem in a pert network Networks. 9: 189-194. DOI: 10.1002/Net.3230090302  0.419
1979 Krishnamoorthy MS, Deo N. COMPLEXITY OF THE MINIMUM-DUMMY-ACTIVITIES PROBLEM IN PERT NETWORK Networks. 9: 189-194.  0.612
1977 Deo N, Krishnamoorthy MS, Pai AB. Generalizations of line graphs and applications Information Processing Letters. 6: 14-17. DOI: 10.1016/0020-0190(77)90005-9  0.629
1977 Deo N, Davis JM, Lord RE. A new algorithm for digraph isomorphism Bit. 17: 16-30. DOI: 10.1007/Bf01932396  0.366
1976 Mateti P, Deo N. On Algorithms for Enumerating All Circuits of a Graph Siam Journal On Computing. 5: 90-99. DOI: 10.1137/0205007  0.464
1975 Shreeve RI, Deo N. Graph Theory with Applications to Engineering and Computer Science The Mathematical Gazette. 59: 54. DOI: 10.2307/3616823  0.331
1975 Krishnamoorthy MS, Deo N. Tree Graphs and Tree Numbers Ieee Transactions On Circuits and Systems. 22: 60-62. DOI: 10.1109/Tcs.1975.1083957  0.66
1968 Mayeda W, Hakimi SL, Chen WK, Deo N. Generation of Complete Trees Ieee Transactions On Circuit Theory. 15: 101-105. DOI: 10.1109/Tct.1968.1082784  0.398
1966 Deo N. A Central Tree Ieee Transactions On Circuit Theory. 13: 439-440. DOI: 10.1109/Tct.1966.1082617  0.43
Show low-probability matches.