default search action
Zilin Jiang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Huaiyu Zhai, Hanbo Jia, Xuan Guo, Zilin Jiang, Yuzhen Zhang, Dandan Wang, Jin Wu:
An interstage gain calibration technique for pipelined ADCs exploiting complementary dithering and calibration windows detector. IEICE Electron. Express 21(8): 20240121 (2024) - [j16]Feitong Wu
, Hanbo Jia, Xuan Guo
A 12bit 1.6 GS/s pipelined ADC with multi-level dither injection achieving 68 dB SFDR over PVT. Microelectron. J. 143: 106048 (2024) - [i4]Qingyang Ren, Zilin Jiang, Jinghan Cao, Sijia Li, Chiqu Li, Yiyang Liu, Shuning Huo, Tiange He:
A survey on fairness of large language models in e-commerce: progress, application, and challenge. CoRR abs/2405.13025 (2024) - 2023
- [j15]Zilin Jiang
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs. Comb. 43(2): 203-232 (2023) - 2022
- [j14]Zilin Jiang
An Isoperimetric Inequality for Hamming Balls and Local Expansion in Hypercubes. Electron. J. Comb. 29(1) (2022) - [j13]Samuel H. Florin
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing. IEEE Trans. Inf. Theory 68(5): 2839-2856 (2022) - 2021
- [j12]Ron Aharoni, Joseph Briggs
Rainbow Odd Cycles. SIAM J. Discret. Math. 35(4): 2293-2303 (2021) - [i3]Samuel H. Florin, Matthew H. Ho, Zilin Jiang:
On the binary adder channel with complete feedback, with an application to quantitative group testing. CoRR abs/2101.09898 (2021) - 2020
- [j11]Ron Aharoni, Eli Berger, Maria Chudnovsky
Cooperative Colorings of Trees and of Bipartite Graphs. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j10]Ron Aharoni, Ron Holzman, Zilin Jiang
Rainbow Fractional Matchings. Comb. 39(6): 1191-1202 (2019) - [j9]Zilin Jiang
On spectral radii of unraveled balls. J. Comb. Theory B 136: 72-80 (2019) - [j8]Zilin Jiang
On the metric dimension of Cartesian powers of a graph. J. Comb. Theory A 165: 1-14 (2019) - [j7]Zilin Jiang
On Capacities of the Two-User Union Channel With Complete Feedback. IEEE Trans. Inf. Theory 65(5): 2774-2781 (2019) - [c1]Zilin Jiang, Nikita Polyanskii:
How to guess an n-digit number. SODA 2019: 1215-1220 - 2018
- [j6]Ron Aharoni, Yair Censor
Finding a best approximation pair of points for two polyhedra. Comput. Optim. Appl. 71(2): 509-523 (2018) - [j5]Boris Bukh, Zilin Jiang
Bipartite algebraic graphs without quadrilaterals. Discret. Math. 341(6): 1597-1604 (2018) - [j4]Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz
Ramsey-nice families of graphs. Eur. J. Comb. 72: 29-44 (2018) - [i2]Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev:
On capacities of the two-user union channel with complete feedback. CoRR abs/1804.08599 (2018) - 2017
- [j3]Boris Bukh, Zilin Jiang
A Bound on the Number of Edges in Graphs Without an Even Cycle. Comb. Probab. Comput. 26(1): 1-15 (2017) - [j2]Boris Bukh, Zilin Jiang:
Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'. Comb. Probab. Comput. 26(6): 952-953 (2017) - [i1]Zilin Jiang, Nikita Polyanskii:
On the metric dimension of Cartesian powers of a graph. CoRR abs/1712.02723 (2017) - 2014
- [j1]Zilin Jiang
A Slight Improvement to the Colored Bárány's Theorem. Electron. J. Comb. 21(4): 4 (2014)
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:07 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: