Balsdon; Graham

Patent Applications and Registrations

Patent applications and USPTO patent grants for Balsdon; Graham.The latest application filed is for "automatically routing nets with variable spacing".

Company Profile

0.24.3

Balsdon; Graham - Glos GB

*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
Filling vacant areas of an integrated circuit design Grant 11,030,374 - Balsdon June 8, 2	2021-06-08
Filing vacant areas of an integrated circuit design Grant 10,691,858 - Balsdon	2020-06-23
Filling vacant areas of an integrated circuit design Grant 9,767,242 - Balsdon September 19, 2	2017-09-19
Clock tree generation and routing Grant 8,966,425 - Eisenstadt , et al. February 24, 2	2015-02-24
Automatically routing nets with variable spacing Grant 8,949,760 - Birch , et al. February 3, 2	2015-02-03
Automatically routing nets according to parasitic constraint rules Grant 8,751,996 - Birch , et al. June 10, 2	2014-06-10
Automation using spine routing Grant 8,479,141 - Waller , et al. July 2, 2	2013-07-02
Filling vacant areas of an integrated circuit design Grant 8,458,636 - Balsdon June 4, 2	2013-06-04
Automatically routing nets according to parasitic constraint rules Grant 8,332,805 - Birch , et al. December 11, 2	2012-12-11
Automatically Routing Nets with Variable Spacing App 20120110539 - Birch; Jeremy ; et al.	2012-05-03
Automatically routing nets according to current density rules Grant 8,171,447 - Balsdon , et al. May 1, 2	2012-05-01
Automatic integrated circuit routing using spines Grant 8,099,700 - Waller , et al. January 17, 2	2012-01-17
Automatically routing nets with variable spacing Grant 8,095,903 - Birch , et al. January 10, 2	2012-01-10
Automatically routing nets according to parasitic constraint rules Grant 8,010,928 - Birch , et al. August 30, 2	2011-08-30
Automatic integrated circuit routing using spines Grant 7,823,113 - Waller , et al. October 26, 2	2010-10-26
Design automation using spine routing Grant 7,802,208 - Waller , et al. September 21, 2	2010-09-21
Automatic routing system with variable width interconnect Grant 7,784,010 - Balsdon , et al. August 24, 2	2010-08-24
Automatically routing nets according to current density rules Grant 7,530,040 - Balsdon , et al. May 5, 2	2009-05-05
Method of automatically routing nets using a Steiner tree Grant 7,373,628 - Balsdon , et al. May 13, 2	2008-05-13
Method of automatically routing nets according to parasitic constraint rules Grant 7,363,607 - Birch , et al. April 22, 2	2008-04-22
Automatically Routing Nets with Variable Spacing App 20080028352 - Birch; Jeremy ; et al.	2008-01-31
Method of automatic shape-based routing of interconnects in spines for integrated circuit design Grant 7,257,797 - Waller , et al. August 14, 2	2007-08-14
Method of Automatically Routing Nets According to Parasitic Constraint Rules App 20070106969 - Birch; Jeremy ; et al.	2007-05-10
Method of automatically routing nets according to current density rules Grant 7,131,096 - Balsdon , et al. October 31, 2	2006-10-31

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.