David Wajc

David Wajc

Stanford University

H-index: 20

North America-United States

About David Wajc

David Wajc, With an exceptional h-index of 20 and a recent h-index of 19 (since 2020), a distinguished researcher at Stanford University, specializes in the field of Online Algorithms, Dynamic Algorithms, Distributed Algorithms.

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

Online Edge Coloring is (Nearly) as Easy as Offline

Combinatorial Stationary Prophet Inequalities

Simple and Asymptotically Optimal Online Bipartite Edge Coloring

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs

Dynamic matching with better-than-2 approximation in polylogarithmic update time

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)

Improved online contention resolution for matchings and applications to the gig economy

The stationary prophet inequality problem

David Wajc Information

University

Position

___

Citations(all)

844

Citations(since 2020)

742

Cited By

319

hIndex(all)

20

hIndex(since 2020)

19

i10Index(all)

27

i10Index(since 2020)

26

Email

University Profile Page

Google Scholar

David Wajc Skills & Research Interests

Online Algorithms

Dynamic Algorithms

Distributed Algorithms

Top articles of David Wajc

Online Edge Coloring is (Nearly) as Easy as Offline

arXiv preprint arXiv:2402.18339

2024/2/28

Ola Svensson
Ola Svensson

H-Index: 12

David Wajc
David Wajc

H-Index: 10

Combinatorial Stationary Prophet Inequalities

2024

Neel Patel
Neel Patel

H-Index: 10

David Wajc
David Wajc

H-Index: 10

Simple and Asymptotically Optimal Online Bipartite Edge Coloring

2024

Ola Svensson
Ola Svensson

H-Index: 12

David Wajc
David Wajc

H-Index: 10

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs

arXiv preprint arXiv:2306.11828

2023/6/20

Aaron Sidford
Aaron Sidford

H-Index: 26

David Wajc
David Wajc

H-Index: 10

Dynamic matching with better-than-2 approximation in polylogarithmic update time

2023

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)

2023

Niv Buchbinder
Niv Buchbinder

H-Index: 22

David Wajc
David Wajc

H-Index: 10

Improved online contention resolution for matchings and applications to the gig economy

2022/7/12

The stationary prophet inequality problem

2022/7/12

Amin Saberi
Amin Saberi

H-Index: 34

David Wajc
David Wajc

H-Index: 10

Online stochastic max-weight bipartite matching: Beyond prophet inequalities

2021/7/18

Beating the Folklore Algorithm for Dynamic Matching

arXiv preprint arXiv:2106.10321

2021/6/18

Universally-optimal distributed algorithms for known topologies

2021/6/15

Bernhard Haeupler
Bernhard Haeupler

H-Index: 25

David Wajc
David Wajc

H-Index: 10

System and method for identification of subject line templates

2021/1/5

The greedy algorithm is not optimal for on-line edge coloring

2021

Amin Saberi
Amin Saberi

H-Index: 34

David Wajc
David Wajc

H-Index: 10

Online Edge Coloring Algorithms via the Nibble Method

2021

David Wajc
David Wajc

H-Index: 10

Streaming submodular matching meets the primal-dual method

2021

Roie Levin
Roie Levin

H-Index: 3

David Wajc
David Wajc

H-Index: 10

Network coding gaps for completion times of multiple unicasts

2020/11/16

Bernhard Haeupler
Bernhard Haeupler

H-Index: 25

David Wajc
David Wajc

H-Index: 10

Method and system for classifying man vs. machine generated e-mail

2020/9/15

Matching Theory Under Uncertainty

2020/8

David Wajc
David Wajc

H-Index: 10

Rounding dynamic matchings against an adaptive adversary

2020/6/8

David Wajc
David Wajc

H-Index: 10

See List of Professors in David Wajc University(Stanford University)

Co-Authors

academic-engine