Narsingh Deo

According to our database1, Narsingh Deo authored at least 73 papers between 1966 and 2018.

Collaborative distances:


ACM Fellow

ACM Fellow 1996, "For his seminal contribution in applying graph theory to practical problems using computer and dissemination of knowledge through his books.".

IEEE Fellow

IEEE Fellow 1991, "For contributions to graph theory, algorithms, and applications.".



In proceedings 
PhD thesis 




Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

A theorem proving approach for automatically synthesizing visualizations of flow cytometry data.
BMC Bioinform., 2017

Accelerating the distributed simulations of agent-based models using community detection.
Proceedings of the 2016 IEEE RIVF International Conference on Computing & Communication Technologies, 2016

SANJAY: Automatically synthesizing visualizations of flow cytometry data using decision procedures.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

Community Identification in Dynamic and Complex Networks.
Encyclopedia of Social Network Analysis and Mining, 2014

Efficient community identification in complex networks.
Soc. Netw. Anal. Min., 2012

Techniques for analyzing dynamic random graph models of web-like networks: An overview.
Networks, 2008

The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction.
J. Networks, 2008

Preferential deletion in dynamic models of web-like networks.
Inf. Process. Lett., 2007

Exploring Topological Properties of NMR Graphs.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

Evaluation of a Graph-based Topical Crawler.
Proceedings of the 2006 International Conference on Internet Computing & Conference on Computer Games Development, 2006

Mining parameters that characterize the communities in web-like networks.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Detecting communities using bibliographic metrics.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Discovering communities in complex networks.
Proceedings of the 44st Annual Southeast Regional Conference, 2006

Cluster Computing for Determining Three-Dimensional Protein Structure.
J. Supercomput., 2005

A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems.
Proceedings of the 9th International Conference on Information Visualisation, 2005

A birth-death dynamic model of scale-free networks.
Proceedings of the 43nd Annual Southeast Regional Conference, 2005

Bibliometric approach to community discovery.
Proceedings of the 43nd Annual Southeast Regional Conference, 2005

Proceedings of the Handbook of Data Structures and Applications., 2004

Graph compression and the zeros of polynomials.
Inf. Process. Lett., 2004

Random-tree Diameter and the Diameter-constrained MST.
Int. J. Comput. Math., 2002

Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem.
Proceedings of the Distributed Computing, 2002

Graph-Theoretic Web Algorithms: An Overview.
Proceedings of the Innovative Internet Computing Systems, 2001

Forbidden pairs combinatorics.
Australas. J Comb., 2000

Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

Memory-Efficient Enumeration of Constrained Spanning Trees.
Inf. Process. Lett., 1999

A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

A Parallel Algorithm for Bound-Smoothing.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Parallel Dictionaries Using AVL Trees.
J. Parallel Distributed Comput., 1998

Constrained spanning tree problems: Approximate methods and parallel computation.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine.
Parallel Comput., 1996

A neural network model for information retrieval using latent semantic indexing.
Proceedings of International Conference on Neural Networks (ICNN'96), 1996

Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval.
Proceedings of the CIKM '96, Proceedings of the Fifth International Conference on Information and Knowledge Management, November 12, 1996

Parallel Algorithms for Maximum Subsequence and Maximum Subarray.
Parallel Process. Lett., 1995

Metric Graphs Elastically Embeddable in the Plane.
Inf. Process. Lett., 1995

Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley Transforms.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

Parallel Construction of (a, b) -Trees.
J. Parallel Distributed Comput., 1994

An Optimal Parallel Algorithm for Merging Using Multiselection.
Inf. Process. Lett., 1994

Parallel Dictionaries on AVL Trees.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

On Finding Euler Tours in Parallel.
Parallel Process. Lett., 1993

Parallel heap: An optimal parallel priority queue.
J. Supercomput., 1992

Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems.
Discret. Appl. Math., 1992

Processor Allocation in Parallel Battlefield Simulation.
Proceedings of the 24th Winter Simulation Conference, 1992

Parallel Heap: Improved and Simplified.
Proceedings of the 6th International Parallel Processing Symposium, 1992

Constructing Height-Balanced Trees in Parallel.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

Parallel algorithms for merging and sorting.
Inf. Sci., 1991

An efficient and scalable parallel algorithm for discrete-event simulation.
Proceedings of the 23th Winter Simulation Conference, 1991

Two EREW Algorithms for Parentheses Matching.
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

Estimating the Speedup in Parallel Parsing.
IEEE Trans. Software Eng., 1990

Parallel graph algorithms for hypercube computers.
Parallel Comput., 1990

Two minimum spanning forest algorithms on fixed-size hypercube computers.
Parallel Comput., 1990

Parallel Hungarian algorithm.
Comput. Syst. Sci. Eng., 1990

Parallel Heap.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

Parallel algorithms and architectures report of a workshop.
J. Supercomput., 1988

Exact and Approximate Solutions for the Gate Matrix Layout Problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987

Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses.
Proceedings of the Supercomputing, 1987

An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages.
Proceedings of the International Conference on Parallel Processing, 1987

An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms.
BIT, 1986

Shortest-path algorithms: Taxonomy and annotation.
Networks, 1984

Parallel Graph Algorithms.
ACM Comput. Surv., 1984

On the Power of a Perturbation for Testing Non-Isomorphism of Graphs.
BIT, 1984

Algorithms for Generating Fundamental Cycles in a Graph.
ACM Trans. Math. Softw., 1982

Parallel algorithms for the single source shortest path problem.
Computing, 1982

Interference in Multiprocessor Systems with Localized Memory Access Probabilities.
IEEE Trans. Computers, 1979

Node-Deletion NP-Complete Problems.
SIAM J. Comput., 1979

Complexity of the minimum-dummy-activities problem in a pert network.
Networks, 1979

Generalizations of Line Graphs and Applications.
Inf. Process. Lett., 1977

On Algorithms for Enumerating All Circuits of a Graph.
SIAM J. Comput., 1976

Note on Hopcroft and Tarjan's Planarity Algorithm.
J. ACM, 1976

Author's Reply<sup>3</sup>.
IEEE Trans. Computers, 1969

Generalized Parallel Redundancy in Digital Computers.
IEEE Trans. Computers, 1968

The Self-Diagnosability of a Computer.
IEEE Trans. Electron. Comput., 1966