dblp.uni-trier.dewww.uni-trier.de

Narsingh Deo

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
53EESanjeeb Nanda, Narsingh Deo: The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction. JNW 3(4): 64-71 (2008)
52EEAurel Cami, Narsingh Deo: Techniques for analyzing dynamic random graph models of web-like networks: An overview. Networks 51(4): 211-255 (2008)
2007
51EEPaulius Micikevicius, Narsingh Deo: Exploring Topological Properties of NMR Graphs. BIBE 2007: 1304-1307
50EENarsingh Deo, Aurel Cami: Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102(4): 156-162 (2007)
2006
49EEHemant Balakrishnan, Narsingh Deo: Discovering communities in complex networks. ACM Southeast Regional Conference 2006: 280-285
48 Aurel Cami, Narsingh Deo: Evaluation of a Graph-based Topical Crawler. International Conference on Internet Computing 2006: 393-399
2005
47EENarsingh Deo, Aurel Cami: A birth-death dynamic model of scale-free networks. ACM Southeast Regional Conference (2) 2005: 26-27
46EENarsingh Deo, Hemant Balakrishnan: Bibliometric approach to community discovery. ACM Southeast Regional Conference (2) 2005: 41-42
45EENarsingh 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
44EEPaulius Micikevicius, Narsingh Deo: Cluster Computing for Determining Three-Dimensional Protein Structure. The Journal of Supercomputing 34(3): 243-271 (2005)
2004
43EEBruce E. Litow, Narsingh Deo: Graph compression and the zeros of polynomials. Inf. Process. Lett. 92(1): 39-44 (2004)
2002
42EENarsingh Deo, Paulius Micikevicius: Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem. IWDC 2002: 55-66
41EEAyman Abdalla, Narsingh Deo: Random-tree Diameter and the Diameter-constrained MST. Int. J. Comput. Math. 79(6): 651-663 (2002)
2001
40EENarsingh Deo, Pankaj Gupta: Graph-Theoretic Web Algorithms: An Overview. IICS 2001: 91-102
2000
39EENarsingh Deo, Ayman Abdalla: Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. CIAC 2000: 17-31
1999
38EEKumar Rajan, Narsingh Deo: A Parallel Algorithm for Bound-Smoothing. IPPS/SPDP 1999: 645-652
37EELi-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
36EEJürg Nievergelt, Narsingh Deo, Ambros Marzetta: Memory-Efficient Enumeration of Constrained Spanning Trees. Inf. Process. Lett. 72(1-2): 47-53 (1999)
1998
35 Muralidhar Medidi, Narsingh Deo: Parallel Dictionaries Using AVL Trees. J. Parallel Distrib. Comput. 49(1): 146-155 (1998)
1996
34EEInien Syu, Sheau-Dong Lang, Narsingh Deo: Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval. CIKM 1996: 145-153
33 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
32 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
31EEJürg Nievergelt, Narsingh Deo: Metric Graphs Elastically Embeddable in the Plane. Inf. Process. Lett. 55(6): 309-315 (1995)
30 Kalyan S. Perumalla, Narsingh Deo: Parallel Algorithms for Maximum Subsequence and Maximum Subarray. Parallel Processing Letters 5: 367-373 (1995)
1994
29 Muralidhar Medidi, Narsingh Deo: Parallel Dictionaries on AVL Trees. IPPS 1994: 878-882
28 Narsingh Deo, Amit Jain, Muralidhar Medidi: An Optimal Parallel Algorithm for Merging Using Multiselection. Inf. Process. Lett. 50(2): 81-87 (1994)
27 Narsingh Deo, Amit Jain, Muralidhar Medidi: Parallel Construction of (a, b) -Trees. J. Parallel Distrib. Comput. 23(3): 442-448 (1994)
1993
26 Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter: On Finding Euler Tours in Parallel. Parallel Processing Letters 3: 223-231 (1993)
1992
25 Narsingh Deo, Amit Jain, Muralidhar Medidi: Constructing Height-Balanced Trees in Parallel. ICPP (3) 1992: 297-300
24 Sushil K. Prasad, Narsingh Deo: Parallel Heap: Improved and Simplified. IPPS 1992: 448-451
23EENarsingh Deo, Muralidhar Medidi, Sushil K. Prasad: Processor Allocation in Parallel Battlefield Simulation. Winter Simulation Conference 1992: 718-725
22EESajal K. Das, Joydeep Ghosh, Narsingh Deo: Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. Discrete Applied Mathematics 37/38: 119-146 (1992)
1991
21 Sushil K. Prasad, Narsingh Deo: Two EREW Algorithms for Parentheses Matching. IPPS 1991: 126-131
20EESushil K. Prasad, Narsingh Deo: An efficient and scalable parallel algorithm for discrete-event simulation. Winter Simulation Conference 1991: 652-658
19EENarsingh Deo, Dilip Sarkar: Parallel algorithms for merging and sorting. Inf. Sci. 56(1-3): 151-161 (1991)
1990
18 Narsingh Deo, Sushil K. Prasad: Parallel Heap. ICPP (3) 1990: 169-172
17 Sajal K. Das, Narsingh Deo: Parallel Hungarian algorithm. Comput. Syst. Sci. Eng. 5(3): 131-136 (1990)
16EEDilip Sarkar, Narsingh Deo: Estimating the Speedup in Parallel Parsing. IEEE Trans. Software Eng. 16(7): 677-683 (1990)
15 Sajal K. Das, Narsingh Deo, Sushil K. Prasad: Parallel graph algorithms for hypercube computers. Parallel Computing 13(2): 143-158 (1990)
14 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
13 Sajal K. Das, Narsingh Deo, Sushil K. Prasad: Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis. FSTTCS 1989: 280-290
1987
12 Dilip Sarkar, Narsingh Deo: An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages. ICPP 1987: 585-588
11 Dilip Sarkar, Narsingh Deo: Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses. ICS 1987: 970-984
10EENarsingh 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
9 Dilip Sarkar, Narsingh Deo: Estimating the Speedup in Parallel Parsing. ICPP 1986: 157-163
8 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
7 Michael J. Quinn, Narsingh Deo: Parallel Graph Algorithms. ACM Comput. Surv. 16(3): 319-348 (1984)
6 G. M. Prabhu, Narsingh Deo: On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. BIT 24(3): 302-307 (1984)
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
2EENarsingh 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

1Ayman Abdalla [39] [41]
2Hemant Balakrishnan [46] [49]
3Bruce Boldon [33]
4Edson Cáceres (Edson Norberto Cáceres, E. N. Cáceres) [26]
5Aurel Cami [47] [48] [50] [52]
6Sajal K. Das [13] [14] [15] [17] [22]
7Joydeep Ghosh [22]
8Pankaj Gupta [40]
9Amit Jain [25] [27] [28]
10Mukkai S. Krishnamoorthy [3] [4] [10]
11Nishit Kumar [32] [33]
12Sheau-Dong Lang [34] [37]
13Michael A. Langston [10]
14Bruce E. Litow [43]
15Li-Jen Mao [37]
16Ambros Marzetta [36]
17Prabhaker Mateti [1]
18Muralidhar Medidi [23] [25] [27] [28] [29] [35]
19Paulius Micikevicius [42] [44] [51]
20Sanjeeb Nanda [45] [53]
21Jürg Nievergelt [31] [36]
22Ajit B. Pai [3]
23Kalyan S. Perumalla [30]
24G. M. Prabhu [6]
25Sushil K. Prasad [13] [14] [15] [18] [20] [21] [23] [24]
26Michael J. Quinn [7] [8]
27Kumar Rajan [38]
28Dilip Sarkar [9] [11] [12] [16] [19]
29Shivakumar Sastry [26]
30A. S. Sethi [5]
31Inien Syu [34]
32Jayme Luiz Szwarcfiter [26]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)