Individual holder
SZYMANSKI TED H
CA·9 granted patents·4 pending applications·25 citations·filing 2010–2025
Individually held — no corporate assignee on record.
Top patents by PatentIndex Score
13 records- 0191US8681609B2Method to schedule multiple traffic flows through packet-switched routers with near-minimal queue sizesSZYMANSKI TED H·Filed 2010·Granted Mar 25, 2014·17 cites·30 claims
- 0290US12155981B2Reduced-complexity integrated guaranteed-rate optical packet switchSZYMANSKI TED H·Filed 2023·Granted Nov 26, 2024·1 cites·28 claims
- 0383US11716557B2Reduced-complexity integrated guaranteed-rate optical packet switchSZYMANSKI TED H·Filed 2021·Granted Aug 1, 2023·1 cites·22 claims
- 0482US10687128B2Reduced-complexity integrated guaranteed-rate optical packet switchSZYMANSKI TED H·Filed 2016·Granted Jun 16, 2020·3 cites·30 claims
- 0582US2025048007A1Reduced-complexity integrated guaranteed-rate optical packet switchSZYMANSKI TED H·Filed 2024·Application pending·0 cites
- 0681US10129167B2Method to schedule multiple traffic flows through packet-switched routers with near-minimal queue sizesSZYMANSKI TED H·Filed 2016·Granted Nov 13, 2018·3 cites·34 claims
- 0776US12244576B2Methods to strengthen cyber-security and privacy in a deterministic internet of thingsSZYMANSKI TED H·Filed 2023·Granted Mar 4, 2025·0 cites·33 claims
- 0873US2025254150A1Methods to strengthen cyber-security and privacy in a deterministic internet of thingsSZYMANSKI TED H·Filed 2025·Application pending·0 cites
- 0967US11784984B2Methods to strengthen cyber-security and privacy in a deterministic internet of thingsSZYMANSKI TED H·Filed 2021·Granted Oct 10, 2023·0 cites·23 claims
- 1065US11076209B2Reduced-complexity integrated guaranteed-rate optical packet switchSZYMANSKI TED H·Filed 2020·Granted Jul 27, 2021·0 cites·38 claims
- 1155US11019038B2Methods to strengthen cyber-security and privacy in a deterministic internet of thingsSZYMANSKI TED H·Filed 2017·Granted May 25, 2021·0 cites·28 claims
- 1254US2014204739A1Method to schedule multiple traffic flows through packet-switched routers with near-minimal queue sizesSZYMANSKI TED H·Filed 2014·Application pending·0 cites
- 1350US2015365336A1Method to schedule multiple traffic flows through packet-switched routers with near-minimal queue sizesSZYMANSKI TED H·Filed 2015·Application pending·0 cites
Join the waitlist — get patent alerts
Get an alert when SZYMANSKI TED H files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Counts cover granted patents and pending applications in the PatentIndex corpus. How scoring works →