default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKirk Pruhs
Person information
- affiliation: University of Pittsburgh, Pennsylvania, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j77]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
:
A competitive algorithm for throughput maximization on identical machines. Math. Program. 206(1): 497-514 (2024)- [j76]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. Proc. ACM Manag. Data 2(5): 221:1-221:19 (2024) - [j75]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein:
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. SIAM J. Comput. 53(3): 588-623 (2024) - [c122]Benjamin Moseley, Heather Newman, Kirk Pruhs:
Online k-Median with Consistent Clusters. APPROX/RANDOM 2024: 20:1-20:22 - [c121]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. ICDT 2024: 11:1-11:20 - [c120]Benjamin Moseley, Heather Newman, Kirk Pruhs:
The Public University Secretary Problem. SOSA 2024: 100-106 - [c119]Kunal Agrawal, Benjamin Moseley, Heather Newman, Kirk Pruhs:
Scheduling Out-Trees Online to Optimize Maximum Flow. SPAA 2024: 77-88 - 2023
- [j74]Bala Kalyanasundaram, Kirk Pruhs, Clifford Stein:
A randomized algorithm for online metric b-matching. Oper. Res. Lett. 51(6): 591-594 (2023) - [c118]Stephen Arndt, Josh Ascher, Kirk Pruhs:
An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line. COCOA (1) 2023: 43-67 - [c117]Stephen Arndt, Josh Ascher, Kirk Pruhs:
Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem. LAGOS 2023: 121-129 - [i37]Benjamin Moseley, Heather Newman, Kirk Pruhs:
Online k-Median with Consistent Clusters. CoRR abs/2303.15379 (2023) - [i36]Stephen Arndt, Josh Ascher, Kirk Pruhs:
Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem. CoRR abs/2307.08832 (2023) - [i35]Stephen Arndt, Josh Ascher, Kirk Pruhs:
An $O(\log n)$-Competitive Posted-Price Algorithm for Online Matching on the Line. CoRR abs/2310.12394 (2023) - [i34]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalogo over Stable Semirings. CoRR abs/2311.17664 (2023) - [i33]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. CoRR abs/2312.14063 (2023) - 2022
- [j73]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
On the impossibility of decomposing binary matroids. Oper. Res. Lett. 50(5): 623-625 (2022) - [c116]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughput Maximization on Identical Machines. IPCO 2022: 402-414 - [i32]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
On the Impossibility of Decomposing Binary Matroids. CoRR abs/2206.12896 (2022) - [i31]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
Optimizing Polymatroid Functions. CoRR abs/2211.08381 (2022) - 2021
- [j72]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
The matroid intersection cover problem. Oper. Res. Lett. 49(1): 17-22 (2021) - [c115]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. APOCS 2021: 85-99 - [c114]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. APOCS 2021: 100-113 - [c113]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
An Efficient Reduction of a Gammoid to a Partition Matroid. ESA 2021: 62:1-62:13 - [c112]Max Bender, Jacob Gilbert, Kirk Pruhs:
A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. FCT 2021: 67-84 - [c111]Benjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang:
Relational Algorithms for k-Means Clustering. ICALP 2021: 97:1-97:21 - [c110]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. LAGOS 2021: 135-144 - [c109]Mahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS 2021: 6:1-6:14 - [i30]Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
An Efficient Reduction of a Gammoid to a Partition Matroid. CoRR abs/2107.03795 (2021) - [i29]Sonia Cromp, Alireza Samadian, Kirk Pruhs:
Relational Boosted Regression Trees. CoRR abs/2107.12373 (2021) - [i28]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughout Maximization on Identical Machines. CoRR abs/2111.06564 (2021) - 2020
- [j71]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 19:1-19:18 (2020) - [j70]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020) - [c108]Alireza Samadian, Kirk Pruhs, Benjamin Moseley, Sungjin Im, Ryan R. Curtin:
Unconditional Coresets for Regularized Loss Minimization. AISTATS 2020: 482-492 - [c107]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. SIGMETRICS (Abstracts) 2020: 5-6 - [c106]Max Bender, Jacob Gilbert, Aditya Krishnan, Kirk Pruhs:
Competitively Pricing Parking in a Tree. WINE 2020: 220-233 - [i27]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. CoRR abs/2001.06841 (2020) - [i26]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. CoRR abs/2003.10588 (2020) - [i25]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. CoRR abs/2005.05325 (2020) - [i24]Max Bender, Jacob Gilbert, Aditya Krishnan, Kirk Pruhs:
Competitively Pricing Parking in a Tree. CoRR abs/2007.07294 (2020) - [i23]Benjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang:
Relational Algorithms for k-means Clustering. CoRR abs/2008.00358 (2020) - [i22]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. CoRR abs/2012.08083 (2020)
2010 – 2019
- 2019
- [j69]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. Algorithmica 81(7): 2917-2933 (2019) - [j68]Zhengguo Chen, Quan Deng, Nong Xiao, Kirk Pruhs, Youtao Zhang:
DWMAcc: Accelerating Shift-based CNNs with Domain Wall Memories. ACM Trans. Embed. Comput. Syst. 18(5s): 69:1-69:19 (2019) - [c105]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit:
Matroid Coflow Scheduling. ICALP 2019: 145:1-145:14 - [p1]Kirk Pruhs:
Green Computing Algorithmics. Computing and Software Science 2019: 161-183 - [i21]Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
On Coresets for Regularized Loss Minimization. CoRR abs/1905.10845 (2019) - 2018
- [j67]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62(2): 349-365 (2018) - [c104]Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae:
The Online Set Aggregation Problem. LATIN 2018: 245-259 - [c103]Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie:
The Itinerant List Update Problem. WAOA 2018: 310-326 - 2017
- [j66]Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. Algorithmica 79(2): 568-597 (2017) - [j65]Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger:
The one-dimensional Euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. 48(2): 409-432 (2017) - [c102]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA 2017: 51:1-51:10 - [c101]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS 2017: 343-350 - [e6]Kirk Pruhs, Christian Sohler:
25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. LIPIcs 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-049-1 [contents] - [i20]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR abs/1708.09046 (2017) - 2016
- [j64]Nikhil Bansal, Kirk Pruhs:
Weighted geometric set multi-cover via quasi-uniform sampling. J. Comput. Geom. 7(1): 221-236 (2016) - [j63]Christos Kaklamanis, Kirk Pruhs:
Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms. Theory Comput. Syst. 58(1): 1-3 (2016) - [j62]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively Scheduling Tasks with Intermediate Parallelizability. ACM Trans. Parallel Comput. 3(1): 4:1-4:19 (2016) - [c100]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs:
Optimal Speed Scaling with a Solar Cell - (Extended Abstract). COCOA 2016: 521-535 - [c99]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato:
Chasing Convex Bodies and Functions. LATIN 2016: 68-81 - [r5]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2016: 766-768 - [r4]Kirk Pruhs:
Speed Scaling. Encyclopedia of Algorithms 2016: 2045-2047 - [i19]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs:
Optimal Speed Scaling with a Solar Cell. CoRR abs/1609.02668 (2016) - 2015
- [c98]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein:
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM 2015: 96-109 - [c97]Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
The power of heterogeneity in Near-Threshold Computing. IGSC 2015: 1-4 - [c96]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
On the Complexity of Speed Scaling. MFCS (2) 2015: 75-89 - [c95]Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Almost All Functions Require Exponential Energy. MFCS (2) 2015: 90-101 - [c94]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Stochastic Scheduling of Heavy-tailed Jobs. STACS 2015: 474-486 - [c93]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. WAOA 2015: 47-58 - [i18]Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger:
The one-dimensional Euclidean domain: Finitely many obstructions are not enough. CoRR abs/1506.03838 (2015) - 2014
- [j61]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online Scheduling with General Cost Functions. SIAM J. Comput. 43(1): 126-143 (2014) - [j60]Nikhil Bansal, Kirk Pruhs:
The Geometry of Scheduling. SIAM J. Comput. 43(5): 1684-1698 (2014) - [c92]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs:
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. FOCS 2014: 531-540 - [c91]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. IGCC 2014: 1-8 - [c90]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Energy-efficient circuit design. ITCS 2014: 303-312 - [c89]Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network. LATIN 2014: 610-621 - [c88]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c87]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively scheduling tasks with intermediate parallelizability. SPAA 2014: 22-29 - [c86]Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. STACS 2014: 63-74 - [c85]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC 2014: 734-743 - [c84]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. WAOA 2014: 11-22 - [e5]Christos Kaklamanis, Kirk Pruhs:
Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8447, Springer 2014, ISBN 978-3-319-08000-0 [contents] - [i17]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR abs/1403.6207 (2014) - [i16]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs:
SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. CoRR abs/1404.1943 (2014) - 2013
- [j59]Neal Barcelo, Daniel Cole, Dimitrios Letsios, Michael Nugent, Kirk Pruhs:
Optimal energy trade-off schedules. Sustain. Comput. Informatics Syst. 3(3): 207-217 (2013) - [j58]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with an Arbitrary Power Function. ACM Trans. Algorithms 9(2): 18:1-18:14 (2013) - [c83]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO 2013: 278-289 - [i15]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-norms of Flow and Stretch. CoRR abs/1301.0793 (2013) - [i14]Ahmed Abousamra, David P. Bunde, Kirk Pruhs:
An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints. CoRR abs/1307.0531 (2013) - [i13]Susanne Albers, Onno J. Boxma, Kirk Pruhs:
Scheduling (Dagstuhl Seminar 13111). Dagstuhl Reports 3(3): 24-50 (2013) - 2012
- [j57]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth:
The Power of Fair Pricing Mechanisms. Algorithmica 63(3): 634-644 (2012) - [j56]Lory Al Moakar, Panos K. Chrysanthis, Christine Chung, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis Neophytou, Kirk Pruhs:
Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS. Int. J. Next Gener. Comput. 3(3) (2012) - [j55]Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Speed scaling for stretch plus energy. Oper. Res. Lett. 40(3): 180-184 (2012) - [j54]Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. ACM Trans. Algorithms 8(3): 28:1-28:10 (2012) - [j53]Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. Theory Comput. 8(1): 209-229 (2012) - [c82]Nikhil Bansal, Kirk Pruhs:
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. ESA 2012: 145-156 - [c81]Kirk Pruhs, Gerhard J. Woeginger:
Divorcing Made Easy. FUN 2012: 305-314 - [c80]Daniel Cole, Dimitrios Letsios, Michael Nugent, Kirk Pruhs:
Optimal energy trade-off schedules. IGCC 2012: 1-10 - [c79]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51 - [c78]Neal Barcelo, Miao Zhou, Daniel Cole, Michael Nugent, Kirk Pruhs:
Energy Efficient Caching for Phase-Change Memory. MedAlg 2012: 67-81 - [c77]Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Shortest-Elapsed-Time-First on a Multiprocessor. MedAlg 2012: 82-92 - [c76]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253 - [c75]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online scheduling with general cost functions. SODA 2012: 1254-1265 - [c74]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA 2012: 173-186 - 2011
- [j52]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011) - [j51]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011) - [j50]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61(3): 507-517 (2011) - [j49]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011) - [j48]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2): 83-97 (2011) - [j47]Kirk Pruhs:
Introduction to special issue on theoretical aspects of green computing. Sustain. Comput. Informatics Syst. 1(3): 165-166 (2011) - [j46]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Nonclairvoyantly scheduling power-heterogeneous processors. Sustain. Comput. Informatics Syst. 1(3): 248-255 (2011) - [j45]Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. ACM Trans. Algorithms 7(4): 51:1-51:12 (2011) - [c73]Kirk Pruhs:
Green Computing Algorithmics. FOCS 2011: 3-4 - [c72]Kirk Pruhs:
Managing Power Heterogeneity. TAPAS 2011: 6-7 - [c71]Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs:
Speed Scaling to Manage Temperature. TAPAS 2011: 9-20 - [i12]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Scalably Scheduling Power-Heterogeneous Processors. CoRR abs/1105.3748 (2011) - [i11]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling. CoRR abs/1109.5931 (2011) - 2010
- [j44]Sanjoy K. Baruah, Kirk Pruhs:
Open problems in real-time scheduling. J. Sched. 13(6): 577-582 (2010) - [j43]Nikhil Bansal, Kirk Pruhs:
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. SIAM J. Comput. 39(7): 3311-3335 (2010) - [c70]Kirk Pruhs, Clifford Stein:
How to Schedule When You Have to Buy Your Energy. APPROX-RANDOM 2010: 352-365 - [c69]Nikhil Bansal, Kirk Pruhs:
The Geometry of Scheduling. FOCS 2010: 407-414 - [c68]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference 2010: 165-173 - [c67]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) 2010: 312-323 - [c66]Lory Al Moakar, Panos K. Chrysanthis, Christine Chung, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis Neophytou, Kirk Pruhs:
Admission control mechanisms for continuous queries in the cloud. ICDE 2010: 409-412 - [c65]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth:
The Power of Fair Pricing Mechanisms. LATIN 2010: 554-564 - [c64]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20 - [c63]Kirk Pruhs, Julien Robert, Nicolas Schabanel:
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. WAOA 2010: 237-248 - [e4]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
Scheduling, 14.02. - 19.02.2010. Dagstuhl Seminar Proceedings 10071, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i10]Ahmed Abousamra, David P. Bunde, Kirk Pruhs:
An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints. Algorithm Engineering 2010 - [i9]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
10071 Abstracts Collection - Scheduling. Scheduling 2010 - [i8]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
10071 Executive Summary - Scheduling. Scheduling 2010 - [i7]Jeff Edmonds, Kirk Pruhs:
Scalably Scheduling Processes with Arbitrary Speedup Curves. Scheduling 2010 - [i6]Nikhil Bansal, Kirk Pruhs:
The Geometry of Scheduling. CoRR abs/1008.4889 (2010)
2000 – 2009
- 2009
- [j42]Ceyda Oguz, Kirk Pruhs:
Editorial. J. Sched. 12(5): 435-436 (2009) - [j41]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed Scaling for Weighted Flow Time. SIAM J. Comput. 39(4): 1294-1308 (2009) - [j40]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with a solar cell. Theor. Comput. Sci. 410(45): 4580-4587 (2009) - [c62]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz:
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. ICALP (1) 2009: 144-155 - [c61]Shenoda Guirguis, Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, Kirk Pruhs:
Adaptive Scheduling of Web Transactions. ICDE 2009: 357-368 - [c60]Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. SODA 2009: 685-692 - [c59]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed scaling with an arbitrary power function. SODA 2009: 693-701 - [c58]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10 - [c57]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. STACS 2009: 255-264 - [i5]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy. CoRR abs/0902.1260 (2009) - 2008
- [j39]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. Theory Comput. Syst. 43(1): 67-80 (2008) - [j38]Kirk Pruhs:
Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. Vazirani, Editors, Algorithmic Game Theory, Cambridge University Press (2007) ISBN 9780521872829, 776 pp. Oper. Res. Lett. 36(5): 656 (2008) - [j37]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the best response for your erg. ACM Trans. Algorithms 4(3): 38:1-38:17 (2008) - [j36]Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, Kirk Pruhs:
Algorithms and metrics for processing multiple heterogeneous continuous queries. ACM Trans. Database Syst. 33(1): 5:1-5:44 (2008) - [j35]Jonathan Beaver, Kirk Pruhs, Panos K. Chrysanthis, Vincenzo Liberatore:
Improving the Hybrid Data Dissemination Model of Web Documents. World Wide Web 11(3): 313-337 (2008) - [c56]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with a Solar Cell. AAIM 2008: 15-26 - [c55]Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki:
Confidently Cutting a Cake into Approximately Fair Pieces. AAIM 2008: 155-164 - [c54]Mohamed A. Sharaf, Shenoda Guirguis, Alexandros Labrinidis, Kirk Pruhs, Panos K. Chrysanthis:
Poster session: ASETS: A self-managing transaction scheduler. ICDE Workshops 2008: 56-62 - [c53]Wenhui Zhang, Vincenzo Liberatore, Jonathan Beaver, Panos K. Chrysanthis, Kirk Pruhs:
Scalable data dissemination using hybrid methods. IPDPS 2008: 1-12 - [c52]Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut:
The Online Transportation Problem: On the Exponential Boost of One Extra Server. LATIN 2008: 228-239 - [c51]Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. LATIN 2008: 240-251 - [c50]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth:
The Price of Stochastic Anarchy. SAGT 2008: 303-314 - [e3]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs:
Scheduling, 10.02. - 15.02.2008. Dagstuhl Seminar Proceedings 08071, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [r3]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2008 - [r2]Kirk Pruhs:
Speed Scaling. Encyclopedia of Algorithms 2008 - [i4]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs:
08071 Executive Summary -- Scheduling. Scheduling 2008 - [i3]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs:
08071 Abstracts Collection -- Scheduling. Scheduling 2008 - 2007
- [j34]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Speed scaling to manage energy and temperature. J. ACM 54(1): 3:1-3:39 (2007) - [j33]Kirk Pruhs:
Competitive online scheduling for server systems. SIGMETRICS Perform. Evaluation Rev. 34(4): 52-58 (2007) - [j32]Kirk Pruhs, Gerhard J. Woeginger:
Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382(2): 151-156 (2007) - [c49]Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624 - [c48]Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39 - [c47]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed scaling for weighted flow time. SODA 2007: 805-813 - [e2]Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger:
Fair Division, 24.06. - 29.06.2007. Dagstuhl Seminar Proceedings 07261, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [e1]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM 2007, ISBN 978-0-898716-24-5 [contents] - [i2]Steven J. Brams, Kirk Pruhs:
07261 Summary -- Fair Division. Fair Division 2007 - [i1]Steven J. Brams, Kirk Pruhs:
07261 Abstracts Collection -- Fair Division. Fair Division 2007 - 2006
- [j31]Ahmad T. Al-Hammouri, Wenhui Zhang, Robert F. Buchheit, Vincenzo Liberatore, Panos K. Chrysanthis, Kirk Pruhs:
Network awareness and application adaptability. Inf. Syst. E Bus. Manag. 4(4): 399-419 (2006) - [j30]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006) - [c46]Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis:
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks. CIKM 2006: 317-326 - [c45]Daniel Mossé, Louise K. Comfort, Ahmed Amer, José Carlos Brustoloni, Panos K. Chrysanthis, Milos Hauskrecht, Alexandros Labrinidis, Rami G. Melhem, Kirk Pruhs:
Secure-CITI Critical Information-Technology Infrastructure. DG.O 2006: 253-254 - [c44]Jeff Edmonds, Kirk Pruhs:
Balanced Allocations of Cake. FOCS 2006: 623-634 - [c43]Jonathan Beaver, Panos K. Chrysanthis, Kirk Pruhs, Vincenzo Liberatore:
To Broadcast Push or Not and What?. MDM 2006: 40 - [c42]Mohamed Aly, Panos K. Chrysanthis, Kirk Pruhs:
Decomposing Data-Centric Storage Query Hot-Spots in Sensor Networks. MobiQuitous 2006: 1-9 - [c41]Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. SODA 2006: 271-278 - [c40]Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, Kirk Pruhs:
Efficient Scheduling of Heterogeneous Continuous Queries. VLDB 2006: 511-522 - 2005
- [j29]Kirk Pruhs, Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models. Algorithmica 42(3-4): 289-307 (2005) - [j28]Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Scheduling. SIAM J. Comput. 34(3): 697-719 (2005) - [j27]Sandy Irani, Kirk Pruhs:
Algorithmic problems in power management. SIGACT News 36(2): 63-76 (2005) - [j26]Jeff Edmonds, Kirk Pruhs:
A maiden analysis of longest wait first. ACM Trans. Algorithms 1(1): 14-32 (2005) - [c39]Mohamed Aly, Nicholas Morsillo, Panos K. Chrysanthis, Kirk Pruhs:
Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks. DMSN 2005: 21-26 - [c38]Nikhil Bansal, Kirk Pruhs:
Speed Scaling to Manage Temperature. STACS 2005: 460-471 - [c37]Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. WAOA 2005: 307-319 - [c36]Mohamed A. Sharaf, Alexandros Labrinidis, Panos K. Chrysanthis, Kirk Pruhs:
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web. WebDB 2005: 73-78 - 2004
- [j25]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004) - [c35]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Dynamic Speed Scaling to Manage Energy and Temperature. FOCS 2004: 520-529 - [c34]Jens S. Kohrt, Kirk Pruhs:
A Constant Approximation Algorithm for Sorting Buffers. LATIN 2004: 193-202 - [c33]Kirk Pruhs, Gerhard J. Woeginger:
Approximation Schemes for a Class of Subset Selection Problems. LATIN 2004: 203-211 - [c32]Nikhil Bansal, Kirk Pruhs:
Server Scheduling in the Weighted lp Norm. LATIN 2004: 434-443 - [c31]Jeff Edmonds, Kirk Pruhs:
A maiden analysis of Longest Wait First. SODA 2004: 818-827 - [c30]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the Best Response for Your Erg. SWAT 2004: 14-25 - [c29]Jonathan Beaver, Nicholas Morsillo, Kirk Pruhs, Panos K. Chrysanthis, Vincenzo Liberatore:
Scalable Dissemination: What's Hot and What's Not. WebDB 2004: 31-36 - [r1]Kirk Pruhs, Jirí Sgall, Eric Torng:
Online Scheduling. Handbook of Scheduling 2004 - 2003
- [j24]Jeff Edmonds, Kirk Pruhs:
Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003) - [j23]Bala Kalyanasundaram, Kirk Pruhs:
Minimizing flow time nonclairvoyantly. J. ACM 50(4): 551-567 (2003) - [j22]Kirk Pruhs:
Foreword. J. Algorithms 48(1): 1 (2003) - [j21]Bala Kalyanasundaram, Kirk Pruhs:
Maximizing job completions online. J. Algorithms 49(1): 63-85 (2003) - [j20]Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-line Scheduling. J. Sched. 6(2): 111-112 (2003) - [j19]Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-Line Scheduling. J. Sched. 6(3): 227-228 (2003) - [j18]Kirk Pruhs:
Dedication. J. Sched. 6(3): 229 (2003) - [c28]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant Scheduling. ESA 2003: 67-77 - [c27]Wei Li, Wenhui Zhang, Vincenzo Liberatore, Vince Penkrot, Jonathan Beaver, Mohamed A. Sharaf, Siddhartha Roychowdhury, Panos K. Chrysanthis, Kirk Pruhs:
An Optimized Multicast-based Data Dissemination Middleware. ICDE 2003: 762-764 - [c26]Nikhil Bansal, Kirk Pruhs:
Server scheduling in the Lp norm: a rising tide lifts all boat. STOC 2003: 242-250 - [c25]Panos K. Chrysanthis, Vincenzo Liberatore, Kirk Pruhs:
Middleware Support for Multicast-based Data Dissemination: A Working Reality. WORDS 2003: 265-272 - 2002
- [j17]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. Algorithmica 33(3): 353-370 (2002) - [c24]Kirk Pruhs, Eric Wiewiora:
Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. ALENEX 2002: 60-70 - [c23]Kirk Pruhs, Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models. ESA 2002: 808-819 - [c22]Jeff Edmonds, Kirk Pruhs:
Broadcast scheduling: when fairness is fine. SODA 2002: 421-430 - 2001
- [j16]Bala Kalyanasundaram, Kirk Pruhs:
Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38(1): 2-24 (2001) - [c21]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47 - [c20]Alan Berfield, Bill Simons, Panos K. Chrysanthis, Kirk Pruhs:
Better client OFF time prediction to improve performance in web information systems. WIDM 2001: 39-46 - 2000
- [j15]Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling. Algorithmica 28(1): 125-144 (2000) - [j14]Bala Kalyanasundaram, Kirk Pruhs, Eric Torng:
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica 28(3): 269-270 (2000) - [j13]Bala Kalyanasundaram, Kirk Pruhs:
Speed is as powerful as clairvoyance. J. ACM 47(4): 617-643 (2000) - [j12]Bala Kalyanasundaram, Kirk Pruhs:
The Online Transportation Problem. SIAM J. Discret. Math. 13(3): 370-383 (2000) - [j11]Bala Kalyanasundaram, Kirk Pruhs:
An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1-2): 319-325 (2000) - [c19]Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai:
Scheduling Broadcasts in Wireless Networks. ESA 2000: 290-301 - [c18]Bala Kalyanasundaram, Kirk Pruhs:
Dynamic Spectrum Allocation: The Impotency of Duration Notification. FSTTCS 2000: 421-428 - [c17]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. SWAT 2000: 150-163
1990 – 1999
- 1999
- [c16]Bala Kalyanasundaram, Kirk Pruhs:
Eliminating Migration in Multi-Processor Scheduling. SODA 1999: 499-506 - 1998
- [j10]Kirk Pruhs:
How to design dynamic programming algorithms sans recursion. SIGACT News 29(1): 32-35 (1998) - [c15]Bala Kalyanasundaram, Kirk Pruhs:
Maximizing Job Completions Online. ESA 1998: 235-246 - 1997
- [j9]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
On-Line Load Balancing of Temporary Tasks. J. Algorithms 22(1): 93-110 (1997) - [c14]Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling. ESA 1997: 296-307 - [c13]Bala Kalyanasundaram, Kirk Pruhs:
Minimizing Flow Time Nonclairvoyantly. FOCS 1997: 345-352 - 1996
- [c12]Bala Kalyanasundaram, Kirk Pruhs:
On-line Network Optimization Problems. Online Algorithms 1996: 268-280 - [c11]Bala Kalyanasundaram, Kirk Pruhs:
An Optimal Deterministic Algorithm for Online b-Matching. FSTTCS 1996: 193-199 - 1995
- [j8]Kirk Pruhs:
Using Local Adaptations to Reconfigure a Spanning Tree of a Network. Discret. Appl. Math. 57(1): 67-74 (1995) - [c10]Bala Kalyanasundaram, Kirk Pruhs:
The Online Transportation Problem. ESA 1995: 484-493 - [c9]Bala Kalyanasundaram, Kirk Pruhs:
Speed is as Powerful as Clairvoyance. FOCS 1995: 214-221 - 1994
- [j7]Kirk Pruhs:
Average-Case Scalable On-Line Algorithms for Fault Replacement. Inf. Process. Lett. 52(3): 131-136 (1994) - [j6]Vineet Bafna, Bala Kalyanasundaram, Kirk Pruhs:
Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. Theor. Comput. Sci. 125(2): 345-360 (1994) - [j5]Bala Kalyanasundaram, Kirk Pruhs:
Constructing Competitive Tours from Local Information. Theor. Comput. Sci. 130(1): 125-138 (1994) - [c8]Bala Kalyanasundaram, Kirk Pruhs:
Fault-tolerant scheduling. STOC 1994: 115-124 - 1993
- [j4]Bala Kalyanasundaram, Kirk Pruhs:
A Competitive Analysis of Algorithms for Searching Unknown Scenes. Comput. Geom. 3: 139-155 (1993) - [j3]Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching. J. Algorithms 14(3): 478-488 (1993) - [j2]Kirk Pruhs:
The SPIN-OUT puzzle. ACM SIGCSE Bull. 25(3): 36-38 (1993) - [c7]Bala Kalyanasundaram, Kirk Pruhs:
Constructing Competitive Tours From Local Information. ICALP 1993: 102-113 - [c6]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
Online Load Balancing of Temporary Tasks. WADS 1993: 119-130 - 1992
- [c5]Bala Kalyanasundaram, Kirk Pruhs:
A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). STACS 1992: 147-157 - 1991
- [j1]Kirk Pruhs, Udi Manber:
The Complexity of Controlled Selection. Inf. Comput. 91(1): 103-127 (1991) - [c4]Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching. On-Line Algorithms 1991: 93-94 - [c3]Bala Kalyanasundaram, Kirk Pruhs:
Visual Searching and Mapping. On-Line Algorithms 1991: 157-162 - [c2]Bala Kalyanasundaram, Kirk Pruhs:
On-Line Weighted Matching. SODA 1991: 234-240
1980 – 1989
- 1989
- [c1]Kirk Pruhs, Udi Manber:
The Complexity of Controlled Selection. ICALP 1989: 672-686
Coauthor Index
[j77] [j76] [c122] [c121] [c120] [c119] [i37] [i34] [i33] [j73] [c116] [i32] [i31] [j72] [c115] [c114] [c113] [c111] [c110] [c109] [i30] [i28] [j71] [j70] [c108] [c107] [i27] [i26] [i25] [i23] [i22] [c105] [i21] [c102] [c101] [i20] [j62] [c94] [j61] [c89] [c88] [c87] [c83] [i15] [j55] [c77] [c76] [c75] [j48] [c64]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
