loadpatents
Patent applications and USPTO patent grants for Weber; Kai O..The latest application filed is for "method and system for building binary decision diagrams optimally for nodes in a netlist graph using don't-caring".
Patent | Date |
---|---|
Method and system for building binary decision diagrams optimally for nodes in a netlist graph using don't-caring Grant 7,949,968 - Jacobi , et al. May 24, 2 | 2011-05-24 |
Method and apparatus for performing equivalence checking on circuit designs having differing clocking and latching schemes Grant 7,624,363 - Baumgartner , et al. November 24, 2 | 2009-11-24 |
Method and System for Building Binary Decision Diagrams Optimally for Nodes in a Netlist Graph Using Don't-Caring App 20080222590 - Jacobi; Christian ;   et al. | 2008-09-11 |
Method and Apparatus for Performing Equivalence Checking on Circuit Designs Having Differing Clocking and Latching Schemes App 20080209287 - Baumgartner; Jason R. ;   et al. | 2008-08-28 |
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.