Visual Searching and Mapping. - Bala Kalyanasundaram; Kirk Pruhs (On-Line Algorithms, 1991)

On-Line Weighted Matching. - Bala Kalyanasundaram; Kirk Pruhs (SODA, 1991)

The Complexity of Controlled Selection - Kirk Pruhs; Udi Manber (Inf. Comput., 1991)

A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). - Bala Kalyanasundaram; Kirk Pruhs (STACS, 1992)

Online Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (WADS, 1993)

A Competitive Analysis of Algorithms for Searching Unknown Scenes. - Bala Kalyanasundaram; Kirk Pruhs (Comput. Geom., 1993)

Online Weighted Matching. - Bala Kalyanasundaram; Kirk Pruhs (J. Algorithms, 1993)

The SPIN-OUT puzzle. - Kirk Pruhs (ACM SIGCSE Bull., 1993)

Average-Case Scalable On-Line Algorithms for Fault Replacement. - Kirk Pruhs (Inf. Process. Lett., 1994)

Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. - Vineet Bafna; Bala Kalyanasundaram; Kirk Pruhs (Theor. Comput. Sci., 1994)

Constructing Competitive Tours from Local Information. - Bala Kalyanasundaram; Kirk Pruhs (Theor. Comput. Sci., 1994)

Using Local Adaptations to Reconfigure a Spanning Tree of a Network. - Kirk Pruhs (Discret. Appl. Math., 1995)

On-line Network Optimization Problems. - Bala Kalyanasundaram; Kirk Pruhs (Online Algorithms, 1996)

On-Line Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (J. Algorithms, 1997)

How to design dynamic programming algorithms sans recursion. - Kirk Pruhs (SIGACT News, 1998)

Scheduling Broadcasts in Wireless Networks. - Bala Kalyanasundaram; Kirk Pruhs; Mahendran Velauthapillai (ESA, 2000)

Dynamic Spectrum Allocation: The Impotency of Duration Notification. - Bala Kalyanasundaram; Kirk Pruhs (FSTTCS, 2000)

Fault-Tolerant Real-Time Scheduling. - Bala Kalyanasundaram; Kirk Pruhs (Algorithmica, 2000)

Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. - Bala Kalyanasundaram; Kirk Pruhs; Eric Torng (Algorithmica, 2000)

Speed is as powerful as clairvoyance. - Bala Kalyanasundaram; Kirk Pruhs (J. ACM, 2000)

The Online Transportation Problem. - Bala Kalyanasundaram; Kirk Pruhs (SIAM J. Discret. Math., 2000)

An optimal deterministic algorithm for online b-matching. - Bala Kalyanasundaram; Kirk Pruhs (Theor. Comput. Sci., 2000)

Better client OFF time prediction to improve performance in web information systems. - Alan Berfield; Bill Simons; Panos K. Chrysanthis; Kirk Pruhs (WIDM, 2001)

Eliminating Migration in Multi-processor Scheduling. - Bala Kalyanasundaram; Kirk Pruhs (J. Algorithms, 2001)

Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. - Kirk Pruhs; Eric Wiewiora (ALENEX, 2002)

Broadcast scheduling: when fairness is fine. - Jeff Edmonds; Kirk Pruhs (SODA, 2002)

Caching for Web Searching. - Bala Kalyanasundaram; John Noga; Kirk Pruhs; Gerhard J. Woeginger (Algorithmica, 2002)

An Optimized Multicast-based Data Dissemination Middleware. - Wei Li; Wenhui Zhang 002; Vincenzo Liberatore; Vince Penkrot; Jonathan Beaver; Mohamed A. Sharaf; Siddhartha Roychowdhury; Panos K. Chrysanthis; Kirk Pruhs (ICDE, 2003)

Server scheduling in the Lp norm: a rising tide lifts all boat. - Nikhil Bansal 001; Kirk Pruhs (STOC, 2003)

Middleware Support for Multicast-based Data Dissemination: A Working Reality. - Panos K. Chrysanthis; Vincenzo Liberatore; Kirk Pruhs (WORDS, 2003)

Multicast Pull Scheduling: When Fairness Is Fine. - Jeff Edmonds; Kirk Pruhs (Algorithmica, 2003)

Minimizing flow time nonclairvoyantly. - Bala Kalyanasundaram; Kirk Pruhs (J. ACM, 2003)

Maximizing job completions online. - Bala Kalyanasundaram; Kirk Pruhs (J. Algorithms, 2003)

Foreword. - Kirk Pruhs (J. Algorithms, 2003)

Dedication. - Kirk Pruhs (J. Sched., 2003)

Editorial: Special Issue on On-line Scheduling. - Kirk Pruhs; Bala Kalyanasundaram (J. Sched., 2003)

Dynamic Speed Scaling to Manage Energy and Temperature. - Nikhil Bansal 001; Tracy Kimbrel; Kirk Pruhs (FOCS, 2004)

Server Scheduling in the Weighted lp Norm. - Nikhil Bansal 001; Kirk Pruhs (LATIN, 2004)

A Constant Approximation Algorithm for Sorting Buffers. - Jens S. Kohrt; Kirk Pruhs (LATIN, 2004)

Scalable Dissemination: What's Hot and What's Not. - Jonathan Beaver; Nicholas Morsillo; Kirk Pruhs; Panos K. Chrysanthis; Vincenzo Liberatore (WebDB, 2004)

Semi-clairvoyant scheduling. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Theor. Comput. Sci., 2004)

Online Scheduling. - Kirk Pruhs; Jirí Sgall; Eric Torng (Handbook of Scheduling, 2004)

Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks. - Mohamed Aly 002; Nicholas Morsillo; Panos K. Chrysanthis; Kirk Pruhs (DMSN, 2005)

Speed Scaling to Manage Temperature. - Nikhil Bansal 001; Kirk Pruhs (STACS, 2005)

Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web. - Mohamed A. Sharaf; Alexandros Labrinidis; Panos K. Chrysanthis; Kirk Pruhs (WebDB, 2005)

A Comparison of Multicast Pull Models. - Kirk Pruhs; Patchrawat Uthaisombut (Algorithmica, 2005)

Fault-Tolerant Scheduling. - Bala Kalyanasundaram; Kirk Pruhs (SIAM J. Comput., 2005)

Algorithmic problems in power management. - Sandy Irani; Kirk Pruhs (SIGACT News, 2005)

A maiden analysis of longest wait first. - Jeff Edmonds; Kirk Pruhs (ACM Trans. Algorithms, 2005)

KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks. - Mohamed Aly 002; Kirk Pruhs; Panos K. Chrysanthis (CIKM, 2006)

Secure-CITI Critical Information-Technology Infrastructure. - Daniel Mossé; Louise K. Comfort; Ahmed Amer; José Carlos Brustoloni; Panos K. Chrysanthis; Milos Hauskrecht; Alexandros Labrinidis; Rami G. Melhem; Kirk Pruhs (DG.O, 2006)

Balanced Allocations of Cake. - Jeff Edmonds; Kirk Pruhs (FOCS, 2006)

To Broadcast Push or Not and What?. - Jonathan Beaver; Panos K. Chrysanthis; Kirk Pruhs; Vincenzo Liberatore (MDM, 2006)

Decomposing Data-Centric Storage Query Hot-Spots in Sensor Networks. - Mohamed Aly 002; Panos K. Chrysanthis; Kirk Pruhs (MobiQuitous, 2006)

Efficient Scheduling of Heterogeneous Continuous Queries. - Mohamed A. Sharaf; Panos K. Chrysanthis; Alexandros Labrinidis; Kirk Pruhs (VLDB, 2006)

Network awareness and application adaptability. - Ahmad T. Al-Hammouri; Wenhui Zhang 002; Robert F. Buchheit; Vincenzo Liberatore; Panos K. Chrysanthis; Kirk Pruhs (Inf. Syst. E Bus. Manag., 2006)

Online weighted flow time and deadline scheduling. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (J. Discrete Algorithms, 2006)

07261 Summary – Fair Division. - Steven J. Brams; Kirk Pruhs (Fair Division, 2007)

07261 Abstracts Collection – Fair Division. - Steven J. Brams; Kirk Pruhs (Fair Division, 2007)

Non-Preemptive Min-Sum Scheduling with Resource Augmentation. - Nikhil Bansal 001; Ho-Leung Chan; Rohit Khandekar; Kirk Pruhs; Clifford Stein 001; Baruch Schieber (FOCS, 2007)

Speed scaling to manage energy and temperature. - Nikhil Bansal 001; Tracy Kimbrel; Kirk Pruhs (J. ACM, 2007)

Competitive online scheduling for server systems. - Kirk Pruhs (SIGMETRICS Perform. Evaluation Rev., 2007)

Approximation schemes for a class of subset selection problems. - Kirk Pruhs; Gerhard J. Woeginger (Theor. Comput. Sci., 2007)

Confidently Cutting a Cake into Approximately Fair Pieces. - Jeff Edmonds; Kirk Pruhs; Jaisingh Solanki (AAIM, 2008)

08071 Executive Summary – Scheduling. - Jane W.-S. Liu; Rolf H. Möhring; Kirk Pruhs (Scheduling, 2008)

08071 Abstracts Collection – Scheduling. - Jane W.-S. Liu; Rolf H. Möhring; Kirk Pruhs (Scheduling, 2008)

Poster session: ASETS: A self-managing transaction scheduler. - Mohamed A. Sharaf; Shenoda Guirguis; Alexandros Labrinidis; Kirk Pruhs; Panos K. Chrysanthis (ICDE Workshops, 2008)

Scalable data dissemination using hybrid methods. - Wenhui Zhang 002; Vincenzo Liberatore; Jonathan Beaver; Panos K. Chrysanthis; Kirk Pruhs (IPDPS, 2008)

The Online Transportation Problem: On the Exponential Boost of One Extra Server. - Christine Chung 001; Kirk Pruhs; Patchrawat Uthaisombut (LATIN, 2008)

The Price of Stochastic Anarchy. - Christine Chung 001; Katrina Ligett; Kirk Pruhs; Aaron Roth 001 (SAGT, 2008)

Speed Scaling of Tasks with Precedence Constraints. - Kirk Pruhs; Rob van Stee; Patchrawat Uthaisombut (Theory Comput. Syst., 2008)

Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. Vazirani, Editors, Algorithmic Game Theory, Cambridge University Press (2007) ISBN 9780521872829, 776 pp. - Kirk Pruhs (Oper. Res. Lett., 2008)

Getting the best response for your erg. - Kirk Pruhs; Patchrawat Uthaisombut; Gerhard J. Woeginger (ACM Trans. Algorithms, 2008)

Algorithms and metrics for processing multiple heterogeneous continuous queries. - Mohamed A. Sharaf; Panos K. Chrysanthis; Alexandros Labrinidis; Kirk Pruhs (ACM Trans. Database Syst., 2008)

Improving the Hybrid Data Dissemination Model of Web Documents. - Jonathan Beaver; Kirk Pruhs; Panos K. Chrysanthis; Vincenzo Liberatore (World Wide Web, 2008)

Flow Time Minimization. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Encyclopedia of Algorithms, 2008)

Speed Scaling. - Kirk Pruhs (Encyclopedia of Algorithms, 2008)

Adaptive Scheduling of Web Transactions. - Shenoda Guirguis; Mohamed A. Sharaf; Panos K. Chrysanthis; Alexandros Labrinidis; Kirk Pruhs (ICDE, 2009)

Editorial. - Ceyda Oguz; Kirk Pruhs (J. Sched., 2009)

Speed Scaling for Weighted Flow Time. - Nikhil Bansal 001; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2009)

Speed scaling with a solar cell. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (Theor. Comput. Sci., 2009)

How to Schedule When You Have to Buy Your Energy. - Kirk Pruhs; Clifford Stein 001 (APPROX-RANDOM, 2010)

An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints. - Ahmed Abousamra; David P. Bunde; Kirk Pruhs (Algorithm Engineering, 2010)

10071 Abstracts Collection - Scheduling. - Susanne Albers; Sanjoy K. Baruah; Rolf H. Möhring; Kirk Pruhs (Scheduling, 2010)

10071 Executive Summary - Scheduling. - Susanne Albers; Sanjoy K. Baruah; Rolf H. Möhring; Kirk Pruhs (Scheduling, 2010)

Scalably Scheduling Power-Heterogeneous Processors. - Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs (ICALP (1), 2010)

Admission control mechanisms for continuous queries in the cloud. - Lory Al Moakar; Panos K. Chrysanthis; Christine Chung 001; Shenoda Guirguis; Alexandros Labrinidis; Panayiotis Neophytou; Kirk Pruhs (ICDE, 2010)

Scheduling jobs with varying parallelizability to reduce variance. - Anupam Gupta 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Kirk Pruhs (SPAA, 2010)

Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. - Kirk Pruhs; Julien Robert; Nicolas Schabanel (WAOA, 2010)

Open problems in real-time scheduling. - Sanjoy K. Baruah; Kirk Pruhs (J. Sched., 2010)

Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. - Nikhil Bansal 001; Kirk Pruhs (SIAM J. Comput., 2010)

Green Computing Algorithmics. - Kirk Pruhs (FOCS, 2011)

Speed Scaling to Manage Temperature. - Leon Atkins; Guillaume Aupy; Daniel Cole; Kirk Pruhs (TAPAS, 2011)

Managing Power Heterogeneity. - Kirk Pruhs (TAPAS, 2011)

Average Rate Speed Scaling. - Nikhil Bansal 001; David P. Bunde; Ho-Leung Chan; Kirk Pruhs (Algorithmica, 2011)

Competitive Algorithms for Due Date Scheduling. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (Algorithmica, 2011)

Nonclairvoyant Speed Scaling for Flow and Energy. - Ho-Leung Chan; Jeff Edmonds; Tak Wah Lam; Lap-Kei Lee; Alberto Marchetti-Spaccamela; Kirk Pruhs (Algorithmica, 2011)

Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. - Ho-Leung Chan; Jeff Edmonds; Kirk Pruhs (Theory Comput. Syst., 2011)

A tutorial on amortized local competitiveness in online scheduling. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (SIGACT News, 2011)

Nonclairvoyantly scheduling power-heterogeneous processors. - Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs (Sustain. Comput. Informatics Syst., 2011)

Introduction to special issue on theoretical aspects of green computing. - Kirk Pruhs (Sustain. Comput. Informatics Syst., 2011)

Cake cutting really is not a piece of cake. - Jeff Edmonds; Kirk Pruhs (ACM Trans. Algorithms, 2011)

Divorcing Made Easy. - Kirk Pruhs; Gerhard J. Woeginger (FUN, 2012)

Optimal energy trade-off schedules. - Daniel Cole; Dimitrios Letsios; Michael Nugent; Kirk Pruhs (IGCC, 2012)

Multicast Routing for Energy Minimization Using Speed Scaling. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Cliff Stein 001 (MedAlg, 2012)

Shortest-Elapsed-Time-First on a Multiprocessor. - Neal Barcelo; Sungjin Im; Benjamin Moseley; Kirk Pruhs (MedAlg, 2012)

Energy Efficient Caching for Phase-Change Memory. - Neal Barcelo; Miao Zhou; Daniel Cole; Michael Nugent; Kirk Pruhs (MedAlg, 2012)

Scheduling heterogeneous processors isn't as easy as you think. - Anupam Gupta 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Kirk Pruhs (SODA, 2012)

Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. - Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs (WAOA, 2012)

The Power of Fair Pricing Mechanisms. - Christine Chung 001; Katrina Ligett; Kirk Pruhs; Aaron Roth 001 (Algorithmica, 2012)

Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS. - Lory Al Moakar; Panos K. Chrysanthis; Christine Chung 001; Shenoda Guirguis; Alexandros Labrinidis; Panayiotis Neophytou; Kirk Pruhs (Int. J. Next Gener. Comput., 2012)

Speed scaling for stretch plus energy. - Daniel Cole; Sungjin Im; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2012)

Scalably scheduling processes with arbitrary speedup curves. - Jeff Edmonds; Kirk Pruhs (ACM Trans. Algorithms, 2012)

Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. - Nikhil Bansal 001; Ho-Leung Chan; Dmitriy Katz; Kirk Pruhs (Theory Comput., 2012)

The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). - Benjamin Moseley; Kirk Pruhs; Cliff Stein 001 (IPCO, 2013)

The Complexity of Scheduling for p-norms of Flow and Stretch - Benjamin Moseley; Kirk Pruhs; Cliff Stein 001 (CoRR, 2013)

Scheduling (Dagstuhl Seminar 13111). - Susanne Albers; Onno J. Boxma; Kirk Pruhs (Dagstuhl Reports, 2013)

Optimal energy trade-off schedules. - Neal Barcelo; Daniel Cole; Dimitrios Letsios; Michael Nugent; Kirk Pruhs (Sustain. Comput. Informatics Syst., 2013)

Speed Scaling with an Arbitrary Power Function. - Nikhil Bansal 001; Ho-Leung Chan; Kirk Pruhs (ACM Trans. Algorithms, 2013)

SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. - Sungjin Im; Janardhan Kulkarni; Kamesh Munagala; Kirk Pruhs (FOCS, 2014)

Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (IGCC, 2014)

Energy-efficient circuit design. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (ITCS, 2014)

Packet Forwarding Algorithms in a Line Network. - Antonios Antoniadis 001; Neal Barcelo; Daniel Cole; Kyle Fox; Benjamin Moseley; Michael Nugent; Kirk Pruhs (LATIN, 2014)

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. - Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Cliff Stein 001 (STOC, 2014)

The Geometry of Scheduling. - Nikhil Bansal 001; Kirk Pruhs (SIAM J. Comput., 2014)

Online Scheduling with General Cost Functions. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (SIAM J. Comput., 2014)

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs; Kevin Schewior; Clifford Stein 001 (APPROX-RANDOM, 2015)

The power of heterogeneity in Near-Threshold Computing. - Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (IGSC, 2015)

On the Complexity of Speed Scaling. - Neal Barcelo; Peter Kling; Michael Nugent; Kirk Pruhs; Michele Scquizzato (MFCS (2), 2015)

Almost All Functions Require Exponential Energy. - Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (MFCS (2), 2015)

Stochastic Scheduling of Heavy-tailed Jobs. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (STACS, 2015)

Optimal Speed Scaling with a Solar Cell - (Extended Abstract). - Neal Barcelo; Peter Kling; Michael Nugent; Kirk Pruhs (COCOA, 2016)

Chasing Convex Bodies and Functions. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Kevin Schewior; Michele Scquizzato (LATIN, 2016)

Optimal Speed Scaling with a Solar Cell. - Neal Barcelo; Peter Kling; Michael Nugent; Kirk Pruhs (CoRR, 2016)

Weighted geometric set multi-cover via quasi-uniform sampling. - Nikhil Bansal 001; Kirk Pruhs (J. Comput. Geom., 2016)

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms. - Christos Kaklamanis; Kirk Pruhs (Theory Comput. Syst., 2016)

Competitively Scheduling Tasks with Intermediate Parallelizability. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Eric Torng (ACM Trans. Parallel Comput., 2016)

Flow Time Minimization. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Encyclopedia of Algorithms, 2016)

Speed Scaling. - Kirk Pruhs (Encyclopedia of Algorithms, 2016)

Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Clifford Stein 001 (ESA, 2017)

An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Clifford Stein 001 (RTSS, 2017)

Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. - Antonios Antoniadis 001; Neal Barcelo; Mario E. Consuegra; Peter Kling; Michael Nugent; Kirk Pruhs; Michele Scquizzato (Algorithmica, 2017)

The one-dimensional Euclidean domain: finitely many obstructions are not enough. - Jiehua Chen 001; Kirk Pruhs; Gerhard J. Woeginger (Soc. Choice Welf., 2017)

The Online Set Aggregation Problem. - Rodrigo A. Carrasco; Kirk Pruhs; Cliff Stein 001; José Verschae (LATIN, 2018)

The Itinerant List Update Problem. - Neil Olver; Kirk Pruhs; Kevin Schewior; René Sitters; Leen Stougie (WAOA, 2018)

Tight Bounds for Double Coverage Against Weak Adversaries. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos; Kirk Pruhs (Theory Comput. Syst., 2018)

Matroid Coflow Scheduling. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Manish Purohit (ICALP, 2019)

A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (Algorithmica, 2019)

On Coresets for Regularized Loss Minimization. - Ryan R. Curtin; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (CoRR, 2019)

DWMAcc: Accelerating Shift-based CNNs with Domain Wall Memories. - Zhengguo Chen; Quan Deng; Nong Xiao 001; Kirk Pruhs; Youtao Zhang (ACM Trans. Embed. Comput. Syst., 2019)

Green Computing Algorithmics. - Kirk Pruhs (Computing and Software Science, 2019)

Unconditional Coresets for Regularized Loss Minimization. - Alireza Samadian; Kirk Pruhs; Benjamin Moseley; Sungjin Im; Ryan R. Curtin (AISTATS, 2020)

Competitively Pricing Parking in a Tree. - Max Bender; Jacob Gilbert; Aditya Krishnan 001; Kirk Pruhs (WINE, 2020)

Dynamic Weighted Fairness with Minimal Disruptions. - Sungjin Im; Benjamin Moseley; Kamesh Munagala; Kirk Pruhs (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Hallucination Helps: Energy Efficient Virtual Circuit Routing. - Antonios Antoniadis 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Viswanath Nagarajan; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2020)

Approximate Aggregate Queries Under Additive Inequalities. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (APOCS, 2021)

A Relational Gradient Descent Algorithm For Support Vector Machine Training. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (APOCS, 2021)

An Efficient Reduction of a Gammoid to a Partition Matroid. - Marilena Leichter; Benjamin Moseley; Kirk Pruhs (ESA, 2021)

A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. - Max Bender; Jacob Gilbert; Kirk Pruhs (FCT, 2021)

Relational Algorithms for k-Means Clustering. - Benjamin Moseley; Kirk Pruhs; Alireza Samadian; Yuyan Wang (ICALP, 2021)

Instance Optimal Join Size Estimation. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (LAGOS, 2021)

An Approximation Algorithm for the Matrix Tree Multiplication Problem. - Mahmoud Abo Khamis; Ryan R. Curtin; Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (MFCS, 2021)

Relational Boosted Regression Trees. - Sonia Cromp; Alireza Samadian; Kirk Pruhs (CoRR, 2021)

A Competitive Algorithm for Throughout Maximization on Identical Machines. - Benjamin Moseley; Kirk Pruhs; Clifford Stein 001; Rudy Zhou (CoRR, 2021)

The matroid intersection cover problem. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2021)

Optimizing Polymatroid Functions. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (CoRR, 2022)

On the impossibility of decomposing binary matroids. - Marilena Leichter; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2022)

An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line. - Stephen Arndt; Josh Ascher; Kirk Pruhs (COCOA (1), 2023)

Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem. - Stephen Arndt; Josh Ascher; Kirk Pruhs (LAGOS, 2023)

On the Convergence Rate of Linear Datalogo over Stable Semirings. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (CoRR, 2023)

A randomized algorithm for online metric b-matching. - Bala Kalyanasundaram; Kirk Pruhs; Clifford Stein 001 (Oper. Res. Lett., 2023)

Online k-Median with Consistent Clusters. - Benjamin Moseley; Heather Newman; Kirk Pruhs (APPROX/RANDOM, 2024)

On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (ICDT, 2024)

The Public University Secretary Problem. - Benjamin Moseley; Heather Newman; Kirk Pruhs (SOSA, 2024)

Scheduling Out-Trees Online to Optimize Maximum Flow. - Kunal Agrawal 001; Benjamin Moseley; Heather Newman; Kirk Pruhs (SPAA, 2024)

Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. - Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2024)

A competitive algorithm for throughput maximization on identical machines. - Benjamin Moseley; Kirk Pruhs; Clifford Stein 001; Rudy Zhou (Math. Program., 2024)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (Proc. ACM Manag. Data, 2024)

Robust Gittins for Stochastic Scheduling. - Benjamin Moseley; Heather Newman; Kirk Pruhs; Rudy Zhou (SIGMETRICS (Abstracts), 2025)

Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). - Kunal Agrawal 001; Michael A. Bender; Kirk Pruhs; Benjamin Moseley; Clifford Stein 001 (SPAA, 2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (Proc. ACM Manag. Data, 2025)

Competitive Online Transportation Simplified. - Stephen Arndt; Benjamin Moseley; Kirk Pruhs; Marc Uetz (CoRR, 2025)