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
no 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 36 matches
- 2023
- Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA 2023: 343-347 - Anupam Gupta, Euiwoong Lee, Jason Li:
A Local Search-Based Approach for Set Covering. SOSA 2023: 1-11 - Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi:
On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs. SOSA 2023: 145-155 - Peyman Afshani, Pingan Cheng:
An Optimal Lower Bound for Simplex Range Reporting. SOSA 2023: 272-277 - Josh Alman:
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. SOSA 2023: 137-144 - Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
A Simple Combinatorial Algorithm for Robust Matroid Center. SOSA 2023: 96-102 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. SOSA 2023: 69-83 - Sepehr Assadi, Vihan Shah:
Tight Bounds for Vertex Connectivity in Dynamic Streams. SOSA 2023: 213-227 - Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto:
Sinkless Orientation Made Simple. SOSA 2023: 175-191 - Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Approximate minimum cuts and their enumeration. SOSA 2023: 36-41 - Alexander Braun, Thomas Kesselheim:
Simplified Prophet Inequalities for Combinatorial Auctions. SOSA 2023: 381-389 - Emmett Breen, Renee Mirka, Zichen Wang, David P. Williamson:
Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs. SOSA 2023: 56-68 - Volkan Cevher, Georgios Piliouras, Ryann Sim, Stratis Skoulakis:
Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps. SOSA 2023: 192-206 - Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. SOSA 2023: 42-55 - Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Proximity Search in the Greedy Tree. SOSA 2023: 332-342 - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. SOSA 2023: 103-113 - Yubing Cui, Viswanath Nagarajan:
Minimum Cost Adaptive Submodular Cover. SOSA 2023: 12-27 - Prathamesh Dharangutte, Christopher Musco:
A Tight Analysis of Hutchinson's Diagonal Estimator. SOSA 2023: 353-364 - Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Gaussian Mean Testing Made Simple. SOSA 2023: 348-352 - Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. SOSA 2023: 253-260 - Alexander Golovnev, Tom Gur, Igor Shinkar:
Derandomization of Cell Sampling. SOSA 2023: 278-284 - Lucas Gretta, Eric Price:
An Improved Online Reduction from PAC Learning to Mistake-Bounded Learning. SOSA 2023: 373-380 - Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. SOSA 2023: 207-212 - Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. SOSA 2023: 156-165 - Jacob Holm, Eva Rotenberg, Alice Ryhl:
Splay Top Trees. SOSA 2023: 305-331 - Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer:
Simple Set Sketching. SOSA 2023: 228-241 - Dor Katzelnick, Roy Schwartz:
A Simple Algorithm for Submodular Minimum Linear Ordering. SOSA 2023: 28-35 - Maxime Larcher, Robert Meier, Angelika Steger:
A Simple Optimal Algorithm for the 2-Arm Bandit Problem. SOSA 2023: 365-372 - Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. SOSA 2023: 124-136 - Tobias Mömke, Hang Zhou:
Capacitated Vehicle Routing in Graphic Metrics. SOSA 2023: 114-123
skipping 6 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-12-24 01:07 CET 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:
