


default search action
Jiayi Lian
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[c8]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Weakly Approximating Knapsack in Subquadratic Time. ICALP 2025: 51:1-51:18
[i9]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
A Note on Deterministic FPTAS for Partition. CoRR abs/2501.12848 (2025)
[i8]Simin Zheng, Jared M. Clark, Fatemeh Salboukh, Priscila Silva, Karen da Mata, Fenglian Pan, Jie Min, Jiayi Lian, Caleb B. King, Lance Fiondella, Jian Liu, Xinwei Deng, Yili Hong:
Bridging the Data Gap in AI Reliability Research and Establishing DR-AIR, a Comprehensive Data Repository for AI Reliability. CoRR abs/2502.12386 (2025)
[i7]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Weakly Approximating Knapsack in Subquadratic Time. CoRR abs/2504.15001 (2025)- 2024
[c7]Jiayi Lian, Xueying Liu, Kevin Choi, Balaji Veeramani, Sathvik Murli, Alison Hu, Laura J. Freeman, Edward Bowen, Xinwei Deng:
Data Composition for Continual Learning in Application of Cyberattack Detection. ASONAM (4) 2024: 137-153
[c6]Ding Zou, Jiayi Lian, Wei Lu, Yichao Duan, Xingyu Lu, Jun Zhou, Yuchen Mao, Guochuan Zhang:
An Equally-Split Bin Packing Problem. COCOA (1) 2024: 240-252
[c5]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
An Improved Pseudopolynomial Time Algorithm for Subset Sum. FOCS 2024: 2202-2216
[c4]Lin Chen, Jiayi Lian
, Yuchen Mao, Guochuan Zhang:
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. SODA 2024: 4828-4848
[c3]Lin Chen
, Jiayi Lian
, Yuchen Mao
, Guochuan Zhang
:
A Nearly Quadratic-Time FPTAS for Knapsack. STOC 2024: 283-294
[c2]Lin Chen
, Jiayi Lian
, Yuchen Mao
, Guochuan Zhang
:
Approximating Partition in Near-Linear Time. STOC 2024: 307-318
[i6]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Approximating Partition in Near-Linear Time. CoRR abs/2402.11426 (2024)
[i5]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
An Improved Pseudopolynomial Time Algorithm for Subset Sum. CoRR abs/2402.14493 (2024)- 2023
[b1]Jiayi Lian:
Contributions to the Interface between Experimental Design and Machine Learning. Virginia Tech, Blacksburg, VA, USA, 2023
[i4]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. CoRR abs/2307.12582 (2023)
[i3]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
A Nearly Quadratic-Time FPTAS for Knapsack. CoRR abs/2308.07821 (2023)- 2021
[i2]Yili Hong, Jiayi Lian, Li Xu, Jie Min, Yueyao Wang, Laura J. Freeman, Xinwei Deng:
Statistical Perspectives on Reliability of Artificial Intelligence Systems. CoRR abs/2111.05391 (2021)- 2020
[c1]Zhengyu Wang, Meiyu Zhou, Zhengyu Shi, Jiayi Lian:
Research on Design of Shared Bicycle Service System Based on Kansei Engineering. HCI (40) 2020: 704-713
[i1]Jiayi Lian, Laura J. Freeman, Yili Hong, Xinwei Deng:
Investigating the Robustness of Artificial Intelligent Algorithms with Mixture Experiments. CoRR abs/2010.15551 (2020)
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 2025-11-22 04:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







