default search action
William W. Patterson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c9]Jin-Xing Cai, Matthew V. Mazurczyk, William W. Patterson, Carl R. Davidson, Yue Hu, Oleg V. Sinkin, Maxim A. Bolshtyansky, Dmitri G. Foursa, Alexei N. Pilipetskii:
Transmission Performance of Hybrid-Shaped 56APSK Modulation Formats from 34.7 to 74.7 GBd over Transoceanic Distance. OFC 2020: 1-3 - [c8]Matthew V. Mazurczyk, Jin-Xing Cai, Milen Paskov, William W. Patterson, Oleg V. Sinkin, Yue Hu, Carl R. Davidson, Patrick C. Corbett, Timothy E. Hammon, Maxim A. Bolshtyansky, Dmitri G. Foursa, Alexei N. Pilipetskii:
Demonstration of 3, 010 km WDM Transmission in 3.83 THz Bandwidth using SOAs. OFC 2020: 1-3
2010 – 2019
- 2019
- [c7]A. V. Turukhin, Milen Paskov, Matthew V. Mazurczyk, William W. Patterson, H. G. Batshon, Oleg V. Sinkin, Maxim A. Bolshtyansky, Bruce Nyman, Dmitri G. Foursa, Alexei N. Pilipetskii:
Demonstration of Potential 130.8 Tb/s Capacity in Power-Efficient SDM Transmission over 12, 700 km using Hybrid Micro-Assembly Based Amplifier Platform. OFC 2019: 1-3 - 2018
- [c6]Jin-Xing Cai
, H. G. Batshon, Matthew V. Mazurczyk, Carl R. Davidson, Oleg V. Sinkin, D. Wang, Milen Paskov, William W. Patterson, Maxim A. Bolshtyansky, Dmitri G. Foursa:
94.9 Tb/s Single Mode Capacity Demonstration over 1, 900 km with C+L EDFAs and Coded Modulation. ECOC 2018: 1-3 - 2017
- [c5]Jin-Xing Cai
51.5 Tb/s Capacity over 17, 107 km in C+L Bandwidth Using Single Mode Fibers and Nonlinearity Compensation. ECOC 2017: 1-3 - [c4]Matthew V. Mazurczyk, Jin-Xing Cai
Performance of Nonlinear Compensation Techniques in a 71.64 Tb/s Capacity Demonstration Over 6970 km. ECOC 2017: 1-3 - [c3]Jin-Xing Cai, H. G. Batshon, Matthew V. Mazurczyk, Oleg V. Sinkin, D. Wang, Milen Paskov, William W. Patterson, Carl R. Davidson, Patrick C. Corbett, G. Wolter, Timothy E. Hammon, Maxim A. Bolshtyansky, Dmitri G. Foursa, Alexei N. Pilipetskii:
70.4 Tb/s capacity over 7, 600 km in C+L band using coded modulation with hybrid constellation shaping and nonlinearity compensation. OFC 2017: 1-3 - 2015
- [c2]Hongbin Zhang, Alexey V. Turukhin, Oleg V. Sinkin, William W. Patterson, H. G. Batshon, Yu Sun, Carl R. Davidson, Matthew V. Mazurczyk, Georg Mohs, Dmitri G. Foursa, Alexei N. Pilipetskii:
Power-efficient 100 Gb/s transmission over transoceanic distance using 8-dimensional coded modulation. ECOC 2015: 1-3
1970 – 1979
- 1974
- [j1]William W. Patterson, Gernot Metze:
A Fail-Safe Asynchronous Sequential Machine. IEEE Trans. Computers 23(4): 369-374 (1974) - [c1]William W. Patterson:
Some thoughts on associative processing languages. AFIPS National Computer Conference 1974: 23-26 - 1971
- [b1]William W. Patterson:
On the Design of Diagnosable Asynchronous Sequential Machines. University of Illinois Urbana-Champaign, USA, 1971
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: