The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Narsingh Deo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael J. Quinn, Narsingh Deo
    Parallel Graph Algorithms. [Citation Graph (1, 0)][DBLP]
    ACM Comput. Surv., 1984, v:16, n:3, pp:319-348 [Journal]
  2. Hemant Balakrishnan, Narsingh Deo
    Discovering communities in complex networks. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 2006, pp:280-285 [Conf]
  3. Narsingh Deo, Hemant Balakrishnan
    Bibliometric approach to community discovery. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference (2), 2005, pp:41-42 [Conf]
  4. Narsingh Deo, Aurel Cami
    A birth-death dynamic model of scale-free networks. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference (2), 2005, pp:26-27 [Conf]
  5. Narsingh Deo, Ayman Abdalla
    Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:17-31 [Conf]
  6. Inien Syu, Sheau-Dong Lang, Narsingh Deo
    Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval. [Citation Graph (0, 0)][DBLP]
    CIKM, 1996, pp:145-153 [Conf]
  7. Sajal K. Das, Narsingh Deo, Sushil K. Prasad
    Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:280-290 [Conf]
  8. Aurel Cami, Narsingh Deo
    Evaluation of a Graph-based Topical Crawler. [Citation Graph (0, 0)][DBLP]
    International Conference on Internet Computing, 2006, pp:393-399 [Conf]
  9. Narsingh Deo, Amit Jain, Muralidhar Medidi
    Constructing Height-Balanced Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:297-300 [Conf]
  10. Narsingh Deo, Sushil K. Prasad
    Parallel Heap. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1990, pp:169-172 [Conf]
  11. Dilip Sarkar, Narsingh Deo
    Estimating the Speedup in Parallel Parsing. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:157-163 [Conf]
  12. Dilip Sarkar, Narsingh Deo
    An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:585-588 [Conf]
  13. Dilip Sarkar, Narsingh Deo
    Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses. [Citation Graph (0, 0)][DBLP]
    ICS, 1987, pp:970-984 [Conf]
  14. Narsingh Deo, Pankaj Gupta
    Graph-Theoretic Web Algorithms: An Overview. [Citation Graph (0, 0)][DBLP]
    IICS, 2001, pp:91-102 [Conf]
  15. Muralidhar Medidi, Narsingh Deo
    Parallel Dictionaries on AVL Trees. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:878-882 [Conf]
  16. Sushil K. Prasad, Narsingh Deo
    Two EREW Algorithms for Parentheses Matching. [Citation Graph (0, 0)][DBLP]
    IPPS, 1991, pp:126-131 [Conf]
  17. Sushil K. Prasad, Narsingh Deo
    Parallel Heap: Improved and Simplified. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:448-451 [Conf]
  18. Kumar Rajan, Narsingh Deo
    A Parallel Algorithm for Bound-Smoothing. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:645-652 [Conf]
  19. Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang
    A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:184-189 [Conf]
  20. Narsingh Deo, Sanjeeb Nanda
    A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems. [Citation Graph (0, 0)][DBLP]
    IV, 2005, pp:542-549 [Conf]
  21. Narsingh Deo, Paulius Micikevicius
    Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem. [Citation Graph (0, 0)][DBLP]
    IWDC, 2002, pp:55-66 [Conf]
  22. Nishit Kumar, Narsingh Deo
    Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley Transforms. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Systems, 1995, pp:248-252 [Conf]
  23. Narsingh Deo, Muralidhar Medidi, Sushil K. Prasad
    Processor Allocation in Parallel Battlefield Simulation. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1992, pp:718-725 [Conf]
  24. Sushil K. Prasad, Narsingh Deo
    An efficient and scalable parallel algorithm for discrete-event simulation. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1991, pp:652-658 [Conf]
  25. G. M. Prabhu, Narsingh Deo
    On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. [Citation Graph (0, 0)][DBLP]
    BIT, 1984, v:24, n:3, pp:302-307 [Journal]
  26. Michael J. Quinn, Narsingh Deo
    An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    BIT, 1986, v:26, n:1, pp:35-43 [Journal]
  27. Sajal K. Das, Narsingh Deo
    Parallel Hungarian algorithm. [Citation Graph (0, 0)][DBLP]
    Comput. Syst. Sci. Eng., 1990, v:5, n:3, pp:131-136 [Journal]
  28. Sajal K. Das, Joydeep Ghosh, Narsingh Deo
    Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:119-146 [Journal]
  29. Ayman Abdalla, Narsingh Deo
    Random-tree Diameter and the Diameter-constrained MST. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:6, pp:651-663 [Journal]
  30. Narsingh Deo, Amit Jain, Muralidhar Medidi
    An Optimal Parallel Algorithm for Merging Using Multiselection. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:2, pp:81-87 [Journal]
  31. Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai
    Generalizations of Line Graphs and Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:1, pp:14-17 [Journal]
  32. Bruce E. Litow, Narsingh Deo
    Graph compression and the zeros of polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:1, pp:39-44 [Journal]
  33. Jürg Nievergelt, Narsingh Deo
    Metric Graphs Elastically Embeddable in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:309-315 [Journal]
  34. Jürg Nievergelt, Narsingh Deo, Ambros Marzetta
    Memory-Efficient Enumeration of Constrained Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:1-2, pp:47-53 [Journal]
  35. Narsingh Deo, Aurel Cami
    Preferential deletion in dynamic models of web-like networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:4, pp:156-162 [Journal]
  36. Narsingh Deo, Dilip Sarkar
    Parallel algorithms for merging and sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1991, v:56, n:1-3, pp:151-161 [Journal]
  37. Narsingh Deo
    Note on Hopcroft and Tarjan's Planarity Algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:74-75 [Journal]
  38. Narsingh Deo, Amit Jain, Muralidhar Medidi
    Parallel Construction of (a, b) -Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:3, pp:442-448 [Journal]
  39. Muralidhar Medidi, Narsingh Deo
    Parallel Dictionaries Using AVL Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:146-155 [Journal]
  40. Bruce Boldon, Narsingh Deo, Nishit Kumar
    Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1996, v:22, n:3, pp:369-382 [Journal]
  41. Sajal K. Das, Narsingh Deo, Sushil K. Prasad
    Two minimum spanning forest algorithms on fixed-size hypercube computers. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:15, n:1-3, pp:179-187 [Journal]
  42. Sajal K. Das, Narsingh Deo, Sushil K. Prasad
    Parallel graph algorithms for hypercube computers. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:13, n:2, pp:143-158 [Journal]
  43. Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter
    On Finding Euler Tours in Parallel. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:223-231 [Journal]
  44. Kalyan S. Perumalla, Narsingh Deo
    Parallel Algorithms for Maximum Subsequence and Maximum Subarray. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:367-373 [Journal]
  45. Mukkai S. Krishnamoorthy, Narsingh Deo
    Node-Deletion NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:619-625 [Journal]
  46. Prabhaker Mateti, Narsingh Deo
    On Algorithms for Enumerating All Circuits of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:1, pp:90-99 [Journal]
  47. A. S. Sethi, Narsingh Deo
    Interference in Multiprocessor Systems with Localized Memory Access Probabilities. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:2, pp:157-163 [Journal]
  48. Narsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston
    Exact and Approximate Solutions for the Gate Matrix Layout Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1987, v:6, n:1, pp:79-84 [Journal]
  49. Paulius Micikevicius, Narsingh Deo
    Cluster Computing for Determining Three-Dimensional Protein Structure. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2005, v:34, n:3, pp:243-271 [Journal]
  50. Dilip Sarkar, Narsingh Deo
    Estimating the Speedup in Parallel Parsing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:7, pp:677-683 [Journal]

  51. Exploring Topological Properties of NMR Graphs. [Citation Graph (, )][DBLP]


Search in 0.325secs, Finished in 0.328secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002