Narsingh Deo
#160,388
Most Influential Person Now
Why Is Narsingh Deo Influential?
(Suggest an Edit or Addition)Narsingh Deo's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Graph Theory with Applications to Engineering and Computer Science (1975) (1150)
- Combinatorial Algorithms: Theory and Practice (1977) (853)
- Shortest-path algorithms: Taxonomy and annotation (1984) (352)
- On Algorithms for Enumerating All Circuits of a Graph (1976) (212)
- Parallel graph algorithms (1984) (168)
- A comparison of algorithms for terminal-pair reliability (1988) (146)
- Algorithms for Generating Fundamental Cycles in a Graph (1982) (122)
- Discrete Optimization Algorithms: with Pascal Programs (2006) (106)
- Exact and Approximate Solutions for the Gate Matrix Layout Problem (1987) (83)
- Node-Deletion NP-Complete Problems (1979) (76)
- System Simulation With Digital Computer (1983) (62)
- Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine (1996) (61)
- Random-tree Diameter and the Diameter-constrained MST (2002) (60)
- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel (2000) (55)
- Interference in Multiprocessor Systems with Localized Memory Access Probabilities (1979) (49)
- On the Complexity of Finding Optimal Global Alliances (2006) (44)
- Complexity of the minimum-dummy-activities problem in a pert network (1979) (39)
- Parallel heap: An optimal parallel priority queue (1992) (39)
- Parallel algorithms for terminal-pair reliability (1992) (38)
- Parallel Algorithms for Maximum Subsequence and Maximum Subarray (1995) (36)
- Discovering communities in complex networks (2006) (35)
- Prüfer-Like Codes for Labeled Trees (2001) (33)
- Computation of Constrained Spanning Trees: A Unified Approach (1997) (31)
- On Finding Euler Tours in Parallel (1993) (31)
- A Structural Approach to Graph Compression (1998) (30)
- A New Encoding for Labeled Trees Employing a Stack and a Queue (2002) (29)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (1986) (27)
- Parallel graph algorithms for hypercube computers (1990) (27)
- Preferential deletion in dynamic models of web-like networks (2007) (26)
- An Optimal Parallel Algorithm for Merging Using Multiselection (1994) (23)
- PASCAL GRAPHS AND THEIR PROPERTIES (1983) (22)
- Techniques for analyzing dynamic random graph models of web‐like networks: An overview (2008) (22)
- A new algorithm for digraph isomorphism (1977) (20)
- Generation of Complete Trees (1968) (19)
- Computing a diameter-constrained minimum spanning tree (2001) (19)
- Correlation Model of Worm Propagation on Scale-Free Networks (2006) (19)
- Note on Hopcroft and Tarjan's Planarity Algorithm (1976) (19)
- Parallel algorithms for merging and sorting (1991) (18)
- Efficient community identification in complex networks (2012) (18)
- A Central Tree (1966) (17)
- Incorporating latent semantic indexing into a neural network model for information retrieval (1996) (17)
- Degree-correlation of a Scale-free Random Graph Process (2005) (15)
- Generation of Graceful Trees (2002) (15)
- Techniques for analyzing dynamic random graph models of web-like networks: An overview (2008) (14)
- A highly scalable model for network attack identification and path prediction (2007) (13)
- Graph-Theoretic Web Algorithms: An Overview (2001) (13)
- Parallel Dictionaries Using AVL Trees (1998) (12)
- World Wide Web: A Graph-Theoretic Perspective (2001) (12)
- Minimum-length fundamental cycle set (1979) (12)
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' (1988) (12)
- Constrained spanning tree problems: Approximate methods and parallel computation (1997) (11)
- Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems (1992) (11)
- The knapsack problem with disjoint multiple-choice constraints (1992) (10)
- Linear-time Algorithms for Encoding Trees as Sequences of Node Labels (2006) (10)
- Computational experience with a parallel algorithm for tetrangle inequality bound smoothing (1999) (10)
- Toeplitz networks and their properties (1989) (9)
- Efficient parallel algorithms and data structures for discrete-event simulation (1990) (9)
- Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem (2002) (9)
- A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains (1999) (9)
- Two minimum spanning forest algorithms on fixed-size hypercube computers (1990) (9)
- A neural network model for information retrieval using latent semantic indexing (1996) (8)
- On Survivability of Communications Systems (1964) (8)
- Parallel algorithms for the single source shortest path problem (1982) (8)
- Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms (2009) (8)
- Parallel Heap (1990) (8)
- Estimating the Speedup in Parallel Parsing (1990) (7)
- Parallel graph algorithms for molecular conformation and tree codes (2002) (7)
- Discrete Optimization Algorithms: with Pascal Programs (Dover Books on Mathematics) (2006) (7)
- An efficient and scalable parallel algorithm for discrete-event simulation (1991) (6)
- Detecting communities using bibliographic metrics (2006) (6)
- A Game-Theoretic Approach for Detection of Overlapping Communities in Dynamic Complex Networks (2016) (6)
- Parallel Algorithms for Computing Prüfer-Like Codes for Labeled Trees (2001) (6)
- Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses (1987) (6)
- Processor allocation in parallel battlefield simulation (1992) (6)
- A Greedy Community-Mining Algorithm Based on Clustering Coefficient (2005) (5)
- Two EREW algorithms for parentheses matching (1991) (5)
- Graph compression and the zeros of polynomials (2004) (5)
- Parallel heap: improved and simplified (1992) (5)
- Data Structures for Parallel Computation on Shared-Memory Machines (1990) (5)
- A parallel algorithm for bound-smoothing (1999) (5)
- An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages (1987) (5)
- Generating Edge-disjoint Sets of Quadruples in Parallel for the Molecular Conformation Problem (2000) (5)
- Generalized Parallel Redundancy in Digital Computers (1968) (4)
- Metric Graphs Elastically Embeddable in the Plane (1995) (4)
- Memory-Efficient Enumeration of Constrained Spanning Trees (1999) (4)
- Parallel dictionaries on AVL trees (1994) (4)
- On the power of a perturbation for testing non-isomorphism of graphs (1984) (4)
- Partial versus total redundancy (1967) (4)
- Accelerating the distributed simulations of agent-based models using community detection (2016) (4)
- Parallel Construction of (a, b) -Trees (1994) (3)
- Constructing Height-Balanced Trees in Parallel (1992) (3)
- Parallel algorithms for the molecular conformation problem (1999) (3)
- Generalizations of Line Graphs and Applications (1977) (3)
- Self-dual graphs and digraphs. (1968) (3)
- On the expected number of level-i nodes in a random labeled tree (2002) (3)
- Compression of vertex transitive graphs (2004) (3)
- The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction (2008) (3)
- Degree-correlation of Scale-free graphs (2006) (3)
- Methods for Placing Data and Parity to Tolerate Two Disk Failures in Disk Arrays Using Complete Bipartite Graphs (2006) (3)
- Existence of Four Concurrent Normals to a Smooth Closed Curve (1970) (3)
- An Eigenvector Characterization of Cospectral Graphs Having Cospectral Joins a (1989) (3)
- Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis (1989) (2)
- Parallel coloring of graphs: two approximate algorithms (1989) (2)
- An extensive English language bibliography on graph theory and its applications (1969) (2)
- 1 On One-factorization of Complete 3-Uniform Hypergraphs (2003) (2)
- Rencontres Graphs: a Family of Bipartite Graphs* (1987) (2)
- Early Adoption : High-Performance Computing for Big Data Introducing parallel programming and big data in the core algorithms curriculum (2014) (2)
- The ellipsoid algorithm and the graph isomorphism problem (1984) (2)
- Algorithms for discovering communities in complex networks (2006) (2)
- A graph theoretic algorithm for placing data and parity to tolerate two disk failures in disk array systems (2005) (2)
- Discriminative Stochastic Models for Complex Networks Derived from Flow Cytometry Big Data (2013) (1)
- Parallel Hungarian algorithm (1990) (1)
- Parallel Min-max-pair Heap (1994) (1)
- Distributed Detection and Optimal Tra-c-blocking of Network Worms (2007) (1)
- Evaluation of a Graph-based Topical Crawler (2006) (1)
- A digital computer for antenna pointing. (1969) (1)
- Exploring Topological Properties of NMR Graphs (2007) (1)
- Parallel Processing in the Undergraduate Curriculum (1992) (1)
- Tree graphs and tree numbers (1975) (1)
- Parallel algorithms and architectures report of a workshop (1988) (1)
- Two protocols for multicast communication (2001) (1)
- Correlation Model for Worm Propagation on Scale-free Graphs (2005) (1)
- Introducing parallel programming across the undergraduate curriculum through an interdisciplinary course on computational modeling (2013) (1)
- Parallel Algorithms and Implementations (1993) (1)
- Cluster Computing for Determining Three-Dimensional Protein Structure (2005) (1)
- Minimum Cost Increase of the Terminal Capacities of a Communication Network (1966) (1)
- Forbidden pairs combinatorics (2000) (0)
- Synthesis of Multiterminal Communication Netsi Finding One or All Solutions (1976) (0)
- Efficient community identification in complex networks (2012) (0)
- SANJAY: Automatically synthesizing visualizations of flow cytometry data using decision procedures (2015) (0)
- Graphs (2004) (0)
- Implementing 2-D and 3-D DiscreteHartley Transforms on a MassivelyParallel SIMD Mesh Computer (2007) (0)
- Cycle elimination in weighted diagraphs by orientation reversal of edges (1970) (0)
- The Self-Diagnosability of a Computer (1966) (0)
- Flight computers and sequencers (1967) (0)
- Parallelizing IDARC on a Massively-Parallel SIMD Computer (1997) (0)
- Analyzing the community structure of web-like networks: models and algorithms (2005) (0)
- Fine-Grain Parallel Implementations of 2-D and 3-D Discrete Hartley Transforms (1995) (0)
- Author's Reply3 (1969) (0)
- Bibliometric approach to community discovery (2005) (0)
- LOCAL SEARCH FOR IDENTIFYING COMMUNITIES IN LARGE RANDOM GRAPHS (2013) (0)
- A theorem proving approach for automatically synthesizing visualizations of flow cytometry data (2017) (0)
- Reverse binary graphs (1993) (0)
- Optimization of hardware redundancy in space computers. (1968) (0)
- PARALLEL ALGORITHM FOR RADIOCOLORING A (0)
- Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey (2018) (0)
- Mining parameters that characterize the communities in web-like networks (2006) (0)
- A theorem proving approach for automatically synthesizing visualizations of flow cytometry data (2017) (0)
- Big-Data-Driven Control Strategies for Complex Networks (2013) (0)
- Community Identification in Dynamic and Complex Networks (2014) (0)
- PARALLEL PROCESSING FOR SOME LARGE-SCALE NETWORK OPTIMIZATION PROBLEMS (1983) (0)
- A birth-death dynamic model of scale-free networks (2005) (0)
- Algorithms for Generating Cycles in a Graph (1982) (0)
- IMPLEMENTATION AND ANALYSIS OF A PARALLEL ALGORITHM FOR RADIOCOLORING (2004) (0)
- An additive pseudorandom number generator with semi-infinite sequence length (1969) (0)
- Parallel Processing of Networks. (1986) (0)
- Multiprocessor Programming in the Undergraduate Program NSF/TCPP Curriculum: 2nd Year of Early Adoption at the University of Central Florida. (2012) (0)
- Parallel Computers in Signal Processing (1985) (0)
- Editors & Editorial Board (2012) (0)
- Algorithms for the degree-constrained minimum spanning tree and the hierarchical clustering problems using the nearest-neighbor techniques (1999) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Narsingh Deo?
Narsingh Deo is affiliated with the following schools:
