E-LIB Suche - Ergebnisse für: Deo, Narsingh

1

A theorem proving approach for automatically synthesizing v..:

Raj, Sunny ; Hussain, Faraz ; Husein, Zubir...
BMC Bioinformatics. 18 (2017) S8 - p. , 2017

Link: https://doi.org/10.1186/..

2

Efficient community identification in complex networks:

Vasudevan, Mahadevan ; Deo, Narsingh
Social Network Analysis and Mining. 2 (2012) 4 - p. 345-359 , 2012

Link: https://doi.org/10.1007/..

3

Techniques for analyzing dynamic random graph models of web..:

Cami, Aurel ; Deo, Narsingh
Networks. 51 (2007) 4 - p. 211-255 , 2007

Link: https://doi.org/10.1002/..

4

Preferential deletion in dynamic models of web-like network:

Deo, Narsingh ; Cami, Aurel
Information Processing Letters. 102 (2007) 4 - p. 156-162 , 2007

Link: https://doi.org/10.1016/..

5

Discovering communities in complex networks:

, In: Proceedings of the 44th annual Southeast regional conference,

Balakrishnan, Hemant ; Deo, Narsingh - p. 280-285 , 2006

Link: https://dl.acm.org/doi/1..

6

Bibliometric approach to community discovery:

, In: Proceedings of the 43rd annual Southeast regional conference - Volume 2,

Deo, Narsingh ; Balakrishnan, Hemant - p. 41-42 , 2005

Link: https://dl.acm.org/doi/1..

7

A birth-death dynamic model of scale-free networks:

, In: Proceedings of the 43rd annual Southeast regional conference - Volume 2,

Deo, Narsingh ; Cami, Aurel - p. 26-27 , 2005

Link: https://dl.acm.org/doi/1..

8

Cluster Computing for Determining Three-Dimensional Protein..:

Micikevicius, Paulius ; Deo, Narsingh
The Journal of Supercomputing. 34 (2005) 3 - p. 243-271 , 2005

Link: https://doi.org/10.1007/..

9

Random-tree Diameter and the Diameter-constrained MST:

Abdalla, Ayman ; Deo, Narsingh
International Journal of Computer Mathematics. 79 (2002) 6 - p. 651-663 , 2002

Link: https://doi.org/10.1080/..

10

Memory-efficient enumeration of constrained spanning trees:

Nievergelt, Jurg ; Deo, Narsingh ; Marzetta, Ambros
Information Processing Letters. 72 (1999) 1-2 - p. 47-53 , 1999

Link: https://doi.org/10.1016/..

11

Parallel Dictionaries Using AVL Trees:

Medidi, Muralidhar ; Deo, Narsingh
Journal of Parallel and Distributed Computing. 49 (1998) 1 - p. 146-155 , 1998

Link: https://doi.org/10.1006/..

12

Incorporating latent semantic indexing into a neural networ..:

, In: Proceedings of the fifth international conference on Information and knowledge management,

Syu, Inien ; Lang, S. D. ; Deo, Narsingh - p. 145-153 , 1996

Link: https://dl.acm.org/doi/1..

13

Minimum-weight degree-constrained spanning tree problem: He..:

Boldon, Bruce ; Deo, Narsingh ; Kumar, Nishit
Parallel Computing. 22 (1996) 3 - p. 369-382 , 1996

Link: https://doi.org/10.1016/..

14

Metric graphs elastically embeddable in the plane:

Nievergelt, J ; Deo, Narsingh
Information Processing Letters. 55 (1995) 6 - p. 309-315 , 1995

Link: https://doi.org/10.1016/..

15

An optimal parallel algorithm for merging using multiselect..:

Deo, Narsingh ; Jain, Amit ; Medidi, Muralidhar
Information Processing Letters. 50 (1994) 2 - p. 81-87 , 1994

Link: https://doi.org/10.1016/..