Dr Sachin Patkar
Professor
| Department of Electrical Engineering
Indian Institute of Technology, Bombay
Maharashtra
Expertise:
Electrical and Electronic Engineering
77
Publications
0
Projects
404
Scopus Citations
323
CrossRef
15 Years 8 Months Total Experience
Scopus
404
Citations
12
h-index
CrossRef
323
Citations
11
h-index
Google Scholar
Loading Scholar statistics...
Professional Recognition
No Data Found
There is currently nothing to display here.
Community & Membership
No Data Found
There is currently nothing to display here.
No Data Found
There is currently nothing to display here.
Personal Details
Doctor of Philosophy
1992
Indian Institute of Technology, Hyderabad
Professor
Jan 2011 – Present
Indian Institute of Technology, Bombay
| Department of Electrical Engineering
Engineering and Technology
Scholarly Work
No Data Found
There is currently nothing to display here.
No Data Found
There is currently nothing to display here.
CANTILEVER-BASED SENSING DEVICE AND A METHOD OF FABRICATION THEREOF
INDIAN INSTITUTE OF TECHNOLOGY BOMBAY
-
Patent No. :
IN201721009681A
Filed :
20-03-2017
Published :
12-07-2019
Published
Polymer anchored microelectromechanical system (MEMS) cantilever and method of fabricating the same
INDIAN INSTITUTE OF TECHNOLOGY BOMBAY | INDIAN INSTITUTE OF TECHNOLOGY BOMBAY
Powai
Mumbai
Maharashtra
IN
-
Patent No. :
US9731957B2
Filed :
21-01-2015
Published :
15-08-2017
Published
POLYMER ANCHORED MICROELECTROMECHANICAL SYSTEM (MEMS) CANTILEVER AND METHOD OF FABRICATING THE SAME
INDIAN INSTITUTE OF TECHNOLOGY BOMBAY
-
Patent No. :
IN201400204I3
Filed :
21-01-2014
Published :
22-07-2016
Published
METHOD AND SYSTEM FOR ERROR CONTROL CODING USING EXPANDER-LIKE CODES
TATA CONSULTANCY SERVICES LIMITED
IN | INDIAN INSTITUTE OF TECHNOLOGY BOMBAY
IN
-
Patent No. :
IN337252B
Filed :
03-09-2010
Published :
29-05-2020
Published
Scholarly Publications
A fast algorithm for the principal partition of a graph
Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity
The orthant non-interaction theorem for certain combinatorial polyhedra and its implications in the intersection and the dilworth truncation of bisubmodular functions
Abstract and generic rigidity in the plane
Open AccessFast sequential and randomised parallel algorithms for rigidity and approximate min k-cut
10.1007/3-540-56287-7_111
Crossref: 1
Approximation algorithms for min-k-overlap problems using the principal lattice of partitions approach
Realization of set functions as cut functions of graphs and hypergraphs
Open AccessDevelopment of a multi-FPGA netlist partitioner and a general purpose graph partitioning system
Showing 1 to 8 of 77 publications