default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTing-Chun Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Pey-Yu Chen
, Ta-Wei Yang, Yi-Shan Tseng, Cheng-Yu Tsai, Chiung-Szu Yeh, Yen-Hui Lee, Pei-Hsuan Lin, Ting-Chun Lin, Yu-Jen Wu, Ting-Hua Yang, Yu-Ting Chiang, Jacob Shujui Hsu, Chuan-Jen Hsu, Pei-Lung Chen, Cheng-Fu Chou, Chen-Chi Wu:
Machine learning-based longitudinal prediction for GJB2-related sensorineural hearing loss. Comput. Biol. Medicine 176: 108597 (2024)- [i7]Irit Dinur, Ting-Chun Lin, Thomas Vidick:
Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes. CoRR abs/2402.07476 (2024) - 2023
- [j2]Hsin-Po Wang, Ting-Chun Lin, Alexander Vardy, Ryan Gabrys:
Sub-4.7 Scaling Exponent of Polar Codes. IEEE Trans. Inf. Theory 69(7): 4235-4254 (2023) - [c6]Wei-Jyun Chen, Ching-Te Chiu, Ting-Chun Lin:
Landmark-Based Adversarial Network for RGB-D Pose Invariant Face Recognition. AICAS 2023: 1-5 - [c5]Ting-Chun Lin, Hsin-Po Wang:
Optimal Self-Dual Inequalities to Order Polarized BECs. ISIT 2023: 1550-1555 - [c4]Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick:
Good Quantum LDPC Codes with Linear Time Decoders. STOC 2023: 905-918 - [i6]Ting-Chun Lin, Hsin-Po Wang:
Optimal Self-Dual Inequalities to Order Polarized BECs. CoRR abs/2304.07664 (2023) - 2022
- [c3]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. APPROX/RANDOM 2022: 17:1-17:15 - [c2]Max Hopkins, Ting-Chun Lin:
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares. FOCS 2022: 662-673 - [c1]Ting-Chun Lin, Min-Hsiu Hsieh:
c3-Locally Testable Codes from Lossless Expanders. ISIT 2022: 1175-1180 - [i5]Ting-Chun Lin, Min-Hsiu Hsieh:
c3-Locally Testable Codes from Lossless Expanders. CoRR abs/2201.11369 (2022) - [i4]Max Hopkins, Ting-Chun Lin:
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares. CoRR abs/2204.11469 (2022) - [i3]Hsin-Po Wang, Ting-Chun Lin, Alexander Vardy, Ryan Gabrys:
Sub-4.7 Scaling Exponent of Polar Codes. CoRR abs/2204.11683 (2022) - [i2]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. CoRR abs/2207.04522 (2022) - [i1]Max Hopkins, Ting-Chun Lin:
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares. Electron. Colloquium Comput. Complex. TR22 (2022)
2010 – 2019
- 2013
- [j1]Chi-Chang Chen, Ting-Chun Lin:
A Low-Cost Anchor Placement Strategy for Range-Free Localization Problems in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 9 (2013)
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-10-07 22:22 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:
