Paul Liu

Orcid: 0000-0002-9386-6609

Affiliations:
  • Stanford University, CA, USA (PhD 2022)
  • University of British Columbia, Department of Computer Science, Canada


According to our database1, Paul Liu authored at least 28 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Dynamic Data Layout Optimization with Worst-Case Guarantees.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023
Faster Submodular Maximization for Several Classes of Matroids.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Submodular optimization in massive datasets.
PhD thesis, 2022

Coordinated Motion Planning Through Randomized <i>k</i>-Opt.
ACM J. Exp. Algorithmics, 2022

On the Complexity of Sampling Redistricting Plans.
CoRR, 2022

Streaming Submodular Maximization Under Matroid Constraints.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

MonoTrack: Shuttle trajectory reconstruction from monocular badminton video.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2022

2021
Coordinated Motion Planning Through Randomized k-Opt.
CoRR, 2021

An Elo-like System for Massive Multiplayer Competitions.
CoRR, 2021

Diversity on the Go! Streaming Determinantal Point Processes under a Maximum Induced Cardinality Objective.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Elo-MMR: A Rating System for Massive Multiplayer Competitions.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Improved Algorithms for Edge Colouring in the W-Streaming Model.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Cardinality constrained submodular maximization for random streams.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Coordinated Motion Planning Through Randomized k-Opt (CG Challenge).
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Improving Taxonomy-based Categorization with Categorical Graph Neural Networks.
Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

2020
A simple bipartite graph projection model for clustering in networks.
CoRR, 2020

Retrieving Top Weighted Triangles in Graphs.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

A polynomial lower bound on adaptive complexity of submodular maximization.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Sampling Methods for Counting Temporal Motifs.
Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, 2019

Submodular Optimization in the MapReduce Model.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018
A sampling framework for counting temporal motifs.
CoRR, 2018

Greedy and Local Ratio Algorithms in the MapReduce Model.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Approximation Schemes for Covering and Packing in the Streaming Model.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
SYM-ILDL: Incomplete LDL<sup>T</sup> Factorization of Symmetric Indefinite and Skew-Symmetric Matrices.
ACM Trans. Math. Softw., 2017

Approximation algorithms for the unit disk cover problem in 2D and 3D.
Comput. Geom., 2017

2015
SYM-ILDL: Incomplete $LDL^{T}$ Factorization of Symmetric Indefinite and Skew-Symmetric Matrices.
CoRR, 2015

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
A fast 25/6-approximation for the minimum unit disk cover problem.
CoRR, 2014


  Loading...