default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNarsingh Deo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[r3]Mahadevan Vasudevan, Narsingh Deo:
Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018- 2017
- [j41]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): 245:1-245:11 (2017) - 2016
- [c30]Antoniya Petkova, Charles E. Hughes, Narsingh Deo, Martin Dimitrov:
Accelerating the distributed simulations of agent-based models using community detection. RIVF 2016: 25-30 - 2015
- [c29]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: 1 - 2014
- [r2]Mahadevan Vasudevan, Narsingh Deo:
Community Identification in Dynamic and Complex Networks. Encyclopedia of Social Network Analysis and Mining 2014: 232-238 - 2012
- [j40]Mahadevan Vasudevan, Narsingh Deo:
Efficient community identification in complex networks. Soc. Netw. Anal. Min. 2(4): 345-359 (2012)
2000 – 2009
- 2008
- [j39]Sanjeeb Nanda, Narsingh Deo:
The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction. J. Networks 3(4): 64-71 (2008) - [j38]Aurel Cami, Narsingh Deo:
Techniques for analyzing dynamic random graph models of web-like networks: An overview. Networks 51(4): 211-255 (2008) - 2007
- [j37]Narsingh Deo, Aurel Cami:
Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102(4): 156-162 (2007) - [c28]Paulius Micikevicius, Narsingh Deo:
Exploring Topological Properties of NMR Graphs. BIBE 2007: 1304-1307 - 2006
- [c27]Hemant Balakrishnan, Narsingh Deo:
Discovering communities in complex networks. ACM Southeast Regional Conference 2006: 280-285 - [c26]Narsingh Deo, Aurel Cami:
Mining parameters that characterize the communities in web-like networks. GrC 2006: 188-193 - [c25]Hemant Balakrishnan, Narsingh Deo:
Detecting communities using bibliographic metrics. GrC 2006: 293-298 - [c24]Aurel Cami, Narsingh Deo:
Evaluation of a Graph-based Topical Crawler. International Conference on Internet Computing 2006: 393-399 - 2005
- [j36]Paulius Micikevicius, Narsingh Deo:
Cluster Computing for Determining Three-Dimensional Protein Structure. J. Supercomput. 34(3): 243-271 (2005) - [c23]Narsingh Deo, Aurel Cami:
A birth-death dynamic model of scale-free networks. ACM Southeast Regional Conference (2) 2005: 26-27 - [c22]Narsingh Deo, Hemant Balakrishnan:
Bibliometric approach to community discovery. ACM Southeast Regional Conference (2) 2005: 41-42 - [c21]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 - 2004
- [j35]Bruce E. Litow, Narsingh Deo:
Graph compression and the zeros of polynomials. Inf. Process. Lett. 92(1): 39-44 (2004) - [r1]Narsingh Deo:
Graphs. Handbook of Data Structures and Applications 2004 - 2002
- [j34]Ayman M. Abdalla, Narsingh Deo:
Random-tree Diameter and the Diameter-constrained MST. Int. J. Comput. Math. 79(6): 651-663 (2002) - [c20]Narsingh Deo, Paulius Micikevicius:
Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem. IWDC 2002: 55-66 - 2001
- [c19]Narsingh Deo, Pankaj Gupta:
Graph-Theoretic Web Algorithms: An Overview. IICS 2001: 91-102 - 2000
- [j33]Bruce E. Litow, Narsingh Deo:
Forbidden pairs combinatorics. Australas. J Comb. 22: 91-100 (2000) - [c18]Narsingh Deo, Ayman M. Abdalla:
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. CIAC 2000: 17-31
1990 – 1999
- 1999
- [j32]Jürg Nievergelt, Narsingh Deo, Ambros Marzetta:
Memory-Efficient Enumeration of Constrained Spanning Trees. Inf. Process. Lett. 72(1-2): 47-53 (1999) - [c17]Kumar Rajan, Narsingh Deo:
A Parallel Algorithm for Bound-Smoothing. IPPS/SPDP 1999: 645-652 - [c16]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 - 1998
- [j31]Muralidhar Medidi, Narsingh Deo:
Parallel Dictionaries Using AVL Trees. J. Parallel Distributed Comput. 49(1): 146-155 (1998) - 1997
- [c15]Narsingh Deo, Nishit Kumar:
Constrained spanning tree problems: Approximate methods and parallel computation. Network Design: Connectivity and Facilities Location 1997: 191-217 - 1996
- [j30]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): 369-382 (1996) - [c14]Inien Syu, Sheau-Dong Lang, Narsingh Deo:
Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval. CIKM 1996: 145-153 - [c13]Inien Syu, Sheau-Dong Lang, Narsingh Deo:
A neural network model for information retrieval using latent semantic indexing. ICNN 1996: 1318-1323 - 1995
- [j29]Jürg Nievergelt, Narsingh Deo:
Metric Graphs Elastically Embeddable in the Plane. Inf. Process. Lett. 55(6): 309-315 (1995) - [j28]Kalyan S. Perumalla, Narsingh Deo:
Parallel Algorithms for Maximum Subsequence and Maximum Subarray. Parallel Process. Lett. 5: 367-373 (1995) - [c12]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 - 1994
- [j27]Narsingh Deo, Amit Jain, Muralidhar Medidi:
An Optimal Parallel Algorithm for Merging Using Multiselection. Inf. Process. Lett. 50(2): 81-87 (1994) - [j26]Narsingh Deo, Amit Jain, Muralidhar Medidi:
Parallel Construction of (a, b) -Trees. J. Parallel Distributed Comput. 23(3): 442-448 (1994) - [c11]Muralidhar Medidi, Narsingh Deo:
Parallel Dictionaries on AVL Trees. IPPS 1994: 878-882 - 1993
- [j25]Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter:
On Finding Euler Tours in Parallel. Parallel Process. Lett. 3: 223-231 (1993) - 1992
- [j24]Sajal K. Das, Joydeep Ghosh, Narsingh Deo:
Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. Discret. Appl. Math. 37/38: 119-146 (1992) - [j23]Narsingh Deo, Sushil K. Prasad:
Parallel heap: An optimal parallel priority queue. J. Supercomput. 6(1): 87-98 (1992) - [c10]Narsingh Deo, Amit Jain, Muralidhar Medidi:
Constructing Height-Balanced Trees in Parallel. ICPP (3) 1992: 297-300 - [c9]Sushil K. Prasad, Narsingh Deo:
Parallel Heap: Improved and Simplified. IPPS 1992: 448-451 - [c8]Narsingh Deo, Muralidhar Medidi, Sushil K. Prasad:
Processor Allocation in Parallel Battlefield Simulation. WSC 1992: 718-725 - 1991
- [j22]Narsingh Deo, Dilip Sarkar:
Parallel algorithms for merging and sorting. Inf. Sci. 56(1-3): 151-161 (1991) - [c7]Sushil K. Prasad, Narsingh Deo:
Two EREW Algorithms for Parentheses Matching. IPPS 1991: 126-131 - [c6]Sushil K. Prasad, Narsingh Deo:
An efficient and scalable parallel algorithm for discrete-event simulation. WSC 1991: 652-658 - 1990
- [j21]Sajal K. Das, Narsingh Deo:
Parallel Hungarian algorithm. Comput. Syst. Sci. Eng. 5(3): 131-136 (1990) - [j20]Sajal K. Das, Narsingh Deo, Sushil K. Prasad:
Parallel graph algorithms for hypercube computers. Parallel Comput. 13(2): 143-158 (1990) - [j19]Sajal K. Das, Narsingh Deo, Sushil K. Prasad:
Two minimum spanning forest algorithms on fixed-size hypercube computers. Parallel Comput. 15(1-3): 179-187 (1990) - [j18]Dilip Sarkar, Narsingh Deo:
Estimating the Speedup in Parallel Parsing. IEEE Trans. Software Eng. 16(7): 677-683 (1990) - [c5]Narsingh Deo, Sushil K. Prasad:
Parallel Heap. ICPP (3) 1990: 169-172
1980 – 1989
- 1989
- [c4]Sajal K. Das, Narsingh Deo, Sushil K. Prasad:
Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis. FSTTCS 1989: 280-290 - 1988
- [j17]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): 301-325 (1988) - 1987
- [j16]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): 79-84 (1987) - [c3]Dilip Sarkar, Narsingh Deo:
An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages. ICPP 1987: 585-588 - [c2]Dilip Sarkar, Narsingh Deo:
Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses. ICS 1987: 970-984 - 1986
- [j15]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) - [c1]Dilip Sarkar, Narsingh Deo:
Estimating the Speedup in Parallel Parsing. ICPP 1986: 157-163 - 1984
- [j14]G. M. Prabhu, Narsingh Deo:
On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. BIT 24(3): 302-307 (1984) - [j13]Michael J. Quinn, Narsingh Deo:
Parallel Graph Algorithms. ACM Comput. Surv. 16(3): 319-348 (1984) - [j12]Narsingh Deo, Chi-Yin Pang:
Shortest-path algorithms: Taxonomy and annotation. Networks 14(2): 275-323 (1984) - 1982
- [j11]Prabhaker Mateti, Narsingh Deo:
Parallel algorithms for the single source shortest path problem. Computing 29(1): 31-49 (1982) - [j10]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)
1970 – 1979
- 1979
- [j9]Mukkai S. Krishnamoorthy, Narsingh Deo:
Complexity of the minimum-dummy-activities problem in a pert network. Networks 9(3): 189-194 (1979) - [j8]Mukkai S. Krishnamoorthy, Narsingh Deo:
Node-Deletion NP-Complete Problems. SIAM J. Comput. 8(4): 619-625 (1979) - [j7]Adarshpal S. Sethi, Narsingh Deo:
Interference in Multiprocessor Systems with Localized Memory Access Probabilities. IEEE Trans. Computers 28(2): 157-163 (1979) - 1977
- [j6]Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai:
Generalizations of Line Graphs and Applications. Inf. Process. Lett. 6(1): 14-17 (1977) - 1976
- [j5]Narsingh Deo:
Note on Hopcroft and Tarjan's Planarity Algorithm. J. ACM 23(1): 74-75 (1976) - [j4]Prabhaker Mateti, Narsingh Deo:
On Algorithms for Enumerating All Circuits of a Graph. SIAM J. Comput. 5(1): 90-99 (1976)
1960 – 1969
- 1969
- [j3]Narsingh Deo:
Author's Reply3. IEEE Trans. Computers 18(1): 80 (1969) - 1968
- [j2]Narsingh Deo:
Generalized Parallel Redundancy in Digital Computers. IEEE Trans. Computers 17(6): 600 (1968) - 1966
- [j1]Narsingh Deo:
The Self-Diagnosability of a Computer. IEEE Trans. Electron. Comput. 15(5): 799 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
