Narsingh Deo - RankMe

74 papers A 2B 2C 3Misc 4Journal 41Unranked 19

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