Mathur; Anmol

Patent Applications and Registrations

Patent applications and USPTO patent grants for Mathur; Anmol.The latest application filed is for "enhancing mergeability of datapaths and reducing datapath widths responsively to upper bound on information content".

Company Profile

1.14.4

Mathur; Anmol - San Jose CA

*profile and listings may contain filings by different individuals or companies with the same name. Review application materials to confirm ownership/assignment.

Patent Activity

Patent	Date
System, method, and computer program product for conditionally eliminating a memory read request Grant 10,534,723 - Tripathi , et al. Ja	2020-01-14
System, method, and computer program product for conditionally eliminating a memory read request Grant 9,720,859 - Tripathi , et al. August 1, 2	2017-08-01
System, method, and computer program product for determining equivalence of netlists utilizing at least one transformation Grant 8,122,401 - Chauhan , et al. February 21, 2	2012-02-21
System, method, and computer program product for determining equivalence of netlists utilizing abstractions and transformations Grant 8,117,571 - Chauhan , et al. February 14, 2	2012-02-14
Integrated circuit design system, method, and computer program product that takes into account the stability of various design signals Grant 7,966,593 - Ramachandran , et al. June 21, 2	2011-06-21
Integrated circuit design system, method, and computer program product that takes into account observability based clock gating conditions Grant 7,761,827 - Ramachandran , et al. July 20, 2	2010-07-20
System, method and computer program product for word-level operator-to-cell mapping Grant 7,673,257 - Bains , et al. March 2, 2	2010-03-02
System, method and computer program product for equivalence checking between designs with sequential differences Grant 7,350,168 - Mathur , et al. March 25, 2	2008-03-25
Method and system for inplace symbolic simulation over multiple cycles of a multi-clock domain design Grant 7,284,218 - Roy , et al. October 16, 2	2007-10-16
Circuit comparison by information loss matching Grant 7,222,317 - Mathur , et al. May 22, 2	2007-05-22
Reducing datapath widths by rebalancing data flow topology Grant 6,832,357 - Saluja , et al. December 14, 2	2004-12-14
Procedure for optimizing mergeability and datapath widths of data flow graphs Grant 6,807,651 - Saluja , et al. October 19, 2	2004-10-19
Reducing datapath widths responsively to upper bound on information content Grant 6,772,398 - Saluja , et al. August 3, 2	2004-08-03
Procedure for optimizingmergeability and datapath widths of data flow graphs App 20030061574 - Saluja, Sanjeev ; et al.	2003-03-27
Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision App 20030061577 - Saluja, Sanjeev ; et al.	2003-03-27
Enhancing mergeability of datapaths and reducing datapath widths by rebalancing data flow topology App 20030061575 - Saluja, Sanjeev ; et al.	2003-03-27
Enhancing mergeability of datapaths and reducing datapath widths responsively to upper bound on information content App 20030061576 - Saluja, Sanjeev ; et al.	2003-03-27

uspto.report is an independent third-party trademark research tool that is not affiliated, endorsed, or sponsored by the United States Patent and Trademark Office (USPTO) or any other governmental organization. The information provided by uspto.report is based on publicly available data at the time of writing and is intended for informational purposes only.

While we strive to provide accurate and up-to-date information, we do not guarantee the accuracy, completeness, reliability, or suitability of the information displayed on this site. The use of this site is at your own risk. Any reliance you place on such information is therefore strictly at your own risk.

All official trademark data, including owner information, should be verified by visiting the official USPTO website at www.uspto.gov. This site is not intended to replace professional legal advice and should not be used as a substitute for consulting with a legal professional who is knowledgeable about trademark law.