Seguir
David Wajc
David Wajc
Assistant Professor, Technion — Israel Institute of Technology
Dirección de correo verificada de technion.ac.il - Página principal
Título
Citado por
Citado por
Año
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
742019
On the complexity of vertex-coloring edge-weightings
A Dudek, D Wajc
Discrete Mathematics and Theoretical Computer Science 13 (3), 45--50, 2011
742011
Rounding dynamic matchings against an adaptive adversary
D Wajc
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
602020
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
M Arar, S Chechik, S Cohen, C Stein, D Wajc
arXiv preprint arXiv:1711.06625, 2017
512017
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
472018
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
44*2018
Near-optimum online ad allocation for targeted advertising
J Naor, D Wajc
ACM Transactions on Economics and Computation (TEAC) 6 (3-4), 1-20, 2018
412018
Negative Association-Definition, Properties, and Applications
D Wajc
34*
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
312021
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
312021
Randomized Online Matching in Regular Graphs
IR Cohen, D Wajc
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
312018
Simplified and Space-Optimal Semi-Streaming (2+ ε)-Approximate Matching
M Ghaffari, D Wajc
2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018
302018
Streaming submodular matching meets the primal-dual method
R Levin, D Wajc
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
282021
Beating the Folklore Algorithm for Dynamic Matching
M Roghani, A Saberi, D Wajc
arXiv preprint arXiv:2106.10321, 2021
272021
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
262021
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
232019
Stochastic Online Metric Matching
A Gupta, G Guruganesh, B Peng, D Wajc
arXiv preprint arXiv:1904.09284, 2019
232019
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
222021
Method and system for classifying man vs. machine generated e-mail
Z Karnin, G Halawi, D Wajc, E Liberty
US Patent 10,778,618, 2020
212020
A Faster Distributed Radio Broadcast Primitive
B Haeupler, D Wajc
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
212016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20