Liren Shan

According to our database, Liren Shan authored at least 22 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

LiD-FL: Towards List-Decodable Federated Learning.

Hong Liu, Liren Shan, Han Bao, Ronghui You, Yuhao Yi, Jiancheng Lv

CoRR, 2024

Higher-Order Cheeger Inequality for Partitioning with Buffers.

Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan

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

Error-Tolerant E-Discovery Protocols.

Jinshuo Dong, Jason D. Hartline, Liren Shan, Aravindan Vijayaraghavan

Proceedings of the Symposium on Computer Science and Law, 2024

2023

Approximation Algorithms for Norm Multiway Cut.

Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan

CoRR, 2023

Random Cuts are Optimal for Explainable k-Medians.

Konstantin Makarychev, Liren Shan

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximation Algorithm for Norm Multiway Cut.

Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan

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

Optimal Scoring Rules for Multi-dimensional Effort.

Jason D. Hartline, Liren Shan, Yingkai Li, Yifan Wu

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models.

Yuhao Yi, Liren Shan, Philip E. Paré, Karl Henrik Johansson

SIAM J. Control. Optim., 2022

Fair Curing and Network Design in SIS Epidemic Processes.

Yuhao Yi, Liren Shan, Philip E. Paré, Karl Henrik Johansson

CoRR, 2022

Explainable <i>k</i>-means: don't be greedy, plant bigger trees!

Konstantin Makarychev, Liren Shan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Optimization of Scoring Rules.

Yingkai Li, Jason D. Hartline, Liren Shan, Yifan Wu

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Algorithmic Learning Foundations for Common Law.

Jason D. Hartline, Daniel W. Linna Jr., Liren Shan, Alex Tang

Proceedings of the 2022 Symposium on Computer Science and Law, 2022

2021

Explainable k-means. Don't be greedy, plant bigger trees!

Konstantin Makarychev, Liren Shan

CoRR, 2021

Near-Optimal Algorithms for Explainable k-Medians and k-Means.

Konstantin Makarychev, Liren Shan

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

2020

Improved Guarantees for k-means++ and k-means++ Parallel.

Konstantin Makarychev, Aravind Reddy, Liren Shan

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Stochastic Linear Optimization with Adversarial Corruption.

Yingkai Li, Edmund Y. Lou, Liren Shan

CoRR, 2019

Current Flow Group Closeness Centrality for Complex Networks?

Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang

Proceedings of the World Wide Web Conference, 2019

2018

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket.

Liren Shan, Huan Li, Zhongzhi Zhang

Theor. Comput. Sci., 2018

Biharmonic Distance Related Centrality for Edges in Weighted Networks.

Yuhao Yi, Liren Shan, Huan Li, Zhongzhi Zhang

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Improving Information Centrality of a Node in Complex Networks by Adding Edges.

Liren Shan, Yuhao Yi, Zhongzhi Zhang

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network.

Yuhao Yi, Zhongzhi Zhang, Liren Shan, Guanrong Chen

IEEE Trans. Control. Syst. Technol., 2017

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph.

Liren Shan, Huan Li, Zhongzhi Zhang

Theor. Comput. Sci., 2017