Narsingh Deo

From MaRDI portal
Person:294699

Available identifiers

zbMath Open deo.narsinghWikidataQ6966382 ScholiaQ6966382MaRDI QIDQ294699

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q46438292018-05-29Paper
Memory-efficient enumeration of constrained spanning trees2016-06-16Paper
Computational experience with a parallel algorithm for tetrangle inequality bound smoothing2015-10-27Paper
https://portal.mardi4nfdi.de/entity/Q52519642015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q31101022012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q30156172011-07-13Paper
https://portal.mardi4nfdi.de/entity/Q29999882011-05-18Paper
https://portal.mardi4nfdi.de/entity/Q35819452010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35766972010-07-30Paper
Parallel heap: an optimal parallel priority queue2010-05-31Paper
Preferential deletion in dynamic models of web-like networks2010-01-29Paper
Graph compression and the zeros of polynomials2009-08-27Paper
https://portal.mardi4nfdi.de/entity/Q36166792009-03-26Paper
https://portal.mardi4nfdi.de/entity/Q36159822009-03-24Paper
https://portal.mardi4nfdi.de/entity/Q36159942009-03-24Paper
Techniques for analyzing dynamic random graph models of web-like networks: An overview2008-07-29Paper
https://portal.mardi4nfdi.de/entity/Q35072622008-06-18Paper
https://portal.mardi4nfdi.de/entity/Q54431812008-02-20Paper
https://portal.mardi4nfdi.de/entity/Q54432122008-02-20Paper
https://portal.mardi4nfdi.de/entity/Q34462712007-06-14Paper
https://portal.mardi4nfdi.de/entity/Q34294732007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34295502007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34295952007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34239902007-02-15Paper
https://portal.mardi4nfdi.de/entity/Q33782312006-03-30Paper
https://portal.mardi4nfdi.de/entity/Q33783362006-03-30Paper
Searching for spreads and packings2005-11-07Paper
https://portal.mardi4nfdi.de/entity/Q46779362005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779762005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779822005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q48261402004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48103672004-09-06Paper
https://portal.mardi4nfdi.de/entity/Q44726972004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44703692004-06-22Paper
https://portal.mardi4nfdi.de/entity/Q44647852004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44647942004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44308462003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44308642003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44308692003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44308822003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44145602003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q45295012002-11-06Paper
Random-tree Diameter and the Diameter-constrained MST2002-10-27Paper
https://portal.mardi4nfdi.de/entity/Q45292592002-10-15Paper
https://portal.mardi4nfdi.de/entity/Q43290492002-09-29Paper
https://portal.mardi4nfdi.de/entity/Q43290612002-09-29Paper
https://portal.mardi4nfdi.de/entity/Q27719272002-02-18Paper
https://portal.mardi4nfdi.de/entity/Q27183452001-12-12Paper
https://portal.mardi4nfdi.de/entity/Q27288892001-11-06Paper
https://portal.mardi4nfdi.de/entity/Q49498342001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q27179072001-07-26Paper
https://portal.mardi4nfdi.de/entity/Q45266282001-05-10Paper
https://portal.mardi4nfdi.de/entity/Q44891942001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q44892372000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q42370861999-03-29Paper
https://portal.mardi4nfdi.de/entity/Q43953291998-12-16Paper
Parallel dictionaries using AVL trees1998-11-05Paper
https://portal.mardi4nfdi.de/entity/Q43897671998-10-19Paper
https://portal.mardi4nfdi.de/entity/Q43933701998-10-01Paper
https://portal.mardi4nfdi.de/entity/Q43932891998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43933231998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43933331998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43860841998-04-26Paper
https://portal.mardi4nfdi.de/entity/Q43631661998-01-05Paper
Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine1997-02-27Paper
Metric graphs elastically embeddable in the plane1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48934691996-11-20Paper
https://portal.mardi4nfdi.de/entity/Q48628891996-02-04Paper
https://portal.mardi4nfdi.de/entity/Q43085311995-01-26Paper
https://portal.mardi4nfdi.de/entity/Q43043671994-10-10Paper
https://portal.mardi4nfdi.de/entity/Q31397261994-06-12Paper
An optimal parallel algorithm for merging using multiselection1994-06-09Paper
Reverse binary graphs1994-03-17Paper
https://portal.mardi4nfdi.de/entity/Q40299851993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40282531993-03-28Paper
Stirling networks: A versatile combinatorial topology for multiprocessor systems1993-01-16Paper
Parallel algorithms for terminal-pair reliability1993-01-16Paper
The knapsack problem with disjoint multiple-choice constraints1992-08-13Paper
https://portal.mardi4nfdi.de/entity/Q39721331992-06-25Paper
Parallel algorithms for merging and sorting1991-01-01Paper
Parallel graph algorithms for hypercube computers1990-01-01Paper
Two minimum spanning forest algorithms on fixed-size hypercube computers1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353141990-01-01Paper
Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552341989-01-01Paper
Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340641988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353381987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37705721987-01-01Paper
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37605801986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37733601985-01-01Paper
On the power of a perturbation for testing non-isomorphism of graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33305261984-01-01Paper
Shortest-path algorithms: Taxonomy and annotation1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36835471984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33106471983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33149871983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36932571983-01-01Paper
Parallel algorithms for the single source shortest path problem1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39306531982-01-01Paper
Algorithms for Generating Fundamental Cycles in a Graph1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33408611980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39362081980-01-01Paper
Complexity of the minimum-dummy-activities problem in a pert network1979-01-01Paper
Node-Deletion NP-Complete Problems1979-01-01Paper
Interference in Multiprocessor Systems with Localized Memory Access Probabilities1979-01-01Paper
Generalizations of line graphs and applications1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41441921977-01-01Paper
Note on Hopcroft and Tarjan's Planarity Algorithm1976-01-01Paper
On Algorithms for Enumerating All Circuits of a Graph1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47709751974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40506431973-01-01Paper
Existence of Four Concurrent Normals to a Smooth Closed Curve1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56369091969-01-01Paper
Generalized Parallel Redundancy in Digital Computers1968-01-01Paper
Impact Printing1966-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Narsingh Deo