Narsingh Deo

发表

Interference in Multiprocessor Systems with Localized Memory Access Probabilities

Adarshpal S. Sethi, Narsingh Deo, 1979, IEEE Transactions on Computers.

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

Dilip Sarkar, Narsingh Deo, 1987, ICS.

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

Dilip Sarkar, Narsingh Deo, 1987, ICPP.

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

Narsingh Deo, Antoniya Petkova, Charles Hughes, 2016, 2016 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF).

Graph compression and the zeros of polynomials

Narsingh Deo, Bruce E. Litow, N. Deo, 2004, Inf. Process. Lett..

Processor allocation in parallel battlefield simulation

Narsingh Deo, Sushil K. Prasad, Muralidhar Medidi, 1992, WSC '92.

Estimating the Speedup in Parallel Parsing

Dilip Sarkar, Narsingh Deo, 1990, IEEE Trans. Software Eng..

A Structural Approach to Graph Compression

Narsingh Deo, Bruce Litow, N. Deo, 1998 .

Discrete Optimization Algorithms: with Pascal Programs (Dover Books on Mathematics)

Narsingh Deo, Janusz S. Kowalik, Maciej M. Sysło, 2006 .

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

Narsingh Deo, Bruce Boldon, Nishit Kumar, 1996, Parallel Comput..

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

Michael J. Quinn, Narsingh Deo, 1986, BIT Comput. Sci. Sect..

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

Sumit Kumar Jha, Narsingh Deo, Sumanta N. Pattanaik, 2015, 2015 IEEE 5th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS).

Constrained spanning tree problems: Approximate methods and parallel computation

Narsingh Deo, Nishit Kumar, 1997, Network Design: Connectivity and Facilities Location.

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

Narsingh Deo, Paulius Micikevicius, 2002, IWDC.

Parallel heap: An optimal parallel priority queue

Narsingh Deo, Sushil Prasad, 2004, The Journal of Supercomputing.

Incorporating latent semantic indexing into a neural network model for information retrieval

Narsingh Deo, Sheau-Dong Lang, Inien Syu, 1996, CIKM '96.

Author's Reply3

Narsingh Deo, 1969, IEEE Trans. Computers.

Computing a Diameter-Constrained Minimum Spanning Tree in Parallel

Narsingh Deo, Ayman M. Abdalla, 2000, CIAC.

Exact and Approximate Solutions for the Gate Matrix Layout Problem

Michael A. Langston, Narsingh Deo, Mukkai S. Krishnamoorthy, 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

An efficient and scalable parallel algorithm for discrete-event simulation

Narsingh Deo, Sushil K. Prasad, 1991, 1991 Winter Simulation Conference Proceedings..

Millimeter-wave ICs spring from the lab

Raj Mittra, Narsingh Deo, 1979 .

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

Narsingh Deo, Sanjeeb Nanda, 2008, J. Networks.

On Algorithms for Enumerating All Circuits of a Graph

Narsingh Deo, Prabhaker Mateti, N. Deo, 1976, SIAM J. Comput..

An Optimal Parallel Algorithm for Merging Using Multiselection

Amit Jain, Narsingh Deo, Muralidhar Medidi, 1994, Inf. Process. Lett..

Minimum-length fundamental cycle set

Narsingh Deo, 1979 .

Community Identification in Dynamic and Complex Networks

Narsingh Deo, Mahadevan Vasudevan, N. Deo, 2014, Encyclopedia of Social Network Analysis and Mining.

Parallel algorithms for merging and sorting

Dilip Sarkar, Narsingh Deo, 1991, Inf. Sci..

Parallel Processing Letters C World Scientiic Publishing Company Parallel Algorithms for Maximum Subsequence and Maximum Subarray

Narsingh Deo, Kalyan S. Perumalla, N. Deo, 2022 .

A birth-death dynamic model of scale-free networks

Narsingh Deo, Aurel Cami, 2005, ACM-SE 43.

Discrete Optimization Algorithms: with Pascal Programs

Narsingh Deo, Janusz S. Kowalik, Maciej M. Sysło, 2006 .

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

Narsingh Deo, Nishit Kumar, 1995, Parallel and Distributed Computing and Systems.

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

Narsingh Deo, Mahadevan Vasudevan, 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

Generalizations of Line Graphs and Applications

Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai, 1977, Inf. Process. Lett..

Efficient community identification in complex networks

Narsingh Deo, Mahadevan Vasudevan, 2012, Social Network Analysis and Mining.

Parallel graph algorithms for hypercube computers

Sajal K. Das, Sajal K. Das, Narsingh Deo, 1990, Parallel Comput..

Parallel heap: improved and simplified

Narsingh Deo, Sushil K. Prasad, 1992, Proceedings Sixth International Parallel Processing Symposium.

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

Narsingh Deo, Mahadevan Vasudevan, N. Deo, 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

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

Narsingh Deo, Aurel Cami, N. Deo, 2008, Networks.

Bibliometric approach to community discovery

Narsingh Deo, Hemant Balakrishnan, 2005, ACM-SE 43.

Shortest-path algorithms: Taxonomy and annotation

Narsingh Deo, Chi-Yin Pang, N. Deo, 1984, Networks.

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

Damla Turgut, Sumit Kumar Jha, Sunny Raj, 2017, BMC Bioinformatics.

Random-tree Diameter and the Diameter-constrained MST

Narsingh Deo, Ayman M. Abdalla, N. Deo, 2002, Int. J. Comput. Math..

Constructing Height-Balanced Trees in Parallel

Amit Jain, Narsingh Deo, Muralidhar Medidi, 1992, ICPP.

Two minimum spanning forest algorithms on fixed-size hypercube computers

Sajal K. Das, Sajal K. Das, Narsingh Deo, 1990, Parallel Comput..

Parallel Computers in Signal Processing

Narsingh Deo, 1985 .

Metric Graphs Elastically Embeddable in the Plane

Narsingh Deo, Jürg Nievergelt, 1995, Inf. Process. Lett..

Parallel Hungarian algorithm

Sajal K. Das, Narsingh Deo, 1990, Comput. Syst. Sci. Eng..

Parallel graph algorithms

Michael J. Quinn, Narsingh Deo, M. J. Quinn, 1984, CSUR.

A parallel algorithm for bound-smoothing

Narsingh Deo, Kumar Rajan, 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

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

Narsingh Deo, Mukkai S. Krishnamoorthy, 1979, Networks.

Parallel algorithms for the single source shortest path problem

Narsingh Deo, Prabhaker Mateti, N. Deo, 1982, Computing.

Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis

Sajal K. Das, Sajal K. Das, Narsingh Deo, 1989, FSTTCS.

Two EREW algorithms for parentheses matching

Narsingh Deo, Sushil K. Prasad, 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

Generalized Parallel Redundancy in Digital Computers

Narsingh Deo, 1968, IEEE Transactions on Computers.

Preferential deletion in dynamic models of web-like networks

Narsingh Deo, Aurel Cami, N. Deo, 2007, Inf. Process. Lett..

The Self-Diagnosability of a Computer

Narsingh Deo, 1966, IEEE Trans. Electron. Comput..

Detecting communities using bibliographic metrics

Narsingh Deo, Hemant Balakrishnan, N. Deo, 2006, 2006 IEEE International Conference on Granular Computing.

Exploring Topological Properties of NMR Graphs

Narsingh Deo, Paulius Micikevicius, 2007, 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering.

Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems

Sajal K. Das, Sajal K. Das, Joydeep Ghosh, 1992, Discret. Appl. Math..

Mining parameters that characterize the communities in web-like networks

Narsingh Deo, Aurel Cami, N. Deo, 2006, 2006 IEEE International Conference on Granular Computing.

Note on Hopcroft and Tarjan's Planarity Algorithm

Narsingh Deo, N. Deo, 1976, J. ACM.

Forbidden pairs combinatorics

Narsingh Deo, Bruce E. Litow, N. Deo, 2000, Australas. J Comb..

Cluster Computing for Determining Three-Dimensional Protein Structure

Narsingh Deo, Paulius Micikevicius, 2005, The Journal of Supercomputing.

Discovering communities in complex networks

Narsingh Deo, Hemant Balakrishnan, N. Deo, 2006, ACM-SE 44.

On the power of a perturbation for testing non-isomorphism of graphs

Narsingh Deo, G. M. Prabhu, N. Deo, 1984, BIT.

Parallel dictionaries on AVL trees

Narsingh Deo, Muralidhar Medidi, 1994, Proceedings of 8th International Parallel Processing Symposium.

Graph Theory with Applications to Engineering and Computer Science

Narsingh Deo, N. Deo, 1975, Networks.

Graph-Theoretic Web Algorithms: An Overview

Narsingh Deo, Pankaj Gupta, 2001, IICS.

Node-Deletion NP-Complete Problems

Narsingh Deo, M. S. Krishnamoorthy, N. Deo, 1979, SIAM J. Comput..

Parallel Heap

Narsingh Deo, Sushil K. Prasad, N. Deo, 1990, ICPP.

Graph theory with applications to engineering and computer science / Narsingh Deo

Narsingh Deo, 1987 .

Memory-Efficient Enumeration of Constrained Spanning Trees

Jürg Nievergelt, Narsingh Deo, Ambros Marzetta, 1999, Inf. Process. Lett..

Parallel algorithms and architectures report of a workshop

Michael J. Quinn, Elias N. Houstis, Layne T. Watson, 2004, The Journal of Supercomputing.

Algorithms for Generating Fundamental Cycles in a Graph

Narsingh Deo, G. M. Prabhu, M. S. Krishnamoorthy, 1982, TOMS.

Parallel Dictionaries Using AVL Trees

Narsingh Deo, Muralidhar Medidi, 1998, J. Parallel Distributed Comput..

Evaluation of a Graph-based Topical Crawler

Narsingh Deo, Aurel Cami, N. Deo, 2006, International Conference on Internet Computing.

On Finding Euler Tours in Parallel

Jayme Luiz Szwarcfiter, Edson Cáceres, Narsingh Deo, 1993, Parallel Process. Lett..

Parallel Construction of (a, b) -Trees

Amit Jain, Narsingh Deo, Muralidhar Medidi, 1994, J. Parallel Distributed Comput..

A graph theoretic algorithm for placing data and parity to tolerate two disk failures in disk array systems

Narsingh Deo, Sanjeeb Nanda, N. Deo, 2005, Ninth International Conference on Information Visualisation (IV'05).

On the expected number of level-i nodes in a random labeled tree

Narsingh Deo, Paulius Micikevicius, P. Micikevicius, 2002 .

A Central Tree

Narsingh Deo, 1966 .

Generation of Complete Trees

Narsingh Deo, W. Mayeda, S. Hakimi, 1968 .

Degree-correlation of a Scale-free Random Graph Process

Narsingh Deo, Ludek Kucera, Zoran Nikoloski, 2005 .

Parallel algorithms for the molecular conformation problem

Narsingh Deo, Kumar Rajan, 1999 .

Parallel graph algorithms for molecular conformation and tree codes

Narsingh Deo, Paulius Micikevicius, 2002 .

Degree-correlation of Scale-free graphs

Narsingh Deo, Ludek Kucera, Zoran Nikoloski, 2006 .

Generation of Graceful Trees

Narsingh Deo, Zoran Nikoloski, Francis Suraweera, 2002 .

A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains

Narsingh Deo, Li-Jen Mao, N. Deo, 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

Generating Edge-disjoint Sets of Quadruples in Parallel for the Molecular Conformation Problem

Narsingh Deo, Paulius Micikevicius, 2000 .

Compression of vertex transitive graphs

Narsingh Deo, Bruce Litow, Aurel Cami, 2004 .

On the Complexity of Finding Optimal Global Alliances

Ronald D. Dutton, Narsingh Deo, Aurel Cami, 2006 .

The knapsack problem with disjoint multiple-choice constraints

Dilip Sarkar, Narsingh Deo, Vijay Aggarwal, 1992 .

Parallel Algorithms for Computing Prüfer-Like Codes for Labeled Trees

Narsingh Deo, N. Deo, 2001 .

Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms

Narsingh Deo, N. Deo, Greg Daniel Tener, 2009 .

PARALLEL ALGORITHM FOR RADIOCOLORING A

Narsingh Deo, Hemant Balakrishnan, .

A new algorithm for digraph isomorphism

Narsingh Deo, J. M. Davis, R. E. Lord, 1977 .

PASCAL GRAPHS AND THEIR PROPERTIES

Narsingh Deo, Narsingh Deo, Michael J. Qu, 1983 .

Linear-time Algorithms for Encoding Trees as Sequences of Node Labels

Saverio Caminiti, Narsingh Deo, Paulius Micikevičius, 2006 .

1 On One-factorization of Complete 3-Uniform Hypergraphs

Narsingh Deo, Paulius Micikevicius, 2003 .

Rencontres Graphs: a Family of Bipartite Graphs*

Narsingh Deo, Sajal K Das, 1987 .

Correlation Model for Worm Propagation on Scale-free Graphs

Narsingh Deo, Ludek Kucera, Zoran Nikoloski, 2005 .