<h1>Wierman, Adam</h1> <h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Su, Yu and Anand, Vivek, el al. (2024) <a href="https://authors.library.caltech.edu/records/k8hxy-9h953">Learning-Augmented Energy-Aware List Scheduling for Precedence-Constrained Tasks</a>; ACM Transactions on Modeling and Performance Evaluation of Computing Systems; Vol. 9; No. 4; 1-24; <a href="https://doi.org/10.1145/3680278">10.1145/3680278</a></li> <li>Christianson, Nicolas and Sun, Bo, el al. (2024) <a href="https://authors.library.caltech.edu/records/xnbgh-ts917">Risk-Sensitive Online Algorithms</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 52; No. 2; 6-8; <a href="https://doi.org/10.1145/3695411.3695415">10.1145/3695411.3695415</a></li> <li>Yeh, Christopher and Yu, Jing, el al. (2024) <a href="https://authors.library.caltech.edu/records/7n6tw-r0s23">Online Learning for Robust Voltage Control Under Uncertain Grid Topology</a>; IEEE Transactions on Smart Grid; <a href="https://doi.org/10.1109/tsg.2024.3383804">10.1109/tsg.2024.3383804</a></li> <li>Feng, Jie and Shi, Yuanyuan, el al. (2023) <a href="https://authors.library.caltech.edu/records/v26v8-j6q25">Stability Constrained Reinforcement Learning for Decentralized Real-Time Voltage Control</a>; IEEE Transactions on Control of Network Systems; 1-12; <a href="https://doi.org/10.1109/tcns.2023.3338240">10.1109/tcns.2023.3338240</a></li> <li>Lechowicz, Adam and Christianson, Nicolas, el al. (2023) <a href="https://authors.library.caltech.edu/records/00as5-6gj35">The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 7; No. 3; 45; <a href="https://doi.org/10.1145/3626776">10.1145/3626776</a></li> <li>Qin, Junjie and Vardi, Shai, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230710-599244800.27">Minimization Fractional Prophet Inequalities for Sequential Procurement</a>; Mathematics of Operations Research; <a href="https://doi.org/10.1287/moor.2021.173">10.1287/moor.2021.173</a></li> <li>Shin, Sungho and Lin, Yiheng, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230613-731307200.40">Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems</a>; SIAM Journal on Control and Optimization; Vol. 61; No. 3; 1113-1135; <a href="https://doi.org/10.1137/22m1489836">10.1137/22m1489836</a></li> <li>Tseng, Shih-hao and Han, SooJean, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230327-854076000.4">Trading Throughput for Freshness: Freshness-aware Traffic Engineering and In-Network Freshness Control</a>; ACM Transactions on Modeling and Performance Evaluation of Computing Systems; Vol. 8; No. 1-2; Art. No. 4; <a href="https://doi.org/10.1145/3576919">10.1145/3576919</a></li> <li>Zhang, Yizhou and Qu, Guannan, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230316-87864000.2">Global Convergence of Localized Policy Iteration in Networked Multi-Agent Reinforcement Learning</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 7; No. 1; Art. No. 13; <a href="https://doi.org/10.1145/3579443">10.1145/3579443</a></li> <li>Yu, Jing and Ho, Dimitar, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230327-854092000.9">Online Adversarial Stabilization of Unknown Networked Systems</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 7; No. 1; Art. No. 26; <a href="https://doi.org/10.1145/3579452">10.1145/3579452</a></li> <li>Rutten, Daan and Christianson, Nicolas, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230316-86070000.1">Smoothed Online Optimization with Unreliable Predictions</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 7; No. 1; Art. No. 12; <a href="https://doi.org/10.1145/3579442">10.1145/3579442</a></li> <li>Chen, Yue and Zhao, Changhong, el al. (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230502-727238500.2">An Energy Sharing Mechanism Considering Network Constraints and Market Power Limitation</a>; IEEE Transactions on Smart Grid; Vol. 14; No. 2; 1027-1041; <a href="https://doi.org/10.1109/tsg.2022.3198721">10.1109/tsg.2022.3198721</a></li> <li>Sun, Bo and Yang, Lin, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230103-817548100.24">The Online Knapsack Problem with Departures</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 6; No. 3; 1-32; <a href="https://doi.org/10.1145/3570618">10.1145/3570618</a></li> <li>Christianson, Nicolas and Werner, Lucien, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221011-128968500.6">Dispatch-aware planning for feasible power system operation</a>; Electric Power Systems Research; Vol. 212; Art. No. 108597; <a href="https://doi.org/10.1016/j.epsr.2022.108597">10.1016/j.epsr.2022.108597</a></li> <li>Qu, Guannan and Wierman, Adam, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220914-591652300">Scalable Reinforcement Learning for Multiagent Networked Systems</a>; Operations Research; <a href="https://doi.org/10.1287/opre.2021.2226">10.1287/opre.2021.2226</a></li> <li>Christianson, Nicolas and Handina, Tinashe, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230316-231309617">Chasing Convex Bodies and Functions with Black-Box Advice</a>; Proceedings of Machine Learning Research; Vol. 178; 867-908</li> <li>Pang, John and Lin, Weixuan, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-105727708">Transparency and Control in Platforms for Networked Markets</a>; Operations Research; Vol. 70; No. 3; 1665-1690; <a href="https://doi.org/10.1287/opre.2021.2244">10.1287/opre.2021.2244</a></li> <li>Pan, Weici and Shi, Guanya, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220302-699021182">Online Optimization with Feedback Delay and Nonlinear Switching Cost</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 6; No. 1; Art. No. 17; <a href="https://doi.org/10.1145/3508037">10.1145/3508037</a></li> <li>Li, Tongxin and Yang, Ruixiao, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210716-225846876">Robustness and Consistency in Linear Quadratic Control with Untrusted Predictions</a>; Proceedings of the ACM on Measurement and Analysis of Computing System; Vol. 6; No. 1; Art. No. 18; <a href="https://doi.org/10.1145/3508038">10.1145/3508038</a></li> <li>Nakahira, Yorie and Ferragut, Andres, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201014-143948343">Generalized Exact Scheduling: A Minimal-Variance Distributed Deadline Scheduler</a>; Operations Research; <a href="https://doi.org/10.1287/opre.2021.2232">10.1287/opre.2021.2232</a></li> <li>Murray, Riley and Chandrasekaran, Venkat, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190627-102049940">Newton Polytopes and Relative Entropy Optimization</a>; Foundations of Computational Mathematics; Vol. 21; No. 6; 1703-1737; <a href="https://doi.org/10.1007/s10208-021-09497-w">10.1007/s10208-021-09497-w</a></li> <li>Li, Tongxin and Sun, Bo, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210510-084600512">Learning-based Predictive Control via Real-time Aggregate Flexibility</a>; IEEE Transactions on Smart Grid; Vol. 12; No. 6; 4897-4913; <a href="https://doi.org/10.1109/TSG.2021.3094719">10.1109/TSG.2021.3094719</a></li> <li>Guo, Linqi and Liang, Chen, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200707-101019648">Line Failure Localization of Power Networks Part I: Non-Cut Outages</a>; IEEE Transactions on Power Systems; Vol. 36; No. 5; 4140-4151; <a href="https://doi.org/10.1109/tpwrs.2021.3066336">10.1109/tpwrs.2021.3066336</a></li> <li>Guo, Linqi and Liang, Chen, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200707-095927831">Line Failure Localization of Power Networks Part II: Cut Set Outages</a>; IEEE Transactions on Power Systems; Vol. 36; No. 5; 4152-4160; <a href="https://doi.org/10.1109/TPWRS.2021.3068048">10.1109/TPWRS.2021.3068048</a></li> <li>Liao, Guocheng and Su, Yu, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220121-870642000">The Privacy Paradox and Optimal Bias-Variance Trade-offs in Data Acquisition</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 49; No. 2; 6-8; <a href="https://doi.org/10.1145/3512798.3512802">10.1145/3512798.3512802</a></li> <li>Li, Tongxin and Chen, Yue, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210604-111535691">Information Aggregation for Constrained Online Control</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 5; No. 2; Art. No. 18; <a href="https://doi.org/10.1145/3460085">10.1145/3460085</a></li> <li>Murray, Riley and Chandrasekaran, Venkat, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201014-133741550">Signomial and polynomial optimization via relative entropy and partial dualization</a>; Mathematical Programming Computation; Vol. 13; No. 2; 257-295; <a href="https://doi.org/10.1007/s12532-020-00193-4">10.1007/s12532-020-00193-4</a></li> <li>Qu, Guannan and Shi, Yuanyuan, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210510-092451106">Stable Online Control of Linear Time-Varying Systems</a>; Proceedings of Machine Learning Research; Vol. 144; 742-753; <a href="https://doi.org/10.48550/arXiv.2104.14134">10.48550/arXiv.2104.14134</a></li> <li>Zhou, Xingyu and Shroff, Ness, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200526-152856053">Asymptotically optimal load balancing in large-scale heterogeneous systems with multiple dispatchers</a>; Performance Evaluation; Vol. 145; Art. No. 102146; <a href="https://doi.org/10.1016/j.peva.2020.102146">10.1016/j.peva.2020.102146</a></li> <li>Liang, Chen and Guo, Linqi, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200707-103725840">An integrated approach for failure mitigation & localization in power systems</a>; Electric Power Systems Research; Vol. 190; Art. No. 106613; <a href="https://doi.org/10.48550/arXiv.2004.10401">10.48550/arXiv.2004.10401</a></li> <li>Zhou, Xingyu and Shroff, Ness, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210308-133521968">Asymptotically Optimal Load Balancing in Large-scale Heterogeneous Systems with Multiple Dispatchers</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 48; No. 3; 57-58; <a href="https://doi.org/10.1145/3453953.3453965">10.1145/3453953.3453965</a></li> <li>Fang, Zhixuan and Huang, Longbo, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200511-124909341">Loyalty programs in the sharing economy: Optimality and competition</a>; Performance Evaluation; Vol. 143; Art. No. 102105; <a href="https://doi.org/10.1016/j.peva.2020.102105">10.1016/j.peva.2020.102105</a></li> <li>Sun, Bo and Zeynali, Ali, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201014-142839691">Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 4; No. 3; Art. No. 51; <a href="https://doi.org/10.1145/3428336">10.1145/3428336</a></li> <li>Scully, Ziv and van Kreveld, Lucas, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200511-093940097">Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 4; No. 2; Art. No. 30; <a href="https://doi.org/10.1145/3392148">10.1145/3392148</a></li> <li>London, Palma and Vardi, Shai, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200709-141943501">Logarithmic Communication for Distributed Optimization in Multi-Agent Systems</a>; ISBN 9781450379854; ACM SIGMETRICS Performance Evaluation Review; Vol. 48; No. 1; 97-98; <a href="https://doi.org/10.1145/3393691.3394197">10.1145/3393691.3394197</a></li> <li>Cai, Yang and Echenique, Federico, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200709-084932341">Third-Party Data Providers Ruin Simple Mechanisms</a>; ISBN 9781450379854; SIGMETRICS '20 Abstracts; ACM SIGMETRICS Performance Evaluation Review; Vol. 48; No. 1; 103; <a href="https://doi.org/10.1145/3410048.3410108">10.1145/3410048.3410108</a></li> <li>Scully, Ziv and van Kreveld, Lucas, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210303-094800346">Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes</a>; ISBN 9781450379854; Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems; ACM SIGMETRICS Performance Evaluation Review; Vol. 48; No. 1; 35-36; <a href="https://doi.org/10.1145/3393691.3394179">10.1145/3393691.3394179</a></li> <li>Lin, Yiheng and Goel, Gautam, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200709-141107614">Online Optimization with Predictions and Non-convex Losses</a>; ISBN 9781450379854; ACM SIGMETRICS Performance Evaluation Review; Vol. 48; No. 1; 9-10; <a href="https://doi.org/10.1145/3393691.3394208">10.1145/3393691.3394208</a></li> <li>Cai, Yang and Echenique, Federico, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-155536214">Third-Party Data Providers Ruin Simple Mechanisms</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 4; No. 1; Art. No. 12; <a href="https://doi.org/10.1145/3379478">10.1145/3379478</a></li> <li>Lin, Yiheng and Goel, Gautam, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200214-105548481">Online Optimization with Predictions and Non-convex Losses</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 4; No. 1; Art. No. 18; <a href="https://doi.org/10.1145/3379484">10.1145/3379484</a></li> <li>Azizan, Navid and Su, Yu, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200409-070410121">Optimal Pricing in Markets with Nonconvex Costs</a>; Operations Research; Vol. 68; No. 2; 480-496; <a href="https://doi.org/10.1287/opre.2019.1900">10.1287/opre.2019.1900</a></li> <li>Yang, Lin and Hajiesmaili, Mohammad H., el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-143029409">Online Linear Optimization with Inventory Management Constraints</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 4; No. 1; Art. No. 16; <a href="https://doi.org/10.1145/3379482">10.1145/3379482</a></li> <li>Cai, Desmond and Agarwal, Anish, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190627-131545662">On the Inefficiency of Forward Markets in Leader-Follower Competition</a>; Operations Research; Vol. 68; No. 1; 35-52; <a href="https://doi.org/10.1287/opre.2019.1863">10.1287/opre.2019.1863</a></li> <li>Fang, Zhixuan and Huang, Longbo, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190826-092413079">Prices and subsidies in the sharing economy</a>; Performance Evaluation; Vol. 136; Art. No. 102037; <a href="https://doi.org/10.1016/j.peva.2019.102037">10.1016/j.peva.2019.102037</a></li> <li>London, Palma and Vardi, Shai, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191218-160307829">Logarithmic Communication for Distributed Optimization in Multi-Agent Systems</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 3; No. 3; Art. No. 48; <a href="https://doi.org/10.1145/3366696">10.1145/3366696</a></li> <li>Goel, Gautam and Wierman, Adam (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191205-111324876">An Online Algorithm for Smoothed Online Convex Optimization</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 47; No. 2; 6-8; <a href="https://doi.org/10.1145/3374888.3374892">10.1145/3374888.3374892</a></li> <li>Su, Yu and Ren, Xiaoqi, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191205-110845019">Communication-Aware Scheduling of Precedence-Constrained Tasks</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 47; No. 2; 21-23; <a href="https://doi.org/10.1145/3374888.3374897">10.1145/3374888.3374897</a></li> <li>Cai, Desmond and Bose, Subhonmesh, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190905-100922515">On the Role of a Market Maker in Networked Cournot Competition</a>; Mathematics of Operations Research; Vol. 44; No. 3; 1122-1144; <a href="https://doi.org/10.1287/moor.2018.0961">10.1287/moor.2018.0961</a></li> <li>Lin, Qiulin and Yi, Hanling, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191218-160755746">Competitive Online Optimization under Inventory Constraints</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 47; No. 1; 35-36; <a href="https://doi.org/10.1145/3309697.3331495">10.1145/3309697.3331495</a></li> <li>Goel, Gautam and Wierman, Adam (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-160602759">An Online Algorithm for Smoothed Regression and LQR Control</a>; Proceedings of Machine Learning Research; Vol. 89; 2504-2513; <a href="https://doi.org/10.48550/arXiv.1810.10132">10.48550/arXiv.1810.10132</a></li> <li>Lin, Qiulin and Yi, Hanling, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190326-093440485">Competitive Online Optimization under Inventory Constraints</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 3; No. 1; Art. No. 10; <a href="https://doi.org/10.1145/3322205.3311081">10.1145/3322205.3311081</a></li> <li>Nakahira, Yorie and Ferragut, Andres, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190128-091502098">Minimal-Variance Distributed Deadline Scheduling in a Stationary Environment</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 46; No. 3; 56-61; <a href="https://doi.org/10.1145/3308897.3308925">10.1145/3308897.3308925</a></li> <li>Azizan Ruhi, Navid and Dvijotham, Krishnamurthy, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170524-171255595">Opportunities for Price Manipulation by Aggregators in Electricity Markets</a>; IEEE Transactions on Smart Grid; Vol. 9; No. 6; 5687-5698; <a href="https://doi.org/10.1109/TSG.2017.2694043">10.1109/TSG.2017.2694043</a></li> <li>Guo, Linqi and Liang, Chen, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190128-094206311">Failure Localization in Power Systems via Tree Partitions</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 46; No. 2; 57-61; <a href="https://doi.org/10.1145/3305218.3305240">10.1145/3305218.3305240</a></li> <li>Guo, Linqi and Liang, Chen, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190128-124902110">Failure Localization in Power Systems via Tree Partitions</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 46; No. 2; 79-80; <a href="https://doi.org/10.1145/3305218.3305247">10.1145/3305218.3305247</a></li> <li>Nakahira, Yorie and Ferragut, Andres, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190125-161222101">Minimal-variance distributed scheduling under strict demands and deadlines</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 46; No. 2; 12-14; <a href="https://doi.org/10.1145/3305218.3305224">10.1145/3305218.3305224</a></li> <li>Qin, Junjie and Rajagopal, Ram, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190128-080449154">Convex Prophet Inequalities</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 46; No. 2; 39-41; <a href="https://doi.org/10.1145/3305218.3305233">10.1145/3305218.3305233</a></li> <li>Qin, Junjie and Rajagopal, Ram, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190128-125707935">Convex Prophet Inequalities</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 46; No. 2; 85-86; <a href="https://doi.org/10.1145/3305218.3305250">10.1145/3305218.3305250</a></li> <li>Wierman, Adam and Akella, Aditya (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180618-151602165">Message from the Editors</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 2; No. 2; Art. No. 23; <a href="https://doi.org/10.1145/3224418">10.1145/3224418</a></li> <li>Nair, Jayakrishnan and Subramanian, Vijay, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180404-093242290">Provisioning of ad-supported cloud services: The role of competition</a>; Performance Evaluation; Vol. 120; 36-48; <a href="https://doi.org/10.1016/j.peva.2018.01.001">10.1016/j.peva.2018.01.001</a></li> <li>Ren, Xiaoqi and London, Palma, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180323-104121108">Datum: Managing Data Purchasing and Data Placement in a Geo-Distributed Data Market</a>; IEEE/ACM Transactions on Networking; Vol. 26; No. 2; 893-905; <a href="https://doi.org/10.1109/TNET.2018.2811374">10.1109/TNET.2018.2811374</a></li> <li>Anselmi, Jonatha and Ardagna, Danilo, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180409-162521250">The Economics of the Cloud</a>; ACM Transactions on Modeling and Performance Evaluation of Computing Systems; Vol. 2; No. 4; Art. No. 18; <a href="https://doi.org/10.1145/3086574">10.1145/3086574</a></li> <li>Cai, Desmond and Mallada, Enrique, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170315-153413222">Distributed optimization decomposition for joint economic dispatch and frequency regulation</a>; IEEE Transactions on Power Systems; Vol. 32; No. 6; 4370-4385; <a href="https://doi.org/10.1109/TPWRS.2017.2682235">10.1109/TPWRS.2017.2682235</a></li> <li>Lin, Weixuan and Pang, John Z. F., el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180409-162520446">Networked Cournot Competition in Platform Markets: Access Control and Efficiency Loss</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 45; No. 2; 15-17; <a href="https://doi.org/10.1145/3152042.3152048">10.1145/3152042.3152048</a></li> <li>Goel, Gautam and Chen, Niangjun, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180409-162520743">Thinking Fast and Slow: Optimization Decomposition Across Timescales</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 45; No. 2; 27-29; <a href="https://doi.org/10.1145/3152042.3152052">10.1145/3152042.3152052</a></li> <li>London, Palma and Chen, Niangjun, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180409-162519917">Distributed Optimization via Local Computation Algorithms</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 45; No. 2; 30-32; <a href="https://doi.org/10.1145/3152042.3152053">10.1145/3152042.3152053</a></li> <li>Islam, Mohammad A. and Ren, Shaolei, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180409-162520179">A First Look at Power Attacks in Multi-Tenant Data Centers</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 45; No. 2; 91-93; <a href="https://doi.org/10.1145/3152042.3152070">10.1145/3152042.3152070</a></li> <li>Ferragut, Andres and Paganini, Fernando, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170814-150846810">Controlling the Variability of Capacity Allocations Using Service Deferrals</a>; ACM Transactions on Modeling and Performance Evaluation of Computing Systems; Vol. 2; No. 3; Art. No. 15; <a href="https://doi.org/10.1145/3086506">10.1145/3086506</a></li> <li>Ghamkhari, Mahdi and Wierman, Adam, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160906-111711386">Energy Portfolio Optimization of Data Centers</a>; IEEE Transactions on Smart Grid; Vol. 8; No. 4; 1898-1910; <a href="https://doi.org/10.1109/TSG.2015.2510428">10.1109/TSG.2015.2510428</a></li> <li>Azizan Ruhi, Navid and Chen, Niangjun, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160630-135555342">Opportunities for Price Manipulation by Aggregators in Electricity Markets</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 44; No. 2; 49-51; <a href="https://doi.org/10.1145/3003977.3003995">10.1145/3003977.3003995</a></li> <li>Gopalakrishnan, Ragavendran and Doroudi, Sherwin, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160915-085435818">Routing and Staffing When Servers Are Strategic</a>; Operations Research; Vol. 64; No. 4; 1033-1050; <a href="https://doi.org/10.1287/opre.2016.1506">10.1287/opre.2016.1506</a></li> <li>Chen, Niangjun and Comden, Joshua, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170110-154433095">Using Predictions in Online Optimization: Looking Forward with an Eye on the Past</a>; ISBN 978-1-4503-4266-7; SIGMETRICS '16 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science; ACM SIGMETRICS Performance Evaluation Review; Vol. 44; No. 1; 193-206; <a href="https://doi.org/10.1145/2964791.2901464">10.1145/2964791.2901464</a></li> <li>Nair, Jayakrishnan and Wierman, Adam, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160701-073920780">Provisioning of Large-Scale Systems: The Interplay Between Network Effects and Strategic Behavior in the User Base</a>; Management Science; Vol. 62; No. 6; 1830-1841; <a href="https://doi.org/10.1287/mnsc.2015.2210">10.1287/mnsc.2015.2210</a></li> <li>Nair, Jayakrishnan and Jagannathan, Krishna, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160527-135934012">When Heavy-Tailed and Light-Tailed Flows Compete: The Response Time Tail Under Generalized Max-Weight Scheduling</a>; IEEE/ACM Transactions on Networking; Vol. 24; No. 2; 982-995; <a href="https://doi.org/10.1109/TNET.2015.2415874">10.1109/TNET.2015.2415874</a></li> <li>Cummings, Rachel and Echenique, Federico, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160602-090011567">The Empirical Implications of Privacy-Aware Choice</a>; Operations Research; Vol. 64; No. 1; 67-78; <a href="https://doi.org/10.1287/opre.2015.1458">10.1287/opre.2015.1458</a></li> <li>Ren, Xiaoqi and Ananthanarayanan, Ganesh, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161213-150643278">Hopper: Decentralized Speculation-aware Cluster Scheduling at Scale</a>; ACM SIGCOMM Computer Communication Review; Vol. 45; No. 4; 379-392; <a href="https://doi.org/10.1145/2829988.2787481">10.1145/2829988.2787481</a></li> <li>Chen, Niangjun and Ren, Xiaoqi, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151015-080757078">Greening multi-tenant data center demand response</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 43; No. 2; 36-38; <a href="https://doi.org/10.1145/2825236.2825252">10.1145/2825236.2825252</a></li> <li>Chen, Niangjun and Ren, Xiaoqi, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150924-103805864">Greening multi-tenant data center demand response</a>; Performance Evaluation; Vol. 91; 229-254; <a href="https://doi.org/10.1016/j.peva.2015.06.014">10.1016/j.peva.2015.06.014</a></li> <li>Bose, Subhonmesh and Wu, Chenye, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150821-103411487">A Unifying Market Power Measure for Deregulated Transmission-Constrained Electricity Markets</a>; IEEE Transactions on Power Systems; Vol. 30; No. 5; 2338-2348; <a href="https://doi.org/10.1109/TPWRS.2014.2360216">10.1109/TPWRS.2014.2360216</a></li> <li>Ren, Xiaoqi and Ananthanarayanan, Ganesh, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151015-074525793">Speculation-aware Cluster Scheduling</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 43; No. 2; 42-44; <a href="https://doi.org/10.1145/2825236.2825254">10.1145/2825236.2825254</a></li> <li>Chen, Niangjun and Agarwal, Anish, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160823-104652452">Online Convex Optimization Using Predictions</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 43; No. 1; 191-204; <a href="https://doi.org/10.1145/2796314.2745854">10.1145/2796314.2745854</a></li> <li>Wang, Kai and Lin, Minghong, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150423-142020594">Characterizing the impact of the workload on the value of dynamic resizing in data centers</a>; Performance Evaluation; Vol. 85-86; 1-18; <a href="https://doi.org/10.1016/j.peva.2014.12.001">10.1016/j.peva.2014.12.001</a></li> <li>Gopalakrishnan, Ragavendran and Marden, Jason R., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150108-102735345">Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games</a>; Mathematics of Operations Research; Vol. 39; No. 4; 1252-1296; <a href="https://doi.org/10.1287/moor.2014.0651">10.1287/moor.2014.0651</a></li> <li>Courcoubetis, Costas and Guérin, Roch, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141204-160518575">Special Issue on Pricing and Incentives in Networks and Systems: Guest Editors' Introduction</a>; ACM Transactions on Internet Technology; Vol. 14; No. 2-3; Art. No. 8; <a href="https://doi.org/10.1145/2665064">10.1145/2665064</a></li> <li>Nair, Jayakrishnan and Subramanian, Vijay G., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140917-082453194">On competitive provisioning of cloud services</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 42; No. 2; 30-32; <a href="https://doi.org/10.1145/2667522.2667531">10.1145/2667522.2667531</a></li> <li>Anselmi, Jonatha and Ardagna, Danilo, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150109-074030107">The Economics of the Cloud: Price Competition and Congestion</a>; ACM SIGecom Exchanges; Vol. 13; No. 1; 58-63; <a href="https://doi.org/10.1145/2692375.2692380">10.1145/2692375.2692380</a></li> <li>Liu, Zhenhua and Liu, Iris, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140804-133949957">Pricing Data Center Demand Response</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 42; No. 1; 111-123; <a href="https://doi.org/10.1145/2591971.2592004">10.1145/2591971.2592004</a></li> <li>Nair, Jayakrishnan and Adlakha, Sachin, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140804-132430669">Energy Procurement Strategies in the Presence of Intermittent Sources</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 42; No. 1; 85-97; <a href="https://doi.org/10.1145/2591971.2591982">10.1145/2591971.2591982</a></li> <li>Liu, Zhenhua and Lin, Minghong, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150112-084413455">Greening Geographical Load Balancing</a>; IEEE/ACM Transactions on Networking; Vol. 23; No. 2; 657-671; <a href="https://doi.org/10.1109/TNET.2014.2308295">10.1109/TNET.2014.2308295</a></li> <li>Lin, Minghong and Zhang, Li, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140730-162927910">Joint Optimization of Overlapping Phases in MapReduce</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 41; No. 3; 16-18; <a href="https://doi.org/10.1145/2567529.2567534">10.1145/2567529.2567534</a></li> <li>Lin, Minghong and Wierman, Adam, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140221-092537914">Dynamic Right-Sizing for Power-Proportional Data Centers</a>; IEEE/ACM Transactions on Networking; Vol. 21; No. 5; 1378-1391; <a href="https://doi.org/10.1109/TNET.2012.2226216">10.1109/TNET.2012.2226216</a></li> <li>Liu, Zhenhua and Wierman, Adam, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131114-120720977">Data center demand response: Avoiding the coincident peak via workload shifting and local generation</a>; Performance Evaluation; Vol. 70; No. 10; 770-791; <a href="https://doi.org/10.1016/j.peva.2013.08.014">10.1016/j.peva.2013.08.014</a></li> <li>Lin, Minghong and Zhang, Li, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130930-120231815">Joint Optimization of Overlapping Phases in MapReduce</a>; Performance Evaluation; Vol. 70; No. 10; 720-735; <a href="https://doi.org/10.1016/j.peva.2013.08.013">10.1016/j.peva.2013.08.013</a></li> <li>Liu, Zhenhua and Wierman, Adam, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161128-165016440">Data center demand response: avoiding the coincident peak via workload shifting and local generation</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 41; No. 4; 341-342; <a href="https://doi.org/10.1145/2494232.2465740">10.1145/2494232.2465740</a></li> <li>Nair, Jayakrishnan and Wierman, Adam, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161206-160007274">The Fundamentals of Heavy-tails: Properties, Emergence, and Identification</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 41; No. 1; 387; <a href="https://doi.org/10.1145/2494232.2466587">10.1145/2494232.2466587</a></li> <li>Andrew, Lachlan and Barman, Siddharth, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160420-130614870">A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 41; No. 1; 329-330; <a href="https://doi.org/10.1145/2494232.2465533">10.1145/2494232.2465533</a></li> <li>Marden, Jason R. and Wierman, Adam (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130718-111911401">Overcoming the Limitations of Utility Design for Multiagent Systems</a>; IEEE Transactions on Automatic Control; Vol. 58; No. 6; 1402-1415; <a href="https://doi.org/10.1109/TAC.2013.2237831">10.1109/TAC.2013.2237831</a></li> <li>Marden, Jason R. and Wierman, Adam (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130411-094140621">Distributed Welfare Games</a>; Operations Research; Vol. 61; No. 1; 155-168; <a href="https://doi.org/10.1287/opre.1120.1137">10.1287/opre.1120.1137</a></li> <li>Wierman, Adam and Andrew, Lachlan L. H., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121214-152442054">Power-aware speed scaling in processor sharing systems: Optimality and robustness</a>; Performance Evaluation; Vol. 69; No. 12; 601-622; <a href="https://doi.org/10.1016/j.peva.2012.07.002">10.1016/j.peva.2012.07.002</a></li> <li>Lin, Minghong and Wierman, Adam, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161122-155941033">Online optimization with switching cost</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 40; No. 3; 98-100; <a href="https://doi.org/10.1145/2425248.2425275">10.1145/2425248.2425275</a></li> <li>Wierman, Adam and Zwart, Bert (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121221-104528945">Is Tail-Optimal Scheduling Possible?</a>; Operations Research; Vol. 60; No. 5; 1249-1257; <a href="https://doi.org/10.1287/opre.1120.1086">10.1287/opre.1120.1086</a></li> <li>Liu, Zhenhua and Cheng, Yuan, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130108-115043744">Renewable and Cooling Aware Workload Management for Sustainable Data Centers</a>; ISBN 978-1-4503-1097-0; Proceedings of the 12th ACM Sigmetrics/Performance joint international conference on Measurement and Modeling of Computer Systems; ACM SIGMETRICS Performance Evaluation Review; Vol. 40; No. 1; 175-186; <a href="https://doi.org/10.1145/2318857.2254779">10.1145/2318857.2254779</a></li> <li>Wang, Kai and Lin, Minghong, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130109-085806826">Characterizing the Impact of the Workload on the Value of Dynamic Resizing in Data Centers</a>; Performance Evaluation Review; Vol. 40; No. 1; 405-406; <a href="https://doi.org/10.1145/2318857.2254815">10.1145/2318857.2254815</a></li> <li>van Wijk, A. C. C. and Adan, I. J. B. F., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120705-102059217">Fairness and efficiency for polling models with the κ-gated service discipline</a>; Performance Evaluation; Vol. 69; No. 6; 274-288; <a href="https://doi.org/10.1016/j.peva.2012.02.003">10.1016/j.peva.2012.02.003</a></li> <li>Yang, Changwoo and Wierman, Adam, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120326-084346980">Many Flows Asymptotics for SMART Scheduling Policies</a>; IEEE Transactions on Automatic Control; Vol. 57; No. 2; 376-391; <a href="https://doi.org/10.1109/TAC.2011.2173418">10.1109/TAC.2011.2173418</a></li> <li>Doroudi, Sherwin and Gopalakrishnan, Ragavendran, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120521-101935284">Dispatching to incentivize fast service in multi-server queues</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 39; No. 3; 43-45; <a href="https://doi.org/10.1145/2160803.2160855">10.1145/2160803.2160855</a></li> <li>Liu, Zhenhua and Lin, Minghong, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161128-151114708">Geographical load balancing with renewables</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 39; No. 3; 62-66; <a href="https://doi.org/10.1145/2160803.2160862">10.1145/2160803.2160862</a></li> <li>Anselmi, Jonatha and Ayesta, Urtzi, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111128-101928328">Competition yields efficiency in load balancing games</a>; Performance Evaluation; Vol. 68; No. 11; 986-1001; <a href="https://doi.org/10.1016/j.peva.2011.07.005">10.1016/j.peva.2011.07.005</a></li> <li>Lin, Minghong and Wierman, Adam, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111025-080010192">Heavy-traffic analysis of mean response time under Shortest Remaining Processing Time</a>; Performance Evaluation; Vol. 68; No. 10; 955-966; <a href="https://doi.org/10.1016/j.peva.2011.06.001">10.1016/j.peva.2011.06.001</a></li> <li>Nair, Jayakrishnan and Wierman, Adam, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120521-092530952">Exploiting network effects in the provisioning of large scale systems</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 39; No. 2; 26-28; <a href="https://doi.org/10.1145/2034832.2034837">10.1145/2034832.2034837</a></li> <li>Liu, Zhenhua and Lin, Minghong, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161128-151734850">Greening geographical load balancing</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 39; No. 1; 193-204</li> <li>Echenique, Federico and Golovin, Daniel, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160321-131503486">Complexity and economics: computational constraints may not matter empirically</a>; ACM SIGecom Exchanges; Vol. 10; No. 1; 2-5; <a href="https://doi.org/10.1145/1978721.1978722">10.1145/1978721.1978722</a></li> <li>Gopalakrishnan, Ragavendran and Marden, Jason R., el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120521-093604505">An architectural view of game theoretic control</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 38; No. 3; 31-36; <a href="https://doi.org/10.1145/1925019.1925026">10.1145/1925019.1925026</a></li> <li>Nair, Jayakrishnan and Wierman, Adam, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101124-110928510">Tail-robust scheduling via limited processor sharing</a>; Performance Evaluation; Vol. 67; No. 11; 978-995; <a href="https://doi.org/10.1016/j.peva.2010.08.012">10.1016/j.peva.2010.08.012</a></li> <li>Lin, Minghong and Wierman, Adam, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161122-162740344">The Average Response Time in a Heavy-traffic SRPT Queue</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 38; No. 2; 12-14; <a href="https://doi.org/10.1145/1870178.1870183">10.1145/1870178.1870183</a></li> <li>Bodine-Baron, Elizabeth and Hassibi, Babak, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101025-094230043">Distance-Dependent Kronecker Graphs for Modeling Social Networks</a>; IEEE Journal of Selected Topics in Signal Processing; Vol. 4; No. 4; 718-731; <a href="https://doi.org/10.1109/JSTSP.2010.2049412">10.1109/JSTSP.2010.2049412</a></li> <li>Andrew, Lachlan L. H. and Lin, Minghong, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160420-131334648">Optimality, fairness, and robustness in speed scaling designs</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 38; No. 1; 37-48; <a href="https://doi.org/10.1145/1811099.1811044">10.1145/1811099.1811044</a></li> <li>Andrew, Lachlan L. H. and Wierman, Adam, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160420-132610613">Optimal speed scaling under arbitrary power functions</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 37; No. 2; 39-41; <a href="https://doi.org/10.1145/1639562.1639576">10.1145/1639562.1639576</a></li> <li>Chen, Ho-Lin and Marden, Jason R., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160819-110902462">The effect of local scheduling in load balancing designs</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 36; No. 2; 110-112; <a href="https://doi.org/10.1145/1453175.1453200">10.1145/1453175.1453200</a></li> <li>Wierman, Adam and Nuyens, Misja (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170105-110703130">Scheduling despite inexact job-size information</a>; ISBN 978-1-60558-005-0; SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems; ACM SIGMETRICS Performance Evaluation Review; Vol. 36; No. 1; 25-36; <a href="https://doi.org/10.1145/384529.1375461">10.1145/384529.1375461</a></li> <li>Nuyens, Misja and Wierman, Adam, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170408-151537902">Preventing Large Sojourn Times Using SMART Scheduling</a>; Operations Research; Vol. 56; No. 1; 88-101; <a href="https://doi.org/10.1287/opre.1070.0504">10.1287/opre.1070.0504</a></li> <li>Wierman, Adam and Winands, Erik M.M., el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100506-110944543">Scheduling in polling systems</a>; Performance Evaluation; Vol. 64; No. 9-12; 1009-1028; <a href="https://doi.org/10.1016/j.peva.2007.06.015">10.1016/j.peva.2007.06.015</a></li> <li>Wierman, Adam (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201104-083857037">Fairness and classifications</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 34; No. 4; 4-12; <a href="https://doi.org/10.1145/1243401.1243405">10.1145/1243401.1243405</a></li> <li>Wierman, Adam (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201104-085827475">On the effect of inexact size information in size based policies</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 34; No. 3; 21-23; <a href="https://doi.org/10.1145/1215956.1215966">10.1145/1215956.1215966</a></li> <li>Wierman, Adam and Osogami, Takayuki, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201020-075618304">How many servers are best in a dual-priority system?</a>; Performance Evaluation; Vol. 63; No. 12; 1253-1272; <a href="https://doi.org/10.1016/j.peva.2005.12.004">10.1016/j.peva.2005.12.004</a></li> <li>Harchol-Balter, Mor and Osogami, Takayuki, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200810-134515351">Multi-Server queueing systems with multiple priority classes</a>; Queueing Systems; Vol. 51; No. 3-4; 331-360; <a href="https://doi.org/10.1007/s11134-005-2898-7">10.1007/s11134-005-2898-7</a></li> <li>Wierman, Adam and Harchol-Balter, Mor, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210310-083932675">Nearly insensitive bounds on SMART scheduling</a>; ISBN 1595930221; Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems; ACM SIGMETRICS Performance Evaluation Review; Vol. 33; No. 1; 205-216; <a href="https://doi.org/10.1145/1064212.1064236">10.1145/1064212.1064236</a></li> <li>Wierman, Adam and Harchol-Balter, Mor (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210310-083407671">Classifying scheduling policies with respect to higher moments of conditional response time</a>; ISBN 1595930221; Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems; ACM SIGMETRICS Performance Evaluation Review; Vol. 33; No. 1; 229-240; <a href="https://doi.org/10.1145/1064212.1064238">10.1145/1064212.1064238</a></li> <li>Osogami, Takayuki and Wierman, Adam, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201104-094617374">A recursive analysis technique for multi-dimensionally infinite Markov chains</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 32; No. 2; 3-5; <a href="https://doi.org/10.1145/1035334.1035337">10.1145/1035334.1035337</a></li> <li>Wierman, Adam and Salzman, Julia, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201020-083144033">An improved upper bound for the pebbling threshold of the n-path</a>; Discrete Mathematics; Vol. 275; No. 1-3; 367-373; <a href="https://doi.org/10.1016/j.disc.2002.10.001">10.1016/j.disc.2002.10.001</a></li> <li>Wierman, Adam and Bansal, Nikhil, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200729-101550519">A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues</a>; Operations Research Letters; Vol. 32; No. 1; 73-76; <a href="https://doi.org/10.1016/s0167-6377(03)00061-0">10.1016/s0167-6377(03)00061-0</a></li> <li>Wierman, Adam and Osogami, Takayuki, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201104-094050639">Modeling TCP-vegas under on/off traffic</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 31; No. 2; 6-8; <a href="https://doi.org/10.1145/959143.959146">10.1145/959143.959146</a></li> <li>Wierman, Adam and Harchol-Balter, Mor (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201104-093530569">Classifying scheduling policies with respect to unfairness in an M/GI/1</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 31; No. 1; 238-249; <a href="https://doi.org/10.1145/885651.781057">10.1145/885651.781057</a></li> <li>Harchol-Balter, Mor and Sigman, Karl, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201104-093156865">Understanding the slowdown of large jobs in an M/GI/1 system</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 30; No. 3; 9-11; <a href="https://doi.org/10.1145/605521.605526">10.1145/605521.605526</a></li> <li>Harchol-Balter, Mor and Sigman, Karl, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201020-074935944">Asymptotic convergence of scheduling policies with respect to slowdown</a>; Performance Evaluation; Vol. 49; No. 1-4; 241-256; <a href="https://doi.org/10.1016/s0166-5316(02)00132-3">10.1016/s0166-5316(02)00132-3</a></li> </ul>