Lin F. Yang - RankMe

134 papers A* 24A 4B 3Misc 1Journal 97Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fundamental Limits of Learning Under Erasure-Constrained Communication Channels. IEEE J. Sel. Areas Inf. Theory Merve Karakas, Osama A. Hanna, Lin F. Yang, Christina Fragouli
2026	J	`jnl`	LACONIC: Length-Aware Constrained Reinforcement Learning for LLM. CoRR Chang Liu, Yiran Zhao, Lawrence Liu, Yaoqi Ye, Csaba Szepesvári, Lin F. Yang
2026	J	`jnl`	Near-Optimal Sample Complexity for Online Constrained MDPs. CoRR Chang Liu, Yunfan Li, Lin F. Yang
2025	J	`jnl`	ARMOR: High-Performance Semi-Structured Pruning via Adaptive Matrix Factorization. CoRR Lawrence Liu, Alexander Liu, Mengdi Wang, Tuo Zhao, Lin F. Yang
2025	B	`conf`	Does Feedback Help in Bandits with Arm Erasures? ISIT Merve Karakas, Osama A. Hanna, Lin F. Yang, Christina Fragouli
2025	J	`jnl`	Does Feedback Help in Bandits with Arm Erasures? CoRR Merve Karakas, Osama A. Hanna, Lin F. Yang, Christina Fragouli
2025	J	`jnl`	Gemini 2.5 Pro Capable of Winning Gold at IMO 2025. CoRR Yichen Huang, Lin F. Yang
2025	J	`jnl`	List Replicable Reinforcement Learning. CoRR Bohan Zhang, Michael Chen, A. Pavan, N. V. Vinodchandran, Lin F. Yang, Ruosong Wang
2025	J	`jnl`	Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs. CoRR Yukuan Wei, Xudong Li, Lin F. Yang
2025	J	`jnl`	NoWag: A Unified Framework for Shape Preserving Compression of Large Language Models. CoRR Lawrence Liu, Inesh Chakrabarti, Yixiao Li, Mengdi Wang, Tuo Zhao, Lin F. Yang
2025	J	`jnl`	On the optimal regret of collaborative personalized linear bandits. CoRR Bruce Huang, Ruida Zhou, Lin F. Yang, Suhas N. Diggavi
2025	J	`jnl`	Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model. CoRR Xingtu Liu, Lin F. Yang, Sharan Vaswani
2024	J	`jnl`	Confident Natural Policy Gradient for Local Planning in q CoRR Tian Tian, Lin F. Yang, Csaba Szepesvári
2024	B	`conf`	Delayed MDPs with Feature Mapping. IJCNN Jialin Dong, Jiayi Wang, Lin F. Yang
2024	J	`jnl`	Don't Forget to Connect! Improving RAG with Graph-based Reranking. CoRR Jialin Dong, Bahare Fatemi, Bryan Perozzi, Lin F. Yang, Anton Tsitsulin
2024	J	`jnl`	Federated Learning With Massive Random Access. IEEE Trans. Wirel. Commun. Shuhao Xia, Yuanming Shi, Yong Zhou, Youlong Wu, Lin F. Yang, Khaled B. Letaief
2024	J	`jnl`	Hyper: Hyperparameter Robust Efficient Exploration in Reinforcement Learning. CoRR Yiran Wang, Chenshu Liu, Yunfan Li, Sanae Amani, Bolei Zhou, Lin F. Yang
2024	J	`jnl`	Learning for Bandits under Action Erasures. CoRR Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli
2024	J	`jnl`	Misspecified Q-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error. CoRR Ally Yalei Du, Lin F. Yang, Ruosong Wang
2024	J	`jnl`	Modeling Bellman-error with logistic distribution with applications in reinforcement learning. Neural Networks Outongyi Lv, Bingxin Zhou, Lin F. Yang
2024	—	`conf`	Provably Correct SGD-Based Exploration for Generalized Stochastic Bandit Problem. SmartNets Jialin Dong, Jiayi Wang, Lin F. Yang
2024	—	`conf`	Wearable Body Sensors Integrated into a Virtual Reality Environment - A Modality for Automating the Rehabilitation of the Motor Control System. EMBC Seungmin Jung, Mianzhi Zhou, Ji Ma, Ryan Yang, Steven C. Cramer, Bruce H. Dobkin, Lin F. Yang, Jacob Rosen
2023	J	`jnl`	Adaptive Liquidity Provision in Uniswap V3 with Deep Reinforcement Learning. CoRR Haochen Zhang, Xi Chen, Lin F. Yang
2023	J	`jnl`	Does Sparsity Help in Learning Misspecified Linear Bandits? CoRR Jialin Dong, Lin F. Yang
2023	J	`jnl`	Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation. CoRR Jiayi Huang, Han Zhong, Liwei Wang, Lin F. Yang
2023	J	`jnl`	MetaVL: Transferring In-Context Learning Ability From Language Models to Vision-Language Models. CoRR Masoud Monajatipoor, Liunian Harold Li, Mozhdeh Rouhsedaghat, Lin F. Yang, Kai-Wei Chang
2023	J	`jnl`	Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity. J. Mach. Learn. Res. Kaiqing Zhang, Sham M. Kakade, Tamer Basar, Lin F. Yang
2023	J	`jnl`	Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels. CoRR Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli
2023	B	`conf`	Multi-Arm Bandits over Action Erasure Channels. ISIT Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli
2023	J	`jnl`	Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning. CoRR Dingwen Kong, Lin F. Yang
2023	J	`jnl`	Replicability in Reinforcement Learning. CoRR Amin Karbasi, Grigoris Velegkas, Lin F. Yang, Felix Zhou
2023	J	`jnl`	Scaling Distributed Multi-task Reinforcement Learning with Experience Sharing. CoRR Sanae Amani, Khushbu Pahwa, Vladimir Braverman, Lin F. Yang
2023	J	`jnl`	Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds. CoRR Jiayi Huang, Han Zhong, Liwei Wang, Lin F. Yang
2022	J	`jnl`	Compression for Multi-Arm Bandits. IEEE J. Sel. Areas Inf. Theory Osama A. Hanna, Lin F. Yang, Christina Fragouli
2022	J	`jnl`	Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms. CoRR Osama A. Hanna, Lin F. Yang, Christina Fragouli
2022	J	`jnl`	Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost. CoRR Sanae Amani, Tor Lattimore, András György, Lin F. Yang
2022	Misc	`conf`	Doubly Pessimistic Algorithms for Strictly Safe Off-Policy Optimization. CISS Sanae Amani, Lin F. Yang
2022	J	`jnl`	Learning in Distributed Contextual Linear Bandits Without Sharing the Context. CoRR Osama A. Hanna, Lin F. Yang, Christina Fragouli
2022	J	`jnl`	Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP. CoRR Jinghan Wang, Mengdi Wang, Lin F. Yang
2022	J	`jnl`	Near-Optimal Sample Complexity Bounds for Constrained MDPs. CoRR Sharan Vaswani, Lin F. Yang, Csaba Szepesvári
2022	J	`jnl`	Provably Efficient Lifelong Reinforcement Learning with Linear Function Approximation. CoRR Sanae Amani, Lin F. Yang, Ching-An Cheng
2022	J	`jnl`	Universal Streaming of Subset Norms. Theory Comput. Vladimir Braverman, Robert Krauthgamer, Lin F. Yang
2021	J	`jnl`	A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost. CoRR Minbo Gao, Tianle Xie, Simon S. Du, Lin F. Yang
2021	J	`jnl`	Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs. CoRR Han Zhong, Jiayi Huang, Lin F. Yang, Liwei Wang
2021	J	`jnl`	Decentralized Cooperative Multi-Agent Reinforcement Learning with Exploration. CoRR Weichao Mao, Tamer Basar, Lin F. Yang, Kaiqing Zhang
2021	J	`jnl`	Gap-Dependent Unsupervised Exploration for Reinforcement Learning. CoRR Jingfeng Wu, Vladimir Braverman, Lin F. Yang
2021	A*	`conf`	Global Neighbor Sampling for Mixed CPU-GPU Training on Giant Graphs. KDD Jialin Dong, Da Zheng, Lin F. Yang, George Karypis
2021	J	`jnl`	Global Neighbor Sampling for Mixed CPU-GPU Training on Giant Graphs. CoRR Jialin Dong, Da Zheng, Lin F. Yang, George Karypis
2021	A	`conf`	Minimax sample complexity for turn-based stochastic game. UAI Qiwen Cui, Lin F. Yang
2021	J	`jnl`	Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver. CoRR Xiaoyu Chen, Jiachen Hu, Lin F. Yang, Liwei Wang
2021	J	`jnl`	Online Sub-Sampling for Reinforcement Learning with General Function Approximation. CoRR Dingwen Kong, Ruslan Salakhutdinov, Ruosong Wang, Lin F. Yang
2021	J	`jnl`	Provably Breaking the Quadratic Error Compounding Barrier in Imitation Learning, Optimally. CoRR Nived Rajaraman, Yanjun Han, Lin F. Yang, Kannan Ramchandran, Jiantao Jiao
2021	J	`jnl`	Provably Correct Optimization and Exploration with Non-linear Policies. CoRR Fei Feng, Wotao Yin, Alekh Agarwal, Lin F. Yang
2021	A	`conf`	Q-learning with Logarithmic Regret. AISTATS Kunhe Yang, Lin F. Yang, Simon S. Du
2021	J	`jnl`	Randomized Exploration for Reinforcement Learning with General Value Function Approximation. CoRR Haque Ishfaq, Qiwen Cui, Viet Nguyen, Alex Ayoub, Zhuoran Yang, Zhaoran Wang, Doina Precup, Lin F. Yang
2021	J	`jnl`	Safe Reinforcement Learning with Linear Function Approximation. CoRR Sanae Amani, Christos Thrampoulidis, Lin F. Yang
2021	A*	`conf`	Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning. FOCS Yuanzhi Li, Ruosong Wang, Lin F. Yang
2021	J	`jnl`	Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning. CoRR Yuanzhi Li, Ruosong Wang, Lin F. Yang
2021	J	`jnl`	Solving Multi-Arm Bandit Using a Few Bits of Communication. CoRR Osama A. Hanna, Lin F. Yang, Christina Fragouli
2021	A*	`conf`	Theoretically Principled Deep RL Acceleration via Nearest Neighbor Function Approximation. AAAI Junhong Shen, Lin F. Yang
2021	J	`jnl`	Theoretically Principled Deep RL Acceleration via Nearest Neighbor Function Approximation. CoRR Junhong Shen, Lin F. Yang
2020	J	`jnl`	Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning. CoRR Jingfeng Wu, Vladimir Braverman, Lin F. Yang
2020	J	`jnl`	Deep Reinforcement Learning with Linear Quadratic Regulator Regions. CoRR Gabriel I. Fernandez, Colin Togashi, Dennis W. Hong, Lin F. Yang
2020	J	`jnl`	Episodic Linear Quadratic Regulators with Low-rank Transitions. CoRR Tianyu Wang, Lin F. Yang
2020	A*	`conf`	Is Long Horizon RL More Difficult Than Short Horizon RL? NeurIPS Ruosong Wang, Simon S. Du, Lin F. Yang, Sham M. Kakade
2020	J	`jnl`	Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning? CoRR Ruosong Wang, Simon S. Du, Lin F. Yang, Sham M. Kakade
2020	A*	`conf`	Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning? NeurIPS Qiwen Cui, Lin F. Yang
2020	J	`jnl`	Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning? CoRR Qiwen Cui, Lin F. Yang
2020	A*	`conf`	Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning? ICLR Simon S. Du, Sham M. Kakade, Ruosong Wang, Lin F. Yang
2020	J	`jnl`	Minimax Sample Complexity for Turn-based Stochastic Game. CoRR Qiwen Cui, Lin F. Yang
2020	A*	`conf`	Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity. NeurIPS Kaiqing Zhang, Sham M. Kakade, Tamer Basar, Lin F. Yang
2020	J	`jnl`	Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity. CoRR Kaiqing Zhang, Sham M. Kakade, Tamer Basar, Lin F. Yang
2020	J	`jnl`	Model-Based Reinforcement Learning with Value-Targeted Regression. CoRR Alex Ayoub, Zeyu Jia, Csaba Szepesvári, Mengdi Wang, Lin F. Yang
2020	A*	`conf`	Model-Based Reinforcement Learning with a Generative Model is Minimax Optimal. COLT Alekh Agarwal, Sham M. Kakade, Lin F. Yang
2020	J	`jnl`	Obtaining Adjustable Regularization for Free via Iterate Averaging. CoRR Jingfeng Wu, Vladimir Braverman, Lin F. Yang
2020	A*	`conf`	On Reward-Free Reinforcement Learning with Linear Function Approximation. NeurIPS Ruosong Wang, Simon S. Du, Lin F. Yang, Ruslan Salakhutdinov
2020	J	`jnl`	On Reward-Free Reinforcement Learning with Linear Function Approximation. CoRR Ruosong Wang, Simon S. Du, Lin F. Yang, Ruslan Salakhutdinov
2020	A*	`conf`	Planning with General Objective Functions: Going Beyond Total Rewards. NeurIPS Ruosong Wang, Peilin Zhong, Simon S. Du, Ruslan Salakhutdinov, Lin F. Yang
2020	A*	`conf`	Preference-based Reinforcement Learning with Finite-Time Guarantees. NeurIPS Yichong Xu, Ruosong Wang, Lin F. Yang, Aarti Singh, Artur Dubrawski
2020	J	`jnl`	Preference-based Reinforcement Learning with Finite-Time Guarantees. CoRR Yichong Xu, Ruosong Wang, Lin F. Yang, Aarti Singh, Artur Dubrawski
2020	J	`jnl`	Provably Efficient Exploration for RL with Unsupervised Learning. CoRR Fei Feng, Ruosong Wang, Wotao Yin, Simon S. Du, Lin F. Yang
2020	A*	`conf`	Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning. NeurIPS Fei Feng, Ruosong Wang, Wotao Yin, Simon S. Du, Lin F. Yang
2020	J	`jnl`	Provably Efficient Reinforcement Learning with General Value Function Approximation. CoRR Ruosong Wang, Ruslan Salakhutdinov, Lin F. Yang
2020	J	`jnl`	Q-learning with Logarithmic Regret. CoRR Kunhe Yang, Lin F. Yang, Simon S. Du
2020	J	`jnl`	Random Walk Bandits. CoRR Tianyu Wang, Lin F. Yang, Zizhuo Wang
2020	A*	`conf`	Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension. NeurIPS Ruosong Wang, Ruslan Salakhutdinov, Lin F. Yang
2020	J	`jnl`	Sketching Transformed Matrices with Applications to Natural Language Processing. CoRR Yingyu Liang, Zhao Song, Mengdi Wang, Lin F. Yang, Xin Yang
2020	J	`jnl`	The one-way communication complexity of dynamic time warping distance. J. Comput. Geom. Vladimir Braverman, Moses Charikar, William Kuszmaul, Lin F. Yang
2020	A*	`conf`	Toward the Fundamental Limits of Imitation Learning. NeurIPS Nived Rajaraman, Lin F. Yang, Jiantao Jiao, Kannan Ramchandran
2020	J	`jnl`	Toward the Fundamental Limits of Imitation Learning. CoRR Nived Rajaraman, Lin F. Yang, Jiantao Jiao, Kannan Ramchandran
2019	J	`jnl`	Continuous Control with Contexts, Provably. CoRR Simon S. Du, Ruosong Wang, Mengdi Wang, Lin F. Yang
2019	J	`jnl`	Does Knowledge Transfer Always Help to Learn a Better Policy? CoRR Fei Feng, Wotao Yin, Lin F. Yang
2019	A*	`conf`	Efficient Symmetric Norm Regression via Linear Sketching. NeurIPS Zhao Song, Ruosong Wang, Lin F. Yang, Hongyang Zhang, Peilin Zhong
2019	J	`jnl`	Efficient Symmetric Norm Regression via Linear Sketching. CoRR Zhao Song, Ruosong Wang, Lin F. Yang, Hongyang Zhang, Peilin Zhong
2019	J	`jnl`	Feature-Based Q-Learning for Two-Player Stochastic Games. CoRR Zeyu Jia, Lin F. Yang, Mengdi Wang
2019	J	`jnl`	Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning? CoRR Simon S. Du, Sham M. Kakade, Ruosong Wang, Lin F. Yang
2019	—	`conf`	Learning to Control in Metric Space with Optimal Regret. Allerton Chengzhuo Ni, Lin F. Yang, Mengdi Wang
2019	J	`jnl`	Learning to Control in Metric Space with Optimal Regret. CoRR Lin F. Yang, Chengzhuo Ni, Mengdi Wang
2019	J	`jnl`	Misspecified nonconvex statistical optimization for sparse phase retrieval. Math. Program. Zhuoran Yang, Lin F. Yang, Ethan X. Fang, Tuo Zhao, Zhaoran Wang, Matey Neykov
2019	J	`jnl`	On the Optimality of Sparse Model-Based Planning for Markov Decision Processes. CoRR Alekh Agarwal, Sham M. Kakade, Lin F. Yang
2019	A	`conf`	Online Factorization and Partition of Complex Networks by Random Walk. UAI Lin F. Yang, Zheng Yu, Vladimir Braverman, Tuo Zhao, Mengdi Wang
2019	J	`jnl`	Reinforcement Leaning in Feature Space: Matrix Bandit, Kernels, and Regret Bound. CoRR Lin F. Yang, Mengdi Wang
2019	J	`jnl`	Sample-Optimal Parametric Q-Learning with Linear Transition Models. CoRR Lin F. Yang, Mengdi Wang
2019	J	`jnl`	Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity. CoRR Aaron Sidford, Mengdi Wang, Lin F. Yang, Yinyu Ye
2019	A*	`conf`	The One-Way Communication Complexity of Dynamic Time Warping Distance. SoCG Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang
2019	J	`jnl`	The One-Way Communication Complexity of Dynamic Time Warping Distance. CoRR Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang
2019	A	`conf`	Towards a Theoretical Understanding of Hashing-Based Neural Nets. AISTATS Yibo Lin, Zhao Song, Lin F. Yang
2018	A*	`conf`	Approximate Convex Hull of Data Streams. ICALP Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang
2018	A*	`conf`	Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. ICML Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, Lin F. Yang
2018	J	`jnl`	New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Algorithmica Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang
2018	J	`jnl`	On Landscape of Lagrangian Functions and Stochastic Search for Constrained Nonconvex Optimization. CoRR Zhehui Chen, Xingguo Li, Lin F. Yang, Jarvis D. Haupt, Tuo Zhao
2018	A*	`conf`	Revisiting Frequency Moment Estimation in Random Order Streams. ICALP Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang
2018	J	`jnl`	Revisiting Frequency Moment Estimation in Random Order Streams. CoRR Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang
2018	J	`jnl`	Scalable streaming tools for analyzing N-body simulations: Finding halos and investigating excursion sets in one pass. Astron. Comput. Nikita Ivkin, Zaoxing Liu, Lin F. Yang, S. S. Kumar, Gerard Lemson, Mark Neyrinck, Alexander S. Szalay, Vladimir Braverman, Tamas Budavari
2018	J	`jnl`	Sensitivity Sampling Over Dynamic Geometric Data Streams with Applications to k-Clustering. CoRR Zhao Song, Lin F. Yang, Peilin Zhong
2018	A*	`conf`	The Physical Systems Behind Optimization Algorithms. NeurIPS Lin F. Yang, Raman Arora, Vladimir Braverman, Tuo Zhao
2018	J	`jnl`	Towards a Theoretical Understanding of Hashing-Based Neural Nets. CoRR Yibo Lin, Zhao Song, Lin F. Yang
2018	J	`jnl`	Universal Streaming of Subset Norms. CoRR Vladimir Braverman, Robert Krauthgamer, Lin F. Yang
2017	J	`jnl`	Approximate Convex Hull of Data Streams. CoRR Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang
2017	A*	`conf`	Clustering High Dimensional Dynamic Data Streams. ICML Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, Lin F. Yang
2017	J	`jnl`	Clustering High Dimensional Dynamic Data Streams. CoRR Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, Lin F. Yang
2017	J	`jnl`	Dynamic Factorization and Partition of Complex Networks. CoRR Lin F. Yang, Vladimir Braverman, Tuo Zhao, Mengdi Wang
2017	J	`jnl`	Misspecified Nonconvex Statistical Optimization for Phase Retrieval. CoRR Zhuoran Yang, Lin F. Yang, Ethan X. Fang, Tuo Zhao, Zhaoran Wang, Matey Neykov
2017	J	`jnl`	On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions. CoRR Xingguo Li, Lin F. Yang, Jason Ge, Jarvis D. Haupt, Tong Zhang, Tuo Zhao
2017	A*	`conf`	Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability. ICML Zhehui Chen, Lin F. Yang, Chris Junchi Li, Tuo Zhao
2017	A*	`conf`	Streaming symmetric norms via measure concentration. STOC Jaroslaw Blasiok, Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang
2016	J	`jnl`	Sketches for Matrix Norms: Faster, Smaller and More General. CoRR Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang
2016	A*	`conf`	Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. PODS Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang
2016	J	`jnl`	Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. CoRR Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang
2016	J	`jnl`	The Physical Systems Behind Optimization Algorithms. CoRR Lin F. Yang, Raman Arora, Vladimir Braverman, Tuo Zhao
2015	—	`conf`	New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. MFCS (2) Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang
2015	J	`jnl`	Streaming Symmetric Norms via Measure Concentration. CoRR Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang
2014	—	`conf`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
2014	J	`jnl`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang