Jialin Zhang

Shuo Zhang

CoRR, 2023

Competitive Auctions with Imperfect Predictions.

[BibT_eX]

[DOI]

Pinyan Lu

Zongqi Wan

CoRR, 2023

Simple Deterministic Approximation for Submodular Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Zhijie Zhang

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Online scheduling of time-critical tasks to minimize the number of calibrations.

[BibT_eX]

[DOI]

Zuzhi Chen

Theor. Comput. Sci., 2022

Discouraging pool block withholding attacks in Bitcoin.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Higher order monotonicity and submodularity of influence in social networks: From local to global.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Bounded Memory Adversarial Bandits with Composite Anonymous Delayed Feedback.

[BibT_eX]

[DOI]

Zongqi Wan

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Improved Deterministic Algorithms for Non-monotone Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Online Influence Maximization with Node-Level Feedback Using Standard Offline Oracles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Special Issue on the International Conference on Algorithmic Aspects in Information and Management 2019 (AAIM'19).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Querying a Matrix through Matrix-Vector Products.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Follow the perturbed approximate leader for solving semi-bandit combinatorial optimization.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., 2021

Network Inference and Influence Maximization from Samples.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

The one-round multi-player discrete Voronoi game on grids and trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Coreness of cooperative games with truncated submodular profit functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Quantum Search with Prior Knowledge.

[BibT_eX]

[DOI]

Xiaoyu He

CoRR, 2020

Discouraging Pool Block Withholding Attacks in Bitcoins.

[BibT_eX]

[DOI]

CoRR, 2020

Online Convex Optimization with Classical and Quantum Evaluation Oracles.

[BibT_eX]

[DOI]

CoRR, 2020

Tight Algorithms for the Submodular Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Zhijie Zhang

CoRR, 2020

On the Optimality of Tape Merge of Two Lists with Similar Size.

[BibT_eX]

[DOI]

Qian Li

Algorithmica, 2020

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Optimization from Structured Samples for Coverage Functions.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Decentralized Mining Pool Games in Blockchain.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Knowledge Graph, 2020

Approximate Single-Peakedness in Large Elections.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Knowledge Graph, 2020

Better Upper Bounds for Searching on a Line with Byzantine Robots.

[BibT_eX]

[DOI]

Yuan Sun

Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

Revisiting Online Quantum State Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Cumulative activation in social networks.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2019

The Complexity of Optimization on Grids.

[BibT_eX]

[DOI]

Algorithmica, 2019

A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems.

[BibT_eX]

[DOI]

Proceedings of The 10th Asian Conference on Machine Learning, 2018

2017

Near optimal algorithms for online weighted bipartite matching in adversary model.

[BibT_eX]

[DOI]

Jia Zhang

J. Comb. Optim., 2017

A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids.

[BibT_eX]

[DOI]

Zhijie Zhang

CoRR, 2017

Partial Sorting Problem on Evolving Data.

[BibT_eX]

[DOI]

Algorithmica, 2017

Influence Maximization with ε-Almost Submodular Threshold Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Computing the least-core and nucleolus for threshold cardinality matching games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Community Detection: a Refined Axiomization and Beyond.

[BibT_eX]

[DOI]

CoRR, 2016

Communities in Preference Networks: Refined Axioms and Beyond.

[BibT_eX]

[DOI]

Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Shortest Paths on Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Networks - 5th International Conference, 2016

The Routing of Complex Contagion in Kleinberg's Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

How to Select the Top k Elements from Evolving Data?

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Deterministic Protocol for Shared $Q$-queue $J$-choice $K$-best Secretary Problem.

[BibT_eX]

[DOI]

Jia Zhang

CoRR, 2014

How to select the largest k elements from evolving data?

[BibT_eX]

[DOI]

CoRR, 2014

Minimizing seed set selection with probabilistic coverage guarantee in a social network.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol.

[BibT_eX]

[DOI]

Jia Zhang

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

On the power of breakable objects.

[BibT_eX]

[DOI]

Guangda Hu

Theor. Comput. Sci., 2013

Influence Maximization in Dynamic Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

2012

Distributed Consensus Resilient to Both Crash Failures and Strategic Manipulations

[BibT_eX]

[DOI]

Xiaohui Bei

CoRR, 2012

2011

Bounded budget betweenness centrality game for strategic network formations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2009

Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Bounded cost algorithms for multivalued consensus using binary consensus instances.

[BibT_eX]

[DOI]