Narsingh Deo

	2008
58		Sanjeeb Nanda, Narsingh Deo: The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction. JNW 3(4): 64-71 (2008)
57		Aurel Cami, Narsingh Deo: Techniques for analyzing dynamic random graph models of web-like networks: An overview. Networks 51(4): 211-255 (2008)
	2007
56		Paulius Micikevicius, Narsingh Deo: Exploring Topological Properties of NMR Graphs. BIBE 2007: 1304-1307
55		Narsingh Deo, Aurel Cami: Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102(4): 156-162 (2007)
	2006
54		Hemant Balakrishnan, Narsingh Deo: Discovering communities in complex networks. ACM Southeast Regional Conference 2006: 280-285
53		Narsingh Deo, Aurel Cami: Mining parameters that characterize the communities in web-like networks. GrC 2006: 188-193
52		Hemant Balakrishnan, Narsingh Deo: Detecting communities using bibliographic metrics. GrC 2006: 293-298
51		Aurel Cami, Narsingh Deo: Evaluation of a Graph-based Topical Crawler. International Conference on Internet Computing 2006: 393-399
	2005
50		Narsingh Deo, Aurel Cami: A birth-death dynamic model of scale-free networks. ACM Southeast Regional Conference (2) 2005: 26-27
49		Narsingh Deo, Hemant Balakrishnan: Bibliometric approach to community discovery. ACM Southeast Regional Conference (2) 2005: 41-42
48		Narsingh Deo, Sanjeeb Nanda: A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems. IV 2005: 542-549
47		Paulius Micikevicius, Narsingh Deo: Cluster Computing for Determining Three-Dimensional Protein Structure. The Journal of Supercomputing 34(3): 243-271 (2005)
	2004
46		Bruce E. Litow, Narsingh Deo: Graph compression and the zeros of polynomials. Inf. Process. Lett. 92(1): 39-44 (2004)
	2002
45		Narsingh Deo, Paulius Micikevicius: Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem. IWDC 2002: 55-66
44		Ayman Abdalla, Narsingh Deo: Random-tree Diameter and the Diameter-constrained MST. Int. J. Comput. Math. 79(6): 651-663 (2002)
	2001
43		Narsingh Deo, Pankaj Gupta: Graph-Theoretic Web Algorithms: An Overview. IICS 2001: 91-102
	2000
42		Narsingh Deo, Ayman Abdalla: Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. CIAC 2000: 17-31
	1999
41		Kumar Rajan, Narsingh Deo: A Parallel Algorithm for Bound-Smoothing. IPPS/SPDP 1999: 645-652
40		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: 184-189
39		Jürg Nievergelt, Narsingh Deo, Ambros Marzetta: Memory-Efficient Enumeration of Constrained Spanning Trees. Inf. Process. Lett. 72(1-2): 47-53 (1999)
	1998
38		Muralidhar Medidi, Narsingh Deo: Parallel Dictionaries Using AVL Trees. J. Parallel Distrib. Comput. 49(1): 146-155 (1998)
	1996
37		Inien Syu, Sheau-Dong Lang, Narsingh Deo: Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval. CIKM 1996: 145-153
36		Bruce Boldon, Narsingh Deo, Nishit Kumar: Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Parallel Computing 22(3): 369-382 (1996)
	1995
35		Nishit Kumar, Narsingh Deo: Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley Transforms. Parallel and Distributed Computing and Systems 1995: 248-252
34		Jürg Nievergelt, Narsingh Deo: Metric Graphs Elastically Embeddable in the Plane. Inf. Process. Lett. 55(6): 309-315 (1995)
33		Kalyan S. Perumalla, Narsingh Deo: Parallel Algorithms for Maximum Subsequence and Maximum Subarray. Parallel Processing Letters 5: 367-373 (1995)
	1994
32		Muralidhar Medidi, Narsingh Deo: Parallel Dictionaries on AVL Trees. IPPS 1994: 878-882
31		Narsingh Deo, Amit Jain, Muralidhar Medidi: An Optimal Parallel Algorithm for Merging Using Multiselection. Inf. Process. Lett. 50(2): 81-87 (1994)
30		Narsingh Deo, Amit Jain, Muralidhar Medidi: Parallel Construction of (a, b) -Trees. J. Parallel Distrib. Comput. 23(3): 442-448 (1994)
	1993
29		Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter: On Finding Euler Tours in Parallel. Parallel Processing Letters 3: 223-231 (1993)
	1992
28		Narsingh Deo, Amit Jain, Muralidhar Medidi: Constructing Height-Balanced Trees in Parallel. ICPP (3) 1992: 297-300
27		Sushil K. Prasad, Narsingh Deo: Parallel Heap: Improved and Simplified. IPPS 1992: 448-451
26		Narsingh Deo, Muralidhar Medidi, Sushil K. Prasad: Processor Allocation in Parallel Battlefield Simulation. Winter Simulation Conference 1992: 718-725
25		Sajal K. Das, Joydeep Ghosh, Narsingh Deo: Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. Discrete Applied Mathematics 37/38: 119-146 (1992)
24		Narsingh Deo, Sushil K. Prasad: Parallel heap: An optimal parallel priority queue. The Journal of Supercomputing 6(1): 87-98 (1992)
	1991
23		Sushil K. Prasad, Narsingh Deo: Two EREW Algorithms for Parentheses Matching. IPPS 1991: 126-131
22		Sushil K. Prasad, Narsingh Deo: An efficient and scalable parallel algorithm for discrete-event simulation. Winter Simulation Conference 1991: 652-658
21		Narsingh Deo, Dilip Sarkar: Parallel algorithms for merging and sorting. Inf. Sci. 56(1-3): 151-161 (1991)
	1990
20		Narsingh Deo, Sushil K. Prasad: Parallel Heap. ICPP (3) 1990: 169-172
19		Sajal K. Das, Narsingh Deo: Parallel Hungarian algorithm. Comput. Syst. Sci. Eng. 5(3): 131-136 (1990)
18		Dilip Sarkar, Narsingh Deo: Estimating the Speedup in Parallel Parsing. IEEE Trans. Software Eng. 16(7): 677-683 (1990)
17		Sajal K. Das, Narsingh Deo, Sushil K. Prasad: Parallel graph algorithms for hypercube computers. Parallel Computing 13(2): 143-158 (1990)
16		Sajal K. Das, Narsingh Deo, Sushil K. Prasad: Two minimum spanning forest algorithms on fixed-size hypercube computers. Parallel Computing 15(1-3): 179-187 (1990)
	1989
15		Sajal K. Das, Narsingh Deo, Sushil K. Prasad: Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis. FSTTCS 1989: 280-290
	1988
14		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 Watson, Jon Webb: Parallel algorithms and architectures report of a workshop. The Journal of Supercomputing 1(3): 301-325 (1988)
	1987
13		Dilip Sarkar, Narsingh Deo: An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages. ICPP 1987: 585-588
12		Dilip Sarkar, Narsingh Deo: Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses. ICS 1987: 970-984
11		Narsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston: Exact and Approximate Solutions for the Gate Matrix Layout Problem. IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 79-84 (1987)
	1986
10		Dilip Sarkar, Narsingh Deo: Estimating the Speedup in Parallel Parsing. ICPP 1986: 157-163
9		Michael J. Quinn, Narsingh Deo: An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. BIT 26(1): 35-43 (1986)
	1984
8		Michael J. Quinn, Narsingh Deo: Parallel Graph Algorithms. ACM Comput. Surv. 16(3): 319-348 (1984)
7		G. M. Prabhu, Narsingh Deo: On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. BIT 24(3): 302-307 (1984)
	1982
6		Narsingh Deo, G. M. Prabhu, Mukkai S. Krishnamoorthy: Algorithms for Generating Fundamental Cycles in a Graph. ACM Trans. Math. Softw. 8(1): 26-42 (1982)
	1979
5		A. S. Sethi, Narsingh Deo: Interference in Multiprocessor Systems with Localized Memory Access Probabilities. IEEE Trans. Computers 28(2): 157-163 (1979)
4		Mukkai S. Krishnamoorthy, Narsingh Deo: Node-Deletion NP-Complete Problems. SIAM J. Comput. 8(4): 619-625 (1979)
	1977
3		Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai: Generalizations of Line Graphs and Applications. Inf. Process. Lett. 6(1): 14-17 (1977)
	1976
2		Narsingh Deo: Note on Hopcroft and Tarjan's Planarity Algorithm. J. ACM 23(1): 74-75 (1976)
1		Prabhaker Mateti, Narsingh Deo: On Algorithms for Enumerating All Circuits of a Graph. SIAM J. Comput. 5(1): 90-99 (1976)

Coauthor Index

1	Ayman Abdalla	[42] [44]
2	Hemant Balakrishnan	[49] [52] [54]
3	Bruce Boldon	[36]
4	Duncan A. Buell	[14]
5	Edson Cáceres (Edson Norberto Cáceres, E. N. Cáceres)	[29]
6	Aurel Cami	[50] [51] [53] [55] [57]
7	David A. Carlson	[14]
8	Yuan-Chieh Chow	[14]
9	Karel Culík	[14]
10	Sajal K. Das	[15] [16] [17] [19] [25]
11	Raphael A. Finkel	[14]
12	Joydeep Ghosh	[25]
13	Pankaj Gupta	[43]
14	Elias N. Houstis	[14]
15	Amit Jain	[28] [30] [31]
16	Zvi M. Kedem	[14]
17	Janusz S. Kowalik	[14]
18	Mukkai S. Krishnamoorthy	[3] [4] [6] [11]
19	Philip Kuekes	[14]
20	Nishit Kumar	[35] [36]
21	Sheau-Dong Lang	[37] [40]
22	Michael A. Langston	[11]
23	Bruce E. Litow	[46]
24	Li-Jen Mao	[40]
25	Joanne L. Martin	[14]
26	Ambros Marzetta	[39]
27	Prabhaker Mateti	[1]
28	Muralidhar Medidi	[26] [28] [30] [31] [32] [38]
29	George A. Michael	[14]
30	Paulius Micikevicius	[45] [47] [56]
31	Sanjeeb Nanda	[48] [58]
32	Jürg Nievergelt	[34] [39]
33	Neil s. Ostlund	[14]
34	Ajit B. Pai	[3]
35	Kalyan S. Perumalla	[33]
36	Jerry Potter	[14]
37	G. M. Prabhu	[6] [7]
38	D. K. Pradhan	[14]
39	Sushil K. Prasad	[15] [16] [17] [20] [22] [23] [24] [26] [27]
40	Michael J. Quinn	[8] [9] [14]
41	Kumar Rajan	[41]
42	Dilip Sarkar	[10] [12] [13] [18] [21]
43	Shivakumar Sastry	[29]
44	A. S. Sethi	[5]
45	Elaine M. Jacob Son	[14]
46	G. W. Stewart	[14]
47	Quentin F. Stout	[14]
48	Inien Syu	[37]
49	Jayme Luiz Szwarcfiter	[29]
50	Layne Watson	[14]
51	Jon Webb	[14]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page