Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Liu 0001
Person information
- affiliation (PhD 2022): Stanford University, CA, USA
- affiliation: University of British Columbia, Department of Computer Science, Canada
Other persons with the same name
- Paul Liu — disambiguation page
- Paul Liu 0002 — University of Illinois Urbana-Champaign, USA
- Paul Liu 0003
![[0000-0001-8092-6353]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8092-6353")
— Stork Healthcare, Chengdu, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. ICALP 2023: 74:1-74:18- [i16]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. CoRR abs/2305.00122 (2023) - 2022
- [b1]Paul Liu:
Submodular optimization in massive datasets. Stanford University, USA, 2022 - [j3]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. ACM J. Exp. Algorithmics 27: 3.4:1-3.4:9 (2022) - [c15]Paul Liu, Jui-Hsien Wang:
MonoTrack: Shuttle trajectory reconstruction from monocular badminton video. CVPR Workshops 2022: 3512-3521 - [c14]Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization Under Matroid Constraints. ICALP 2022: 59:1-59:20 - [i15]Paul Liu, Jui-Hsien Wang:
MonoTrack: Shuttle trajectory reconstruction from monocular badminton video. CoRR abs/2204.01899 (2022) - [i14]Moses Charikar, Paul Liu, Tianyu Liu, Thuy-Duong Vuong:
On the Complexity of Sampling Redistricting Plans. CoRR abs/2206.04883 (2022) - 2021
- [c13]Tianchuan Du, Keng-hao Chang, Paul Liu, Ruofei Zhang:
Improving Taxonomy-based Categorization with Categorical Graph Neural Networks. IEEE BigData 2021: 1015-1022 - [c12]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). SoCG 2021: 64:1-64:8 - [c11]Paul Liu, Aviad Rubinstein, Jan Vondrák, Junyao Zhao:
Cardinality constrained submodular maximization for random streams. NeurIPS 2021: 6491-6502 - [c10]Moses Charikar, Paul Liu:
Improved Algorithms for Edge Colouring in the W-Streaming Model. SOSA 2021: 181-183 - [c9]Paul Liu, Akshay Soni, Eun Yong Kang, Yajun Wang, Mehul Parsana:
Diversity on the Go! Streaming Determinantal Point Processes under a Maximum Induced Cardinality Objective. WWW 2021: 1363-1372 - [c8]Aram Ebtekar, Paul Liu:
Elo-MMR: A Rating System for Massive Multiplayer Competitions. WWW 2021: 1772-1784 - [i13]Aram Ebtekar, Paul Liu:
An Elo-like System for Massive Multiplayer Competitions. CoRR abs/2101.00400 (2021) - [i12]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. CoRR abs/2103.15062 (2021) - [i11]Paul Liu, Aviad Rubinstein, Jan Vondrák, Junyao Zhao:
Cardinality constrained submodular maximization for random streams. CoRR abs/2111.07217 (2021) - 2020
- [c7]Wenzheng Li, Paul Liu, Jan Vondrák:
A polynomial lower bound on adaptive complexity of submodular maximization. STOC 2020: 140-152 - [c6]Raunak Kumar, Paul Liu, Moses Charikar, Austin R. Benson:
Retrieving Top Weighted Triangles in Graphs. WSDM 2020: 295-303 - [i10]Wenzheng Li, Paul Liu, Jan Vondrák:
A polynomial lower bound on adaptive complexity of submodular maximization. CoRR abs/2002.09130 (2020) - [i9]Austin R. Benson, Paul Liu, Hao Yin:
A simple bipartite graph projection model for clustering in networks. CoRR abs/2007.00761 (2020) - [i8]Moses Charikar, Paul Liu:
Improved Algorithms for Edge Colouring in the W-Streaming Model. CoRR abs/2010.14560 (2020)
2010 – 2019
- 2019
- [c5]Paul Liu, Jan Vondrák:
Submodular Optimization in the MapReduce Model. SOSA 2019: 18:1-18:10 - [c4]Paul Liu, Austin R. Benson, Moses Charikar:
Sampling Methods for Counting Temporal Motifs. WSDM 2019: 294-302 - [i7]Raunak Kumar, Paul Liu, Moses Charikar, Austin R. Benson:
Retrieving Top Weighted Triangles in Graphs. CoRR abs/1910.00692 (2019) - 2018
- [c3]Christopher Liaw, Paul Liu, Robert Reiss:
Approximation Schemes for Covering and Packing in the Streaming Model. CCCG 2018: 172-179 - [c2]Nicholas J. A. Harvey, Christopher Liaw, Paul Liu:
Greedy and Local Ratio Algorithms in the MapReduce Model. SPAA 2018: 43-52 - [i6]Nicholas J. A. Harvey, Christopher Liaw, Paul Liu:
Greedy and Local Ratio Algorithms in the MapReduce Model. CoRR abs/1806.06421 (2018) - [i5]Paul Liu, Austin R. Benson, Moses Charikar:
A sampling framework for counting temporal motifs. CoRR abs/1810.00980 (2018) - [i4]Paul Liu, Jan Vondrák:
Submodular Optimization in the MapReduce Model. CoRR abs/1810.01489 (2018) - 2017
- [j2]Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid:
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60: 8-18 (2017) - [j1]Chen Greif, Shiwen He, Paul Liu:
SYM-ILDL: Incomplete LDLT Factorization of Symmetric Indefinite and Skew-Symmetric Matrices. ACM Trans. Math. Softw. 44(1): 1:1-1:21 (2017) - [i3]Christopher Liaw, Paul Liu, Robert Reiss:
Approximation Schemes for Covering and Packing in the Streaming Model. CoRR abs/1706.09533 (2017) - 2015
- [c1]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015 - [i2]Chen Greif, Shiwen He, Paul Liu:
SYM-ILDL: Incomplete $LDL^{T}$ Factorization of Symmetric Indefinite and Skew-Symmetric Matrices. CoRR abs/1505.07589 (2015) - 2014
- [i1]Paul Liu, Daniel Lu:
A fast 25/6-approximation for the minimum unit disk cover problem. CoRR abs/1406.3838 (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-04-25 05:44 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:
