default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 65 matches
- 2024
- Neel Patel, David Wajc:
Combinatorial Stationary Prophet Inequalities. SODA 2024: 4605-4630 - Joakim Blikstad
, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA 2024: 331-336 - Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. STOC 2024: 59-70 - Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring Is (Nearly) as Easy as Offline. STOC 2024: 36-46 - Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring is (Nearly) as Easy as Offline. CoRR abs/2402.18339 (2024) - Zhiyi Huang, Zhihao Gavin Tang, David Wajc:
Online Matching: A Brief Survey. CoRR abs/2407.05381 (2024) - Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang:
The Average-Value Allocation Problem. CoRR abs/2407.10401 (2024) - 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) - Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Deterministic Online Bipartite Edge Coloring. CoRR abs/2408.03661 (2024) - 2023
- Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA 2023: 100-128 - Niv Buchbinder, Joseph (Seffi) Naor, David Wajc:
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA 2023: 2030-2068 - Joseph Naor, Aravind Srinivasan, David Wajc:
Online Dependent Rounding Schemes. CoRR abs/2301.08680 (2023) - Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. CoRR abs/2306.11828 (2023) - Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR abs/2311.04574 (2023) - Neel Patel, David Wajc:
Combinatorial Stationary Prophet Inequalities. CoRR abs/2312.08245 (2023) - 2022
- Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. ITCS 2022: 111:1-111:23 - Kristen Kessel, Ali Shameli, Amin Saberi, David Wajc:
The Stationary Prophet Inequality Problem. EC 2022: 243-244 - Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. EC 2022: 321-322 - 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) - 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
- David Wajc:
Matching Theory Under Uncertainty. Carnegie Mellon University, USA, 2021 - Belinda Giardine, Philippe Joly, Serge Pissard, Henri Wajcman, David H. K. Chui, Ross C. Hardison, George P. Patrinos:
Clinically relevant updates of the HbVar database of human hemoglobin variants and thalassemia mutations. Nucleic Acids Res. 49(Database-Issue): D1192-D1196 (2021) - Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. ICALP 2021: 78:1-78:19 - Amin Saberi, David Wajc:
The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. ICALP 2021: 109:1-109:18 - Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. EC 2021: 763-764 - Sayan Bhattacharya, Fabrizio Grandoni, David Wajc:
Online Edge Coloring Algorithms via the Nibble Method. SODA 2021: 2830-2842 - Roie Levin, David Wajc:
Streaming Submodular Matching Meets the Primal-Dual Method. SODA 2021: 1914-1933 - Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-optimal distributed algorithms for known topologies. STOC 2021: 1166-1179 - Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. CoRR abs/2102.10261 (2021) - Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-Optimal Distributed Algorithms for Known Topologies. CoRR abs/2104.03932 (2021)
skipping 35 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-09-14 12:26 CEST from data curated 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:
