Enze Sun

Orcid: 0009-0005-5627-7900

Affiliations:
  • University of Hong Kong, Department of Computer Science, Hong Kong


According to our database1, Enze Sun authored at least 11 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Edge-weighted Matching in the Dark.
CoRR, July, 2025

Online Stochastic Matching with Unknown Arrival Order: Beating 0.5 against the Online Optimum.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Stochastic Online Correlated Selection.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

MPMD on Two Sources with Lookahead.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023
Randomized Algorithm for MPMD on Two Sources.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Generalized Sorting with Predictions Revisited.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
The Cardinal Complexity of Comparison-based Online Algorithms.
CoRR, 2022

Better Approximation for Interdependent SOS Valuations.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

2021
Generalized Sorting with Predictions.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021


  Loading...