default search action
Jing Tang 0004
唐靖
Person information
- unicode name: 唐靖
- affiliation: Hong Kong University of Science and Technology Guangzhou (HKUST-GZ), Guangzhou, China
- affiliation: Hong Kong University of Science and Technology (HKUST), Tai Po Tsai, Hong Kong
- affiliation (former): National University of Singapore, Singapore
- affiliation (PhD 2017): Nanyang Technological University, School of Computer Science and Engineering, Singapore
Other persons with the same name
- Jing Tang — disambiguation page
- Jing Tang 0001 — Teesside University, School of Computing, Middlesbrough, UK (and 1 more)
- Jing Tang 0002
— University of Helsinki, Institute for Molecular Medicine, Finland (and 1 more)
- Jing Tang 0003 — Tokyo Institute of Technology, Department of Industrial Engineering and Management, Graduate School of Decision Science and Technology, Japan
- Jing Tang 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j16]Bing Tong, Yan Zhou, Chen Zhang, Jianheng Tang, Jing Tang, Leihong Yang, Qiye Li, Manwu Lin, Zhongxin Bao, Jia Li, Lei Chen:
Galaxybase: A High Performance Native Distributed Graph Database for HTAP. Proc. VLDB Endow. 17(12): 3893-3905 (2024) - [c31]Jing Xiong, Zixuan Li, Chuanyang Zheng, Zhijiang Guo, Yichun Yin, Enze Xie, Zhicheng Yang, Qingxing Cao, Haiming Wang, Xiongwei Han, Jing Tang, Chengming Li, Xiaodan Liang:
DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning. ICLR 2024 - [c30]Xiaolong Chen
Link Recommendation to Augment Influence Diffusion with Provable Guarantees. WWW 2024: 2509-2518 - [i30]Xiaolong Chen, Yifan Song, Jing Tang:
Link Recommendation to Augment Influence Diffusion with Provable Guarantees. CoRR abs/2402.19189 (2024) - [i29]Yihong Luo, Xiaolong Chen, Jing Tang:
You Only Sample Once: Taming One-Step Text-To-Image Synthesis by Self-Cooperative Diffusion GANs. CoRR abs/2403.12931 (2024) - [i28]Haiming Wang, Huajian Xin, Zhengying Liu, Wenda Li, Yinya Huang, Jianqiao Lu, Zhicheng Yang, Jing Tang, Jian Yin, Zhenguo Li, Xiaodan Liang:
Proving Theorems Recursively. CoRR abs/2405.14414 (2024) - [i27]Jianqiao Lu, Zhengying Liu, Yingjia Wan, Yinya Huang, Haiming Wang, Zhicheng Yang, Jing Tang, Zhijiang Guo:
Process-Driven Autoformalization in Lean 4. CoRR abs/2406.01940 (2024) - [i26]Weilin Cai, Juyong Jiang, Fan Wang, Jing Tang, Sunghun Kim, Jiayi Huang:
A Survey on Mixture of Experts. CoRR abs/2407.06204 (2024) - [i25]Zhicheng Yang, Yinya Huang, Wei Shi, Liang Feng, Linqi Song, Yiwei Wang, Xiaodan Liang, Jing Tang:
Benchmarking LLMs for Optimization Modeling and Enhancing Reasoning via Reverse Socratic Synthesis. CoRR abs/2407.09887 (2024) - 2023
- [j15]Renchi Yang
Efficient Estimation of Pairwise Effective Resistance. Proc. ACM Manag. Data 1(1): 16:1-16:27 (2023) - [j14]Yuqing Zhu
2-hop+ Sampling: Efficient and Effective Influence Estimation. IEEE Trans. Knowl. Data Eng. 35(2): 1088-1103 (2023) - [c29]Shuang Cui
Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity. AAAI 2023: 7261-7269 - [c28]Yiwei Wang, Bryan Hooi, Fei Wang, Yujun Cai, Yuxuan Liang, Wenxuan Zhou, Jing Tang, Manjuan Duan, Muhao Chen:
How Fragile is Relation Extraction under Entity Replacements? CoNLL 2023: 414-423 - [c27]Yuhan Chen, Yihong Luo, Jing Tang, Liang Yang, Siya Qiu, Chuan Wang, Xiaochun Cao:
LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity. IJCAI 2023: 3550-3558 - [c26]Shiqi Zhang
Efficient Approximation Algorithms for Spanning Centrality. KDD 2023: 3386-3395 - [c25]Shuang Cui
Streaming Algorithms for Constrained Submodular Maximization. SIGMETRICS (Abstracts) 2023: 65-66 - [c24]Keke Huang
Node-wise Diffusion for Scalable Graph Learning. WWW 2023: 1723-1733 - [c23]Shuang Cui
Constrained Subset Selection from Data Streams for Profit Maximization. WWW 2023: 1822-1831 - [c22]He Huang
Randomized Pricing with Deferred Acceptance for Revenue Maximization with Submodular Objectives. WWW 2023: 3530-3540 - [i24]Yuhan Chen, Yihong Luo, Jing Tang, Liang Yang, Siya Qiu, Chuan Wang, Xiaochun Cao:
LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity. CoRR abs/2305.04225 (2023) - [i23]Yiwei Wang, Bryan Hooi, Fei Wang, Yujun Cai, Yuxuan Liang, Wenxuan Zhou, Jing Tang, Manjuan Duan, Muhao Chen:
How Fragile is Relation Extraction under Entity Replacements? CoRR abs/2305.13551 (2023) - [i22]Keke Huang, Jing Tang, Juncheng Liu, Renchi Yang, Xiaokui Xiao:
Node-wise Diffusion for Scalable Graph Learning. CoRR abs/2305.14000 (2023) - [i21]Shiqi Zhang, Renchi Yang, Jing Tang, Xiaokui Xiao, Bo Tang:
Efficient Approximation Algorithms for Spanning Centrality. CoRR abs/2305.16086 (2023) - [i20]Shuang Cui, Kai Han, Jing Tang, He Huang, Xueying Li, Aakas Zhiyuli, Hanxiao Li:
Practical Parallel Algorithms for Non-Monotone Submodular Maximization. CoRR abs/2308.10656 (2023) - [i19]Jing Xiong, Zixuan Li, Chuanyang Zheng, Zhijiang Guo, Yichun Yin, Enze Xie, Zhicheng Yang, Qingxing Cao, Haiming Wang, Xiongwei Han, Jing Tang, Chengming Li, Xiaodan Liang:
DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning. CoRR abs/2310.02954 (2023) - [i18]Tianyuan Jin, Yu Yang, Jing Tang, Xiaokui Xiao, Pan Xu:
Optimal Batched Best Arm Identification. CoRR abs/2310.14129 (2023) - [i17]Yihong Luo, Siya Qiu, Xingjian Tao, Yujun Cai, Jing Tang:
Energy-Calibrated VAE with Test Time Free Lunch. CoRR abs/2311.04071 (2023) - [i16]Zhicheng Yang, Yiwei Wang, Yinya Huang
Speak Like a Native: Prompting Large Language Models in a Native Style. CoRR abs/2311.13538 (2023) - [i15]Renchi Yang, Jing Tang:
Efficient Estimation of Pairwise Effective Resistance. CoRR abs/2312.06123 (2023) - 2022
- [j13]Qintian Guo
Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Trans. Database Syst. 47(3): 12:1-12:45 (2022) - [j12]Yuqing Zhu, Jing Tang
Optimal price profile for influential nodes in online social networks. VLDB J. 31(4): 779-795 (2022) - [c21]Jing Tang, Yuqing Zhu, Xueyan Tang, Kai Han:
Distributed Influence Maximization for Large-Scale Online Social Networks. ICDE 2022: 81-95 - [c20]Qianhao Cong
Cost-Effective Algorithms for Average-Case Interactive Graph Search. ICDE 2022: 1152-1165 - [c19]Qianhao Cong
Noisy Interactive Graph Search. KDD 2022: 231-240 - [c18]Qing Xiu, Kai Han, Jing Tang, Shuang Cui, He Huang:
Chromatic Correlation Clustering, Revisited. NeurIPS 2022 - [i14]Qianhao Cong, Jing Tang, Yuming Huang, Lei Chen, Yeow Meng Chee:
Cost-Effective Algorithms for Average-Case Interactive Graph Search. CoRR abs/2201.07944 (2022) - 2021
- [j11]Jing Tang, Xueyan Tang, Andrew Lim
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 08:1-08:22 (2021) - [j10]Shuang Cui
Streaming Algorithms for Constrained Submodular Maximization. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 54:1-54:32 (2021) - [j9]Yuqing Zhu, Jing Tang, Xueyan Tang, Lei Chen:
Analysis of Influence Contribution in Social Advertising. Proc. VLDB Endow. 15(2): 348-360 (2021) - [c17]Shuang Cui, Kai Han, Tianshuai Zhu, Jing Tang, Benwei Wu, He Huang:
Randomized Algorithms for Submodular Function Maximization with a k-System Constraint. ICML 2021: 2222-2232 - [c16]Tianyuan Jin, Keke Huang, Jing Tang, Xiaokui Xiao:
Optimal Streaming Algorithms for Multi-Armed Bandits. ICML 2021: 5045-5054 - [c15]Tianyuan Jin, Jing Tang, Pan Xu, Keke Huang, Xiaokui Xiao, Quanquan Gu:
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits. ICML 2021: 5065-5073 - [c14]Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang:
Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer. NeurIPS 2021: 11096-11107 - [c13]Jing Tang
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. SIGMETRICS (Abstracts) 2021: 63-64 - [c12]Kai Han, Benwei Wu, Jing Tang
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. SIGMOD Conference 2021: 671-684 - [c11]Yuming Huang, Jing Tang
Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives. SIGMOD Conference 2021: 790-803 - [i13]Yuming Huang, Jing Tang, Qianhao Cong, Andrew Lim, Jianliang Xu:
Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives. CoRR abs/2103.14713 (2021) - [i12]Kai Han, Shuang Cui, Tianshuai Zhu, Jing Tang, Benwei Wu, He Huang:
The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization. CoRR abs/2106.07116 (2021) - [i11]Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Çigdem Aslay, Laks V. S. Lakshmanan:
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. CoRR abs/2107.04997 (2021) - [i10]Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang:
Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer. CoRR abs/2110.02544 (2021) - [i9]Yiwei Wang, Yujun Cai, Yuxuan Liang, Wei Wang, Henghui Ding, Muhao Chen, Jing Tang, Bryan Hooi:
Structure-Aware Label Smoothing for Graph Neural Networks. CoRR abs/2112.00499 (2021) - 2020
- [j8]Yuqing Zhu, Jing Tang
Pricing Influential Nodes in Online Social Networks. Proc. VLDB Endow. 13(10): 1614-1627 (2020) - [j7]Keke Huang
Efficient approximation algorithms for adaptive influence maximization. VLDB J. 29(6): 1385-1406 (2020) - [c10]Jun Zhao, Jing Tang
An Analysis of Blockchain Consistency in Asynchronous Networks: Deriving a Neat Bound. ICDCS 2020: 179-189 - [c9]Keke Huang
Efficient Approximation Algorithms for Adaptive Target Profit Maximization. ICDE 2020: 649-660 - [c8]Xinke Li, Chongshou Li
Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene. ACM Multimedia 2020: 238-246 - [i8]Keke Huang, Jing Tang, Kai Han, Xiaokui Xiao, Wei Chen, Aixin Sun, Xueyan Tang, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Influence Maximization. CoRR abs/2004.06469 (2020) - [i7]Xinke Li, Chongshou Li, Zekun Tong, Andrew Lim, Junsong Yuan, Yuwei Wu, Jing Tang, Raymond Huang:
Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene. CoRR abs/2008.04968 (2020) - [i6]Jing Tang, Xueyan Tang, Andrew Lim, Kai Han, Chongshou Li, Junsong Yuan:
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. CoRR abs/2008.05391 (2020)
2010 – 2019
- 2019
- [j6]Jing Tang
Regulating Monopolistic ISPs Without Neutrality. IEEE J. Sel. Areas Commun. 37(7): 1666-1680 (2019) - [j5]Kai Han, Fei Gui, Xiaokui Xiao, Jing Tang
Efficient and Effective Algorithms for Clustering Uncertain Graphs. Proc. VLDB Endow. 12(6): 667-680 (2019) - [c7]Jing Tang
Efficient Approximation Algorithms for Adaptive Seed Minimization. SIGMOD Conference 2019: 1096-1113 - [i5]Jing Tang, Keke Huang, Xiaokui Xiao, Laks V. S. Lakshmanan, Xueyan Tang, Aixin Sun, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Seed Minimization. CoRR abs/1907.09668 (2019) - [i4]Jun Zhao, Jing Tang, Zengxiang Li, Huaxiong Wang, Kwok-Yan Lam, Kaiping Xue:
An Analysis of Blockchain Consistency in Asynchronous Networks: Deriving a Neat Bound. CoRR abs/1909.06587 (2019) - [i3]Keke Huang, Jing Tang, Xiaokui Xiao, Aixin Sun, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Target Profit Maximization. CoRR abs/1910.13073 (2019) - 2018
- [j4]Kai Han, Keke Huang
Efficient Algorithms for Adaptive Influence Maximization. Proc. VLDB Endow. 11(9): 1029-1040 (2018) - [j3]Jing Tang
An efficient and effective hop-based approach for influence maximization in social networks. Soc. Netw. Anal. Min. 8(1): 10 (2018) - [j2]Jing Tang
Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis. IEEE Trans. Knowl. Data Eng. 30(6): 1095-1108 (2018) - [j1]Jing Tang
Traffic-Optimized Data Placement for Social Media. IEEE Trans. Multim. 20(4): 1008-1023 (2018) - [c6]Jing Tang
Towards Profit Maximization for Online Social Network Providers. INFOCOM 2018: 1178-1186 - [c5]Jing Tang
Online Processing Algorithms for Influence Maximization. SIGMOD Conference 2018: 991-1005 - 2017
- [c4]Jing Tang
Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach. ASONAM 2017: 64-71 - [i2]Jing Tang, Xueyan Tang, Junsong Yuan:
Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach. CoRR abs/1705.10442 (2017) - [i1]Jing Tang
Towards Profit Maximization for Online Social Network Providers. CoRR abs/1712.08963 (2017) - 2016
- [c3]Jing Tang
Profit maximization for viral marketing in Online Social Networks. ICNP 2016: 1-10 - 2015
- [c2]Jing Tang
Optimizing Inter-server Communication for Online Social Networks. ICDCS 2015: 215-224 - 2014
- [c1]Jing Tang
Regulating Monopolistic ISPS without Neutrality. ICNP 2014: 374-384
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-09-25 00:43 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: