Kirk Pruhs

Kirk Pruhs

University of Pittsburgh

H-index: 45

North America-United States

About Kirk Pruhs

Kirk Pruhs, With an exceptional h-index of 45 and a recent h-index of 20 (since 2020), a distinguished researcher at University of Pittsburgh, specializes in the field of Algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

A competitive algorithm for throughput maximization on identical machines

The Public University Secretary Problem

On the Convergence Rate of Linear Datalog^∘ over Stable Semirings

A randomized algorithm for online metric b-matching

Online -Median with Consistent Clusters

Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs

An -Competitive Posted-Price Algorithm for Online Matching on the Line

Kirk Pruhs Information

University

Position

Professor of Computer Science

Citations(all)

7372

Citations(since 2020)

1552

Cited By

6696

hIndex(all)

45

hIndex(since 2020)

20

i10Index(all)

112

i10Index(since 2020)

46

Email

University Profile Page

University of Pittsburgh

Google Scholar

View Google Scholar Profile

Kirk Pruhs Skills & Research Interests

Algorithms

Top articles of Kirk Pruhs

Title

Journal

Author(s)

Publication Date

A competitive algorithm for throughput maximization on identical machines

Mathematical Programming

Benjamin Moseley

Kirk Pruhs

Clifford Stein

Rudy Zhou

2024/1/10

The Public University Secretary Problem

Benjamin Moseley

Heather Newman

Kirk Pruhs

2024

On the Convergence Rate of Linear Datalog^∘ over Stable Semirings

Sungjin Im

Benjamin Moseley

Hung Ngo

Kirk Pruhs

2024

A randomized algorithm for online metric b-matching

Operations Research Letters

Bala Kalyanasundaram

Kirk Pruhs

Cliff Stein

2023/11/1

Online -Median with Consistent Clusters

arXiv preprint arXiv:2303.15379

Benjamin Moseley

Heather Newman

Kirk Pruhs

2023/3/27

Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem

Procedia Computer Science

Stephen Arndt

Josh Ascher

Kirk Pruhs

2023/1/1

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs

Sungjin Im

Benjamin Moseley

Hung Ngo

Kirk Pruhs

2023/12/21

An -Competitive Posted-Price Algorithm for Online Matching on the Line

Stephen Arndt

Josh Ascher

Kirk Pruhs

2023/12/9

Optimizing Polymatroid Functions

arXiv preprint arXiv:2211.08381

Sungjin Im

Benjamin Moseley

Hung Q Ngo

Kirk Pruhs

Alireza Samadian

2022/11/15

On the impossibility of decomposing binary matroids

Operations Research Letters

Marilena Leichter

Benjamin Moseley

Kirk Pruhs

2022/9/1

An Approximation Algorithm for the Matrix Tree Multiplication Problem

Mahmoud Abo-Khamis

Ryan Curtin

Sungjin Im

Benjamin Moseley

Hung Ngo

...

2021

A Competitive Algorithm for Throughout Maximization on Identical Machines

arXiv preprint arXiv:2111.06564

Benjamin Moseley

Kirk Pruhs

Clifford Stein

Rudy Zhou

2021/11/12

Instance Optimal Join Size Estimation

Procedia Computer Science

Mahmoud Abo-Khamis

Sungjin Im

Benjamin Moseley

Kirk Pruhs

Alireza Samadian

2021/1/1

A poly-log competitive posted-price algorithm for online metrical matching on a spider

Max Bender

Jacob Gilbert

Kirk Pruhs

2021/9/9

The matroid intersection cover problem

Operations Research Letters

Sungjin Im

Benjamin Moseley

Kirk Pruhs

2021/1/1

Relational Boosted Regression Trees

arXiv preprint arXiv:2107.12373

Sonia Cromp

Alireza Samadian

Kirk Pruhs

2021/7/25

A relational gradient descent algorithm for support vector machine training

Mahmoud Abo-Khamis

Sungjin Im

Benjamin Moseley

Kirk Pruhs

Alireza Samadian

2021

An efficient reduction of a gammoid to a partition matroid

29th Annual European Symposium on Algorithms (ESA 2021)

Marilena Leichter

Benjamin Moseley

Kirk Pruhs

2021

Approximate aggregate queries under additive inequalities

Mahmoud Abo-Khamis

Sungjin Im

Benjamin Moseley

Kirk Pruhs

Alireza Samadian

2021

Approximation and Online Algorithms: 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers

Christos Kaklamanis

Asaf Levin

2021/7/5

See List of Professors in Kirk Pruhs University(University of Pittsburgh)