Narsingh Deo - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 71 from 71

2017

A theorem proving approach for automatically synthesizing visualizations of flow cytometry dataSunny Raj, Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Damla Turgut, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Jeff Chang, Sumit Kumar Jha 0001. bmcbi, 18(8), 2017. [doi]

2016

Accelerating the distributed simulations of agent-based models using community detectionAntoniya Petkova, Charles Hughes, Narsingh Deo, Martin Dimitrov. rivf 2016: 25-30 [doi]

2015

SANJAY: Automatically synthesizing visualizations of flow cytometry data using decision proceduresFaraz Hussain, Zubir Husein, Neslisah Torosdagli, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Chang, Sumit Kumar Jha. iccabs 2015: 1 [doi]

2012

Efficient community identification in complex networksMahadevan Vasudevan, Narsingh Deo. snam, 2(4):345-359, 2012. [doi]

2008

Techniques for analyzing dynamic random graph models of web-like networks: An overviewAurel Cami, Narsingh Deo. networks, 51(4):211-255, 2008. [doi]

The Derivation and Use of a Scalable Model for Network Attack Identification and Path PredictionSanjeeb Nanda, Narsingh Deo. jnw, 3(4):64-71, 2008. [doi]

2007

Preferential deletion in dynamic models of web-like networksNarsingh Deo, Aurel Cami. ipl, 102(4):156-162, 2007. [doi]

Exploring Topological Properties of NMR GraphsPaulius Micikevicius, Narsingh Deo. bibe 2007: 1304-1307 [doi]

2006

Discovering communities in complex networksHemant Balakrishnan, Narsingh Deo. ACMse 2006: 280-285 [doi]

Detecting communities using bibliographic metricsHemant Balakrishnan, Narsingh Deo. grc 2006: 293-298 [doi]

Evaluation of a Graph-based Topical CrawlerAurel Cami, Narsingh Deo. ic 2006: 393-399

Mining parameters that characterize the communities in web-like networksNarsingh Deo, Aurel Cami. grc 2006: 188-193 [doi]

2005

2004

Graph compression and the zeros of polynomialsBruce E. Litow, Narsingh Deo. ipl, 92(1):39-44, 2004. [doi]

2002

Random-tree Diameter and the Diameter-constrained MSTAyman Abdalla, Narsingh Deo. ijcm, 79(6):651-663, 2002. [doi]

Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation ProblemNarsingh Deo, Paulius Micikevicius. iwdc 2002: 55-66 [doi]

2001

Graph-Theoretic Web Algorithms: An OverviewNarsingh Deo, Pankaj Gupta. iics 2001: 91-102 [doi]

2000

Computing a Diameter-Constrained Minimum Spanning Tree in ParallelNarsingh Deo, Ayman Abdalla. ciac 2000: 17-31 [doi]

Forbidden pairs combinatoricsBruce E. Litow, Narsingh Deo. ajc, 22:91-100, 2000. [doi]

1999

A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor ChainsLi-Jen Mao, Narsingh Deo, Sheau-Dong Lang. ispan 1999: 184-189 [doi]

Memory-Efficient Enumeration of Constrained Spanning TreesJürg Nievergelt, Narsingh Deo, Ambros Marzetta. ipl, 72(1-2):47-53, 1999. [doi]

A Parallel Algorithm for Bound-SmoothingKumar Rajan, Narsingh Deo. ipps 1999: 645-652 [doi]

1998

Parallel Dictionaries Using AVL TreesMuralidhar Medidi, Narsingh Deo. jpdc, 49(1):146-155, 1998.

1997

Constrained spanning tree problems: Approximate methods and parallel computationNarsingh Deo, Nishit Kumar. dimacs 1998: 191-218

1996

Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel MachineBruce Boldon, Narsingh Deo, Nishit Kumar. pc, 22(3):369-382, 1996.

Incorporating Latent Semantic Indexing into a Neural Network Model for Information RetrievalInien Syu, Sheau-Dong Lang, Narsingh Deo. CIKM 1996: 145-153 [doi]

A neural network model for information retrieval using latent semantic indexingInien Syu, Sheau-Dong Lang, Narsingh Deo. icnn 1996: 1318-1323 [doi]

1995

Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley TransformsNishit Kumar, Narsingh Deo. pdpcs 1995: 248-252

Metric Graphs Elastically Embeddable in the PlaneJürg Nievergelt, Narsingh Deo. ipl, 55(6):309-315, 1995. [doi]

Parallel Algorithms for Maximum Subsequence and Maximum SubarrayKalyan S. Perumalla, Narsingh Deo. ppl, 5:367-373, 1995.

1994

An Optimal Parallel Algorithm for Merging Using MultiselectionNarsingh Deo, Amit Jain, Muralidhar Medidi. ipl, 50(2):81-87, 1994.

Parallel Construction of (a, b) -TreesNarsingh Deo, Amit Jain, Muralidhar Medidi. jpdc, 23(3):442-448, 1994.

Parallel Dictionaries on AVL TreesMuralidhar Medidi, Narsingh Deo. ipps 1994: 878-882

1993

On Finding Euler Tours in ParallelEdson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter. ppl, 3:223-231, 1993.

1992

1991

Parallel algorithms for merging and sortingNarsingh Deo, Dilip Sarkar. isci, 56(1-3):151-161, 1991. [doi]

An efficient and scalable parallel algorithm for discrete-event simulationSushil K. Prasad, Narsingh Deo. wsc 1991: 652-658 [doi]

Two EREW Algorithms for Parentheses MatchingSushil K. Prasad, Narsingh Deo. ipps 1991: 126-131

1990

Parallel Hungarian algorithmSajal K. Das, Narsingh Deo. csse, 5(3):131-136, 1990.

Two minimum spanning forest algorithms on fixed-size hypercube computersSajal K. Das, Narsingh Deo, Sushil K. Prasad. pc, 15(1-3):179-187, 1990.

Parallel graph algorithms for hypercube computersSajal K. Das, Narsingh Deo, Sushil K. Prasad. pc, 13(2):143-158, 1990.

Parallel HeapNarsingh Deo, Sushil K. Prasad. icpp 1990: 169-172

Estimating the Speedup in Parallel ParsingDilip Sarkar, Narsingh Deo. TSE, 16(7):677-683, 1990. [doi]

1989

Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic AnalysisSajal K. Das, Narsingh Deo, Sushil K. Prasad. fsttcs 1989: 280-290

1988

1987

Exact and Approximate Solutions for the Gate Matrix Layout ProblemNarsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston. tcad, 6(1):79-84, 1987. [doi]

Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of ParenthesesDilip Sarkar, Narsingh Deo. ics 1988: 970-984

An Optimal Parallel Parsing Algorithm for a Class of Block Structured LanguagesDilip Sarkar, Narsingh Deo. icpp 1987: 585-588

1986

An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound AlgorithmsMichael J. Quinn, Narsingh Deo. bit, 26(1):35-43, 1986.

Estimating the Speedup in Parallel ParsingDilip Sarkar, Narsingh Deo. icpp 1986: 157-163

1984

Shortest-path algorithms: Taxonomy and annotationNarsingh Deo, Chi-Yin Pang. networks, 14(2):275-323, 1984. [doi]

On the Power of a Perturbation for Testing Non-Isomorphism of GraphsG. M. Prabhu, Narsingh Deo. bit, 24(3):302-307, 1984.

Parallel Graph AlgorithmsMichael J. Quinn, Narsingh Deo. ACM Comput. Surv., 16(3):319-348, 1984.

1982

Algorithms for Generating Fundamental Cycles in a GraphNarsingh Deo, G. M. Prabhu, Mukkai S. Krishnamoorthy. TOMS, 8(1):26-42, 1982. [doi]

Parallel algorithms for the single source shortest path problemPrabhaker Mateti, Narsingh Deo. computing, 29(1):31-49, 1982. [doi]

1979

Node-Deletion NP-Complete ProblemsMukkai S. Krishnamoorthy, Narsingh Deo. SICOMP, 8(4):619-625, 1979.

Complexity of the minimum-dummy-activities problem in a pert networkMukkai S. Krishnamoorthy, Narsingh Deo. networks, 9(3):189-194, 1979. [doi]

Interference in Multiprocessor Systems with Localized Memory Access ProbabilitiesA. S. Sethi, Narsingh Deo. TC, 28(2):157-163, 1979.

1977

Generalizations of Line Graphs and ApplicationsNarsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai. ipl, 6(1):14-17, 1977.

1976

Note on Hopcroft and Tarjan s Planarity AlgorithmNarsingh Deo. JACM, 23(1):74-75, 1976. [doi]

On Algorithms for Enumerating All Circuits of a GraphPrabhaker Mateti, Narsingh Deo. SICOMP, 5(1):90-99, 1976.

1969

3Narsingh Deo. TC, 18(1):80, 1969. [doi]

1968

Generalized Parallel Redundancy in Digital ComputersNarsingh Deo. TC, 17(6):600, 1968. [doi]

1966

The Self-Diagnosability of a ComputerNarsingh Deo. TC, 15(5):799, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL