default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Wajc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. Math. Oper. Res. 49(3): 1582-1606 (2024)- [j3]Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. Math. Oper. Res. 49(3): 1607-1628 (2024) - [c31]Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang:
The Average-Value Allocation Problem. APPROX/RANDOM 2024: 13:1-13:23 - [c30]Neel Patel, David Wajc:
Combinatorial Stationary Prophet Inequalities. SODA 2024: 4605-4630 - [c29]Joakim Blikstad
, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA 2024: 331-336 - [c28]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring Is (Nearly) as Easy as Offline. STOC 2024: 36-46 - [c27]Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. STOC 2024: 59-70 - [i30]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring is (Nearly) as Easy as Offline. CoRR abs/2402.18339 (2024) - [i29]Zhiyi Huang, Zhihao Gavin Tang, David Wajc:
Online Matching: A Brief Survey. CoRR abs/2407.05381 (2024) - [i28]Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang:
The Average-Value Allocation Problem. CoRR abs/2407.10401 (2024) - [i27]Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc:
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. CoRR abs/2407.15285 (2024) - [i26]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Deterministic Online Bipartite Edge Coloring. CoRR abs/2408.03661 (2024) - [i25]Youri Kaminsky, Benny Kimelfeld, Ester Livshits, Felix Naumann, David Wajc:
Repairing Databases over Metric Spaces with Coincidence Constraints. CoRR abs/2409.16713 (2024) - 2023
- [c26]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA 2023: 100-128 - [c25]Niv Buchbinder, Joseph (Seffi) Naor, David Wajc:
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA 2023: 2030-2068 - [i24]Joseph Naor, Aravind Srinivasan, David Wajc:
Online Dependent Rounding Schemes. CoRR abs/2301.08680 (2023) - [i23]Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. CoRR abs/2306.11828 (2023) - [i22]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR abs/2311.04574 (2023) - [i21]Neel Patel, David Wajc:
Combinatorial Stationary Prophet Inequalities. CoRR abs/2312.08245 (2023) - 2022
- [c24]Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. ITCS 2022: 111:1-111:23 - [c23]Kristen Kessel, Ali Shameli, Amin Saberi, David Wajc:
The Stationary Prophet Inequality Problem. EC 2022: 243-244 - [c22]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. EC 2022: 321-322 - [i20]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. CoRR abs/2205.08667 (2022) - [i19]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR abs/2207.07438 (2022) - 2021
- [b1]David Wajc:
Matching Theory Under Uncertainty. Carnegie Mellon University, USA, 2021 - [c21]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. ICALP 2021: 78:1-78:19 - [c20]Amin Saberi, David Wajc:
The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. ICALP 2021: 109:1-109:18 - [c19]Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. EC 2021: 763-764 - [c18]Roie Levin, David Wajc:
Streaming Submodular Matching Meets the Primal-Dual Method. SODA 2021: 1914-1933 - [c17]Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. SODA 2021: 2830-2842 - [c16]Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-optimal distributed algorithms for known topologies. STOC 2021: 1166-1179 - [i18]Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. CoRR abs/2102.10261 (2021) - [i17]Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-Optimal Distributed Algorithms for Known Topologies. CoRR abs/2104.03932 (2021) - [i16]Amin Saberi, David Wajc:
The Greedy Algorithm is \emph{not} Optimal for On-Line Edge Coloring. CoRR abs/2105.06944 (2021) - [i15]Niv Buchbinder, Joseph Naor, David Wajc:
A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR abs/2106.04863 (2021) - [i14]Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. CoRR abs/2106.10321 (2021) - [i13]Kristen Kessel, Amin Saberi, Ali Shameli, David Wajc:
The Stationary Prophet Inequality Problem. CoRR abs/2107.10516 (2021) - 2020
- [c15]Bernhard Haeupler, David Wajc, Goran Zuzic:
Network Coding Gaps for Completion Times of Multiple Unicasts. FOCS 2020: 494-505 - [c14]David Wajc:
Rounding dynamic matchings against an adaptive adversary. STOC 2020: 194-207 - [i12]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. CoRR abs/2001.00072 (2020) - [i11]Roie Levin, David Wajc:
Streaming Submodular Matching Meets the Primal-Dual Method. CoRR abs/2008.10062 (2020) - [i10]Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. CoRR abs/2010.16376 (2020)
2010 – 2019
- 2019
- [c13]Ilan Reuven Cohen, Binghui Peng, David Wajc:
Tight Bounds for Online Edge Coloring. FOCS 2019: 1-25 - [c12]Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc:
Online Matching with General Arrivals. FOCS 2019: 26-37 - [c11]Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc:
Stochastic Online Metric Matching. ICALP 2019: 67:1-67:14 - [c10]Mohsen Ghaffari, David Wajc:
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. SOSA 2019: 13:1-13:8 - [i9]Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc:
Online Matching with General Arrivals. CoRR abs/1904.08255 (2019) - [i8]Ilan Reuven Cohen, Binghui Peng, David Wajc:
Tight Bounds for Online Edge Coloring. CoRR abs/1904.09222 (2019) - [i7]Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc:
Stochastic Online Metric Matching. CoRR abs/1904.09284 (2019) - [i6]Bernhard Haeupler, David Wajc, Goran Zuzic:
Network Coding Gaps for Completion Times of Multiple Unicasts. CoRR abs/1905.02805 (2019) - [i5]David Wajc:
Rounding Dynamic Matchings Against an Adaptive Adversary. CoRR abs/1911.05545 (2019) - 2018
- [j2]Joseph (Seffi) Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. ACM Trans. Economics and Comput. 6(3-4): 16:1-16:20 (2018) - [c9]Ariel D. Procaccia, David Wajc, Hanrui Zhang:
Approximation-Variance Tradeoffs in Facility Location Games. AAAI 2018: 1185-1192 - [c8]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP 2018: 7:1-7:16 - [c7]Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc:
Fully-Dynamic Bin Packing with Little Repacking. ICALP 2018: 51:1-51:24 - [c6]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Round- and Message-Optimal Distributed Graph Algorithms. PODC 2018: 119-128 - [c5]Ilan Reuven Cohen, David Wajc:
Randomized Online Matching in Regular Graphs. SODA 2018: 960-979 - [i4]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Round- and Message-Optimal Distributed Part-Wise Aggregation. CoRR abs/1801.05127 (2018) - 2017
- [i3]Anupam Gupta, Guru Guruganesh, Amit Kumar, David Wajc:
Fully-Dynamic Bin Packing with Limited Repacking. CoRR abs/1711.02078 (2017) - [i2]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. CoRR abs/1711.06625 (2017) - 2016
- [c4]Bernhard Haeupler, David Wajc:
A Faster Distributed Radio Broadcast Primitive: Extended Abstract. PODC 2016: 361-370 - 2015
- [c3]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. EC 2015: 131-148 - [c2]Iftah Gamzu, Zohar Shay Karnin, Yoelle Maarek, David Wajc:
You Will Get Mail!Predicting the Arrival of Future Email. WWW (Companion Volume) 2015: 1327-1332 - 2014
- [i1]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. CoRR abs/1409.8670 (2014) - 2013
- [c1]Roee Engelberg, Alex Fabrikant, Michael Schapira, David Wajc:
Best-response dynamics out of sync: complexity and characterization. EC 2013: 379-396 - 2011
- [j1]Andrzej Dudek, David Wajc:
On the complexity of vertex-coloring edge-weightings. Discret. Math. Theor. Comput. Sci. 13(3): 45-50 (2011)
Coauthor Index
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 2024-10-18 19:30 CEST 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:
