Narsingh Deo

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

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2018

Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey.

Mahadevan Vasudevan, Narsingh Deo

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

2017

A theorem proving approach for automatically synthesizing visualizations of flow cytometry data.

Sunny Raj, Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Damla Turgut, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Jeff Chang, Sumit Kumar Jha

BMC Bioinform., 2017

2016

Accelerating the distributed simulations of agent-based models using community detection.

Antoniya Petkova, Charles E. Hughes, Narsingh Deo, Martin Dimitrov

Proceedings of the 2016 IEEE RIVF International Conference on Computing & Communication Technologies, 2016

2015

SANJAY: Automatically synthesizing visualizations of flow cytometry data using decision procedures.

Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Chang, Sumit Kumar Jha

Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

2014

Community Identification in Dynamic and Complex Networks.

Mahadevan Vasudevan, Narsingh Deo

Encyclopedia of Social Network Analysis and Mining, 2014

2012

Efficient community identification in complex networks.

Mahadevan Vasudevan, Narsingh Deo

Soc. Netw. Anal. Min., 2012

2008

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

Aurel Cami, Narsingh Deo

Networks, 2008

The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction.

Sanjeeb Nanda, Narsingh Deo

J. Networks, 2008

2007

Preferential deletion in dynamic models of web-like networks.

Narsingh Deo, Aurel Cami

Inf. Process. Lett., 2007

Exploring Topological Properties of NMR Graphs.

Paulius Micikevicius, Narsingh Deo

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

2006

Evaluation of a Graph-based Topical Crawler.

Aurel Cami, Narsingh Deo

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.

Narsingh Deo, Aurel Cami

Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Detecting communities using bibliographic metrics.

Hemant Balakrishnan, Narsingh Deo

Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Discovering communities in complex networks.

Hemant Balakrishnan, Narsingh Deo

Proceedings of the 44st Annual Southeast Regional Conference, 2006

2005

Cluster Computing for Determining Three-Dimensional Protein Structure.

Paulius Micikevicius, Narsingh Deo

J. Supercomput., 2005

A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems.

Narsingh Deo, Sanjeeb Nanda

Proceedings of the 9th International Conference on Information Visualisation, 2005

A birth-death dynamic model of scale-free networks.

Narsingh Deo, Aurel Cami

Proceedings of the 43nd Annual Southeast Regional Conference, 2005

Bibliometric approach to community discovery.

Narsingh Deo, Hemant Balakrishnan

Proceedings of the 43nd Annual Southeast Regional Conference, 2005

2004

Graphs.

Narsingh Deo

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

Graph compression and the zeros of polynomials.

Bruce E. Litow, Narsingh Deo

Inf. Process. Lett., 2004

2002

Random-tree Diameter and the Diameter-constrained MST.

Ayman M. Abdalla, Narsingh Deo

Int. J. Comput. Math., 2002

Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem.

Narsingh Deo, Paulius Micikevicius

Proceedings of the Distributed Computing, 2002

2001

Graph-Theoretic Web Algorithms: An Overview.

Narsingh Deo, Pankaj Gupta

Proceedings of the Innovative Internet Computing Systems, 2001

2000

Forbidden pairs combinatorics.

Bruce E. Litow, Narsingh Deo

Australas. J Comb., 2000

Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.

Narsingh Deo, Ayman M. Abdalla

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Memory-Efficient Enumeration of Constrained Spanning Trees.

Jürg Nievergelt, Narsingh Deo, Ambros Marzetta

Inf. Process. Lett., 1999

A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.

Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

A Parallel Algorithm for Bound-Smoothing.

Kumar Rajan, Narsingh Deo

Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1998

Parallel Dictionaries Using AVL Trees.

Muralidhar Medidi, Narsingh Deo

J. Parallel Distributed Comput., 1998

1997

Constrained spanning tree problems: Approximate methods and parallel computation.

Narsingh Deo, Nishit Kumar

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

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

Bruce Boldon, Narsingh Deo, Nishit Kumar

Parallel Comput., 1996

A neural network model for information retrieval using latent semantic indexing.

Inien Syu, Sheau-Dong Lang, Narsingh Deo

Proceedings of International Conference on Neural Networks (ICNN'96), 1996

Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval.

Inien Syu, Sheau-Dong Lang, Narsingh Deo

Proceedings of the CIKM '96, Proceedings of the Fifth International Conference on Information and Knowledge Management, November 12, 1996

1995

Parallel Algorithms for Maximum Subsequence and Maximum Subarray.

Kalyan S. Perumalla, Narsingh Deo

Parallel Process. Lett., 1995

Metric Graphs Elastically Embeddable in the Plane.

Jürg Nievergelt, Narsingh Deo

Inf. Process. Lett., 1995

Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley Transforms.

Nishit Kumar, Narsingh Deo

Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

1994

Parallel Construction of (a, b) -Trees.

Narsingh Deo, Amit Jain, Muralidhar Medidi

J. Parallel Distributed Comput., 1994

An Optimal Parallel Algorithm for Merging Using Multiselection.

Narsingh Deo, Amit Jain, Muralidhar Medidi

Inf. Process. Lett., 1994

Parallel Dictionaries on AVL Trees.

Muralidhar Medidi, Narsingh Deo

Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993

On Finding Euler Tours in Parallel.

Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter

Parallel Process. Lett., 1993

1992

Parallel heap: An optimal parallel priority queue.

Narsingh Deo, Sushil K. Prasad

J. Supercomput., 1992

Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems.

Sajal K. Das, Joydeep Ghosh, Narsingh Deo

Discret. Appl. Math., 1992

Processor Allocation in Parallel Battlefield Simulation.

Narsingh Deo, Muralidhar Medidi, Sushil K. Prasad

Proceedings of the 24th Winter Simulation Conference, 1992

Parallel Heap: Improved and Simplified.

Sushil K. Prasad, Narsingh Deo

Proceedings of the 6th International Parallel Processing Symposium, 1992

Constructing Height-Balanced Trees in Parallel.

Narsingh Deo, Amit Jain, Muralidhar Medidi

Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991

Parallel algorithms for merging and sorting.

Narsingh Deo, Dilip Sarkar

Inf. Sci., 1991

An efficient and scalable parallel algorithm for discrete-event simulation.

Sushil K. Prasad, Narsingh Deo

Proceedings of the 23th Winter Simulation Conference, 1991

Two EREW Algorithms for Parentheses Matching.

Sushil K. Prasad, Narsingh Deo

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

1990

Estimating the Speedup in Parallel Parsing.

Dilip Sarkar, Narsingh Deo

IEEE Trans. Software Eng., 1990

Parallel graph algorithms for hypercube computers.

Sajal K. Das, Narsingh Deo, Sushil K. Prasad

Parallel Comput., 1990

Two minimum spanning forest algorithms on fixed-size hypercube computers.

Sajal K. Das, Narsingh Deo, Sushil K. Prasad

Parallel Comput., 1990

Parallel Hungarian algorithm.

Sajal K. Das, Narsingh Deo

Comput. Syst. Sci. Eng., 1990

Parallel Heap.

Narsingh Deo, Sushil K. Prasad

Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989

Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis.

Sajal K. Das, Narsingh Deo, Sushil K. Prasad

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1988

Parallel algorithms and architectures report of a workshop.

Duncan A. Buell, David A. Carlson, Yuan-Chieh Chow, Karel Culík, Narsingh Deo, Raphael A. Finkel, Elias N. Houstis, Elaine M. Jacob Son, Zvi M. Kedem, Janusz S. Kowalik, Philip Kuekes, Joanne L. Martin, George A. Michael, Neil S. Ostlund, Jerry Potter, D. K. Pradhan, Michael J. Quinn, G. W. Stewart, Quentin F. Stout, Layne T. Watson, Jon Webb

J. Supercomput., 1988

1987

Exact and Approximate Solutions for the Gate Matrix Layout Problem.

Narsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987

Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses.

Dilip Sarkar, Narsingh Deo

Proceedings of the Supercomputing, 1987

An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages.

Dilip Sarkar, Narsingh Deo

Proceedings of the International Conference on Parallel Processing, 1987

1986

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

Michael J. Quinn, Narsingh Deo

BIT, 1986

1984

Shortest-path algorithms: Taxonomy and annotation.

Narsingh Deo, Chi-Yin Pang

Networks, 1984

Parallel Graph Algorithms.

Michael J. Quinn, Narsingh Deo

ACM Comput. Surv., 1984

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

G. M. Prabhu, Narsingh Deo

BIT, 1984

1982

Algorithms for Generating Fundamental Cycles in a Graph.

Narsingh Deo, G. M. Prabhu, Mukkai S. Krishnamoorthy

ACM Trans. Math. Softw., 1982

Parallel algorithms for the single source shortest path problem.

Prabhaker Mateti, Narsingh Deo

Computing, 1982

1979

Interference in Multiprocessor Systems with Localized Memory Access Probabilities.

Adarshpal S. Sethi, Narsingh Deo

IEEE Trans. Computers, 1979

Node-Deletion NP-Complete Problems.

Mukkai S. Krishnamoorthy, Narsingh Deo

SIAM J. Comput., 1979

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

Mukkai S. Krishnamoorthy, Narsingh Deo

Networks, 1979

1977

Generalizations of Line Graphs and Applications.

Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai

Inf. Process. Lett., 1977

1976

On Algorithms for Enumerating All Circuits of a Graph.

Prabhaker Mateti, Narsingh Deo

SIAM J. Comput., 1976

Note on Hopcroft and Tarjan's Planarity Algorithm.

Narsingh Deo

J. ACM, 1976

1969

Author's Reply³.

Narsingh Deo

IEEE Trans. Computers, 1969

1968

Generalized Parallel Redundancy in Digital Computers.

Narsingh Deo

IEEE Trans. Computers, 1968

1966

The Self-Diagnosability of a Computer.

Narsingh Deo

IEEE Trans. Electron. Comput., 1966