Dinesh Mehta

From MaRDI portal
Person:691441

Available identifiers

zbMath Open mehta.dinesh-pMaRDI QIDQ691441

List of research outcomes





PublicationDate of PublicationType
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)2023-11-23Paper
https://portal.mardi4nfdi.de/entity/Q46438272018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46438282018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46438792018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46438892018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46438932018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46359922018-04-23Paper
The quarter-state-sequence floorplan representation2017-08-25Paper
Random Models and Analyses for Chemical Graphs2015-07-06Paper
Faster reaction mapping through improved naming techniques2015-03-16Paper
Automated reaction mapping2014-04-01Paper
Identifying algorithmic vulnerabilities through simulated annealing2012-11-30Paper
FAST PURSUIT OF MOBILE NODES USING TPR TREES2005-04-18Paper
Decision tree approximations of Boolean functions2002-03-03Paper

Research outcomes over time

This page was built for person: Dinesh Mehta

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:691441&oldid=10546081"
Powered by MediaWiki