On the cascading spectrum contention problem in self-coexistence of cognitive radio networks. - Lin Chen 003; Kaigui Bian; Lin Chen 002; Wei Yan 007; Xiaoming Li 001 (CRAB@MobiCom, 2013)

A group-theoretic framework for rendezvous in heterogeneous cognitive radio networks. - Lin Chen 003; Kaigui Bian; Lin Chen 002; Cong Liu 001; Jung-Min "Jerry" Park; Xiaoming Li 001 (MobiHoc, 2014)

Addressing the Hidden Terminal Problem for Heterogeneous Coexistence Between TDM and CSMA Networks in White Space. - Kaigui Bian; Jung-Min Park 001; Lin Chen 003; Xiaoming Li 001 (IEEE Trans. Veh. Technol., 2014)

Reading between lines: high-rate, non-intrusive visual codes within regular videos via ImplicitCode. - Shuyu Shi; Lin Chen 003; Wenjun Hu; Marco Gruteser (UbiComp, 2015)

Optimizing average-maximum TTR trade-off for cognitive radio rendezvous. - Lin Chen 003; Shuyu Shi; Kaigui Bian; Yusheng Ji (ICC, 2015)

TapLock: Exploit finger tap events for enhancing attack resilience of smartphone passwords. - Hongji Yang; Lin Chen 003; Kaigui Bian; Yang Tian; Fan Ye 003; Wei Yan 007; Tong Zhao 001; Xiaoming Li 001 (ICC, 2015)

On heterogeneous neighbor discovery in wireless sensor networks. - Lin Chen 003; Ruolin Fan; Kaigui Bian; Lin Chen 002; Mario Gerla; Tao Wang 004; Xiaoming Li 001 (INFOCOM, 2015)

Multichannel Broadcast Via Channel Hopping in Cognitive Radio Networks. - Lin Chen 003; Kaigui Bian; Xiaojiang Du; Xiaoming Li 001 (IEEE Trans. Veh. Technol., 2015)

Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling. - Lin Chen 003; Forrest W. Crawford; Amin Karbasi (AAAI, 2016)

Influence Maximization in Messenger-Based Social Networks. - Yuanxing Zhang; Yichong Bai; Lin Chen 003; Kaigui Bian; Xiaoming Li 001 (GLOBECOM, 2016)

On diffusion-restricted social network: A measurement study of WeChat moments. - Zhuqi Li; Lin Chen 003; Yichong Bai; Kaigui Bian; Pan Zhou 001 (ICC, 2016)

Estimating the Size of a Large Network and its Communities from a Random Sample. - Lin Chen 003; Amin Karbasi; Forrest W. Crawford (NIPS, 2016)

Skolem Sequence Based Self-Adaptive Broadcast Protocol in Cognitive Radio Networks. - Lin Chen 003; Zhiping Xiao 001; Kaigui Bian; Shuyu Shi; Rui Li; Yusheng Ji (VTC Spring, 2016)

Dimension Coupling: Optimal Active Learning of Halfspaces via Query Synthesis. - Lin Chen 003; S. Hamed Hassani; Amin Karbasi (CoRR, 2016)

Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting. - Lin Chen 003; Seyed Hamed Hassani; Amin Karbasi (AAAI, 2017)

Dynamic Slot-Length Control for Reducing Neighbor Discovery Latency in Wireless Sensor Networks. - Yangbin Zhang; Kaigui Bian; Lin Chen 003; Pan Zhou 001; Xiaoming Li 001 (GLOBECOM, 2017)

Interactive Submodular Bandit. - Lin Chen 003; Andreas Krause 001; Amin Karbasi (NIPS, 2017)

Submodular Variational Inference for Network Reconstruction. - Lin Chen 003; Forrest W. Crawford; Amin Karbasi (UAI, 2017)

Online Continuous Submodular Maximization. - Lin Chen 003; Hamed Hassani; Amin Karbasi (AISTATS, 2018)

Comparison Based Learning from Weak Oracles. - Ehsan Kazemi 001; Lin Chen 003; Sanjoy Dasgupta; Amin Karbasi (AISTATS, 2018)

Early Detection of Rumors in Heterogeneous Mobile Social Network. - Yuanxing Zhang; Kaigui Bian; Lin Chen 003; Shaoling Dong; Lingyang Song; Xiaoming Li 001 (DSC, 2018)

Enabling Symbiotic Coexistence of Heterogeneous Cognitive Radio Networks. - Yuanxing Zhang; Lin Chen 003; Kaigui Bian; Lingyang Song; Xiaoming Li 001 (DySPAN, 2018)

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? - Lin Chen 003; Moran Feldman; Amin Karbasi (ICML, 2018)

Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity. - Lin Chen 003; Christopher Harshaw; Hamed Hassani; Amin Karbasi (ICML, 2018)

On heterogeneous duty cycles for neighbor discovery in wireless sensor networks. - Lin Chen 003; Ruolin Fan; Yangbin Zhang; Shuyu Shi; Kaigui Bian; Lin Chen 002; Pan Zhou 001; Mario Gerla; Tao Wang 004; Xiaoming Li 001 (Ad Hoc Networks, 2018)

Accurate Location Tracking From CSI-Based Passive Device-Free Probabilistic Fingerprinting. - Shuyu Shi; Stephan Sigg; Lin Chen 003; Yusheng Ji (IEEE Trans. Veh. Technol., 2018)

Projection-Free Bandit Convex Optimization. - Lin Chen 003; Mingrui Zhang; Amin Karbasi (AISTATS, 2019)

A Neural Attack Model for Cracking Passwords in Adversarial Environments. - Yushuo Guan; Yuanxing Zhang; Lin Chen 003; Kaigui Bian (ICCC, 2019)

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback. - Mingrui Zhang; Lin Chen 003; Hamed Hassani; Amin Karbasi (NeurIPS, 2019)

Unconstrained submodular maximization with constant adaptive complexity. - Lin Chen 003; Moran Feldman; Amin Karbasi (STOC, 2019)

Heterogeneous Coexistence of Cognitive Radio Networks in TV White Space. - Kaigui Bian; Lin Chen 003; Yuanxing Zhang; Jung-Min Park 001; Xiaojiang Du; Xiaoming Li 001 (CoRR, 2019)

Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization. - Mingrui Zhang; Lin Chen 003; Aryan Mokhtari; Hamed Hassani; Amin Karbasi (CoRR, 2019)

Black Box Submodular Maximization: Discrete and Continuous Settings. - Lin Chen 003; Mingrui Zhang; Hamed Hassani; Amin Karbasi (AISTATS, 2020)

Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free. - Mingrui Zhang; Lin Chen 003; Aryan Mokhtari; Hamed Hassani; Amin Karbasi (AISTATS, 2020)

Preference-Aware Mask for Session-Based Recommendation with Bidirectional Transformer. - Yuanxing Zhang; Pengyu Zhao; Yushuo Guan; Lin Chen 003; Kaigui Bian; Lingyang Song; Bin Cui 001; Xiaoming Li 001 (ICASSP, 2020)

More Data Can Expand The Generalization Gap Between Adversarially Robust and Standard Models. - Lin Chen 003; Yifei Min; Mingrui Zhang; Amin Karbasi (ICML, 2020)

Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition. - Lin Chen 003; Qian Yu 001; Hannah Lawrence; Amin Karbasi (NeurIPS, 2020)

Meta Learning in the Continuous Time Limit. - Ruitu Xu; Lin Chen 003; Amin Karbasi (AISTATS, 2021)

Multiple Descent: Design Your Own Generalization Curve. - Lin Chen 003; Yifei Min; Mikhail Belkin; Amin Karbasi (NeurIPS, 2021)

The curious case of adversarially robust models: More data can help, double descend, or hurt generalization. - Yifei Min; Lin Chen 003; Amin Karbasi (UAI, 2021)