Narsingh Deo

Publication Activity (10 Years)

Years Active: 1966-2017
Publications (10 Years): 3

Top Topics

Complex Networks

Decision Procedures

Community Detection

Theorem Proving

Top Venues

Soc. Netw. Anal. Min.

Publications

Sunny Raj, Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Damla Turgut, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Jeff Chang, Sumit Kumar Jha
A theorem proving approach for automatically synthesizing visualizations of flow cytometry data. BMC Bioinform. 18 (8) (2017)
Antoniya Petkova, Charles E. Hughes, Narsingh Deo, Martin Dimitrov
Accelerating the distributed simulations of agent-based models using community detection. RIVF (2016)
Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Chang, Sumit Kumar Jha
SANJAY: Automatically synthesizing visualizations of flow cytometry data using decision procedures. ICCABS (2015)
Mahadevan Vasudevan, Narsingh Deo
Efficient community identification in complex networks. Soc. Netw. Anal. Min. 2 (4) (2012)
Sanjeeb Nanda, Narsingh Deo
The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction. J. Networks 3 (4) (2008)
Aurel Cami, Narsingh Deo
Techniques for analyzing dynamic random graph models of web-like networks: An overview. Networks 51 (4) (2008)
Narsingh Deo, Aurel Cami
Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102 (4) (2007)
Paulius Micikevicius, Narsingh Deo
Exploring Topological Properties of NMR Graphs. BIBE (2007)
Hemant Balakrishnan, Narsingh Deo
Detecting communities using bibliographic metrics. GrC (2006)
Aurel Cami, Narsingh Deo
Evaluation of a Graph-based Topical Crawler. International Conference on Internet Computing (2006)
Narsingh Deo, Aurel Cami
Mining parameters that characterize the communities in web-like networks. GrC (2006)
Hemant Balakrishnan, Narsingh Deo
Discovering communities in complex networks. ACM Southeast Regional Conference (2006)
Paulius Micikevicius, Narsingh Deo
Cluster Computing for Determining Three-Dimensional Protein Structure. J. Supercomput. 34 (3) (2005)
Narsingh Deo, Sanjeeb Nanda
A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems. IV (2005)
Narsingh Deo, Aurel Cami
A birth-death dynamic model of scale-free networks. ACM Southeast Regional Conference (2) (2005)
Narsingh Deo, Hemant Balakrishnan
Bibliometric approach to community discovery. ACM Southeast Regional Conference (2) (2005)
Bruce E. Litow, Narsingh Deo
Graph compression and the zeros of polynomials. Inf. Process. Lett. 92 (1) (2004)
Narsingh Deo, Paulius Micikevicius
Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem. IWDC (2002)
Ayman M. Abdalla, Narsingh Deo
Random-tree Diameter and the Diameter-constrained MST. Int. J. Comput. Math. 79 (6) (2002)
Narsingh Deo, Pankaj Gupta
Graph-Theoretic Web Algorithms: An Overview. IICS (2001)
Bruce E. Litow, Narsingh Deo
Forbidden pairs combinatorics. Australas. J Comb. 22 (2000)
Narsingh Deo, Ayman M. Abdalla
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. CIAC (2000)
Kumar Rajan, Narsingh Deo
A Parallel Algorithm for Bound-Smoothing. IPPS/SPDP (1999)
Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. ISPAN (1999)
Jürg Nievergelt, Narsingh Deo, Ambros Marzetta
Memory-Efficient Enumeration of Constrained Spanning Trees. Inf. Process. Lett. 72 (1-2) (1999)
Muralidhar Medidi, Narsingh Deo
Parallel Dictionaries Using AVL Trees. J. Parallel Distributed Comput. 49 (1) (1998)
Narsingh Deo, Nishit Kumar
Constrained spanning tree problems: Approximate methods and parallel computation. Network Design: Connectivity and Facilities Location (1997)
Inien Syu, Sheau-Dong Lang, Narsingh Deo
Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval. CIKM (1996)
Inien Syu, Sheau-Dong Lang, Narsingh Deo
A neural network model for information retrieval using latent semantic indexing. ICNN (1996)
Bruce Boldon, Narsingh Deo, Nishit Kumar
Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Parallel Comput. 22 (3) (1996)
Jürg Nievergelt, Narsingh Deo
Metric Graphs Elastically Embeddable in the Plane. Inf. Process. Lett. 55 (6) (1995)
Kalyan S. Perumalla, Narsingh Deo
Parallel Algorithms for Maximum Subsequence and Maximum Subarray. Parallel Process. Lett. 5 (1995)
Nishit Kumar, Narsingh Deo
Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley Transforms. Parallel and Distributed Computing and Systems (1995)
Narsingh Deo, Amit Jain, Muralidhar Medidi
An Optimal Parallel Algorithm for Merging Using Multiselection. Inf. Process. Lett. 50 (2) (1994)
Muralidhar Medidi, Narsingh Deo
Parallel Dictionaries on AVL Trees. IPPS (1994)
Narsingh Deo, Amit Jain, Muralidhar Medidi
Parallel Construction of (a, b) -Trees. J. Parallel Distributed Comput. 23 (3) (1994)
Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter
On Finding Euler Tours in Parallel. Parallel Process. Lett. 3 (1993)
Narsingh Deo, Amit Jain, Muralidhar Medidi
Constructing Height-Balanced Trees in Parallel. ICPP (3) (1992)
Narsingh Deo, Sushil K. Prasad
Parallel heap: An optimal parallel priority queue. J. Supercomput. 6 (1) (1992)
Narsingh Deo, Muralidhar Medidi, Sushil K. Prasad
Processor Allocation in Parallel Battlefield Simulation. WSC (1992)
Sushil K. Prasad, Narsingh Deo
Parallel Heap: Improved and Simplified. IPPS (1992)
Sajal K. Das, Joydeep Ghosh, Narsingh Deo
Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. Discret. Appl. Math. (1992)
Sushil K. Prasad, Narsingh Deo
An efficient and scalable parallel algorithm for discrete-event simulation. WSC (1991)
Narsingh Deo, Dilip Sarkar
Parallel algorithms for merging and sorting. Inf. Sci. 56 (1-3) (1991)
Sushil K. Prasad, Narsingh Deo
Two EREW Algorithms for Parentheses Matching. IPPS (1991)
Dilip Sarkar, Narsingh Deo
Estimating the Speedup in Parallel Parsing. IEEE Trans. Software Eng. 16 (7) (1990)
Sajal K. Das, Narsingh Deo, Sushil K. Prasad
Parallel graph algorithms for hypercube computers. Parallel Comput. 13 (2) (1990)
Sajal K. Das, Narsingh Deo
Parallel Hungarian algorithm. Comput. Syst. Sci. Eng. 5 (3) (1990)
Narsingh Deo, Sushil K. Prasad
Parallel Heap. ICPP (3) (1990)
Sajal K. Das, Narsingh Deo, Sushil K. Prasad
Two minimum spanning forest algorithms on fixed-size hypercube computers. Parallel Comput. 15 (1-3) (1990)
Sajal K. Das, Narsingh Deo, Sushil K. Prasad
Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis. FSTTCS (1989)
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
Parallel algorithms and architectures report of a workshop. J. Supercomput. 1 (3) (1988)
Dilip Sarkar, Narsingh Deo
Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses. ICS (1987)
Narsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston
Exact and Approximate Solutions for the Gate Matrix Layout Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6 (1) (1987)
Dilip Sarkar, Narsingh Deo
An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages. ICPP (1987)
Dilip Sarkar, Narsingh Deo
Estimating the Speedup in Parallel Parsing. ICPP (1986)
Michael J. Quinn, Narsingh Deo
An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. BIT 26 (1) (1986)
G. M. Prabhu, Narsingh Deo
On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. BIT 24 (3) (1984)
Narsingh Deo, Chi-Yin Pang
Shortest-path algorithms: Taxonomy and annotation. Networks 14 (2) (1984)
Michael J. Quinn, Narsingh Deo
Parallel Graph Algorithms. ACM Comput. Surv. 16 (3) (1984)
Narsingh Deo, G. M. Prabhu, Mukkai S. Krishnamoorthy
Algorithms for Generating Fundamental Cycles in a Graph. ACM Trans. Math. Softw. 8 (1) (1982)
Prabhaker Mateti, Narsingh Deo
Parallel algorithms for the single source shortest path problem. Computing 29 (1) (1982)
Adarshpal S. Sethi, Narsingh Deo
Interference in Multiprocessor Systems with Localized Memory Access Probabilities. IEEE Trans. Computers 28 (2) (1979)
Mukkai S. Krishnamoorthy, Narsingh Deo
Node-Deletion NP-Complete Problems. SIAM J. Comput. 8 (4) (1979)
Mukkai S. Krishnamoorthy, Narsingh Deo
Complexity of the minimum-dummy-activities problem in a pert network. Networks 9 (3) (1979)
Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai
Generalizations of Line Graphs and Applications. Inf. Process. Lett. 6 (1) (1977)
Narsingh Deo
Note on Hopcroft and Tarjan's Planarity Algorithm. J. ACM 23 (1) (1976)
Prabhaker Mateti, Narsingh Deo
On Algorithms for Enumerating All Circuits of a Graph. SIAM J. Comput. 5 (1) (1976)
Narsingh Deo
. IEEE Trans. Computers 18 (1) (1969)
Narsingh Deo
Generalized Parallel Redundancy in Digital Computers. IEEE Trans. Computers 17 (6) (1968)
Narsingh Deo
The Self-Diagnosability of a Computer. IEEE Trans. Electron. Comput. 15 (5) (1966)