Articles with public access mandates - David WajcLearn more
Available somewhere: 20
Online matching with general arrivals
B Gamlath, M Kapralov, A Maggiori, O Svensson, D Wajc
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 26-37, 2019
Mandates: US National Science Foundation, Swiss National Science Foundation, European …
Rounding dynamic matchings against an adaptive adversary
D Wajc
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Mandates: US National Science Foundation
Fully-Dynamic Bin Packing with Little Repacking
B Feldkord, M Feldotto, A Gupta, G Guruganesh, A Kumar, S Riechers, ...
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
Mandates: US National Science Foundation, German Research Foundation
Round-and message-optimal distributed graph algorithms
B Haeupler, DE Hershkowitz, D Wajc
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
Mandates: US National Science Foundation
Online stochastic max-weight bipartite matching: Beyond prophet inequalities
C Papadimitriou, T Pollner, A Saberi, D Wajc
Proceedings of the 22nd ACM Conference on Economics and Computation, 763-764, 2021
Mandates: US National Science Foundation, US Department of Defense
Universally-optimal distributed algorithms for known topologies
B Haeupler, D Wajc, G Zuzic
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandates: US National Science Foundation, Swiss National Science Foundation, US …
Randomized Online Matching in Regular Graphs
IR Cohen, D Wajc
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Mandates: US National Science Foundation
The greedy algorithm is not optimal for on-line edge coloring
A Saberi, D Wajc
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
Mandates: US National Science Foundation, US Department of Defense
Online Edge Coloring Algorithms via the Nibble Method
S Bhattacharya, F Grandoni, D Wajc
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Mandates: US National Science Foundation, Swiss National Science Foundation, UK …
Streaming submodular matching meets the primal-dual method
R Levin, D Wajc
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Mandates: US National Science Foundation
Tight bounds for online edge coloring
IR Cohen, B Peng, D Wajc
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 1-25, 2019
Mandates: US National Science Foundation
Dynamic matching with better-than-2 approximation in polylogarithmic update time
S Bhattacharya, P Kiss, T Saranurak, D Wajc
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
Mandates: UK Engineering and Physical Sciences Research Council
Improved online contention resolution for matchings and applications to the gig economy
T Pollner, M Roghani, A Saberi, D Wajc
Proceedings of the 23rd ACM Conference on Economics and Computation, 321-322, 2022
Mandates: US National Science Foundation
A Faster Distributed Radio Broadcast Primitive
B Haeupler, D Wajc
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
Mandates: US National Science Foundation
Network coding gaps for completion times of multiple unicasts
B Haeupler, D Wajc, G Zuzic
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Mandates: US National Science Foundation
Approximation-Variance Tradeoffs in Facility Location Games
AD Procaccia, D Wajc, H Zhang
Proceedings of AAAI 17, 2018
Mandates: US National Science Foundation, US Department of Defense
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
N Buchbinder, J Naor, D Wajc
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
Mandates: US National Science Foundation
The stationary prophet inequality problem
K Kessel, A Shameli, A Saberi, D Wajc
Proceedings of the 23rd ACM Conference on Economics and Computation, 243-244, 2022
Mandates: US National Science Foundation
Near-optimal dynamic rounding of fractional matchings in bipartite graphs
S Bhattacharya, P Kiss, A Sidford, D Wajc
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 59-70, 2024
Mandates: UK Engineering and Physical Sciences Research Council
Simple and Asymptotically Optimal Online Bipartite Edge Coloring
J Blikstad, O Svensson, R Vintan, D Wajc
2024 Symposium on Simplicity in Algorithms (SOSA), 331-336, 2024
Mandates: Swiss National Science Foundation, Swedish Research Council
Publication and funding information is determined automatically by a computer program