Obserwuj
Austen Z. Fan
Austen Z. Fan
Department of Computer Sciences, University of Wisconsin-Madison
Zweryfikowany adres z cs.wisc.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Certifiable robustness for nearest neighbor classifiers
AZ Fan, P Koutris
arXiv preprint arXiv:2201.04770, 2022
72022
The fine-grained complexity of boolean conjunctive queries and sum-product problems
AZ Fan, P Koutris, H Zhao
arXiv preprint arXiv:2304.14557, 2023
62023
Properties of position matrices and their elections
N Boehmer, JY Cai, P Faliszewski, AZ Fan, Ł Janeczko, A Kaczmarczyk, ...
Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5507-5514, 2023
32023
Bipartite 3-regular counting problems with mixed signs
JY Cai, AZ Fan, Y Liu
Journal of Computer and System Sciences 135, 15-31, 2023
22023
A Prioritized Trajectory Planning Algorithm for Connected and Automated Vehicle Mandatory Lane Changes
N Li, AZ Fan, R Fischer, W Kontar, B Ran
2021 IEEE International Intelligent Transportation Systems Conference (ITSC …, 2021
22021
Dichotomy result on 3-regular bipartite non-negative functions
AZ Fan, JY Cai
Computer Science–Theory and Applications: 16th International Computer …, 2021
22021
Conjunctive queries with negation and aggregation: A linear time characterization
H Zhao, AZ Fan, X Ouyang, P Koutris
Proceedings of the ACM on Management of Data 2 (2), 1-19, 2024
12024
Tight Bounds of Circuits for Sum-Product Queries
AZ Fan, P Koutris, H Zhao
Proceedings of the ACM on Management of Data 2 (2), 1-20, 2024
2024
Restricted Holant Dichotomy on Domains 3 and 4
Y Liu, AZ Fan, JY Cai
International Conference on Combinatorial Optimization and Applications, 83-96, 2023
2023
Planar 3-way Edge Perfect Matching Leads to A Holant Dichotomy
JY Cai, AZ Fan
arXiv preprint arXiv:2303.16705, 2023
2023
A Survey on Sample Complexity of Mechanism Design
AZ Fan, S Liu, Z Liu
2020
THE FINE-GRAINED COMPLEXITY OF BOOLEAN CONJUNCTIVE QUERIES AND SUM-PROD PROBLEMS
AZ Fan, P Koutris, H Zhao
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–12