default search action
Search 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 193 matches
- 2024
- Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann:
The Time Complexity of Fully Sparse Matrix Multiplication. SODA 2024: 4670-4703 - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. SODA 2024: 150-170 - Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos:
Fast Approximation Algorithms for Piercing Boxes by Points. SODA 2024: 4892-4908 - Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger:
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. SODA 2024: 4942-4962 - Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. SODA 2024: 3997-4061 - Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao:
Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. SODA 2024: 4514-4529 - Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. SODA 2024: 5276-5290 - Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
2-Approximation for Prize-Collecting Steiner Forest. SODA 2024: 669-693 - Hannaneh Akrami, Jugal Garg:
Breaking the 3/4 Barrier for Approximate Maximin Share. SODA 2024: 74-91 - Sharareh Alipour, Amir Jafari, Mohammad Hassan Mazidi, Seyed Abolfazl Najafian:
Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with Constraints. SODA 2024: 1246-1259 - Anastasiia Alokhina, Jan van den Brand:
Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary. SODA 2024: 3027-3039 - Ángel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick:
Delaunay Bifiltrations of Functions on Point Clouds. SODA 2024: 4872-4891 - Omar Alrabiah, Venkatesan Guruswami, Ray Li:
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. SODA 2024: 1367-1378 - Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses. SODA 2024: 5029-5056 - Benny Applebaum, Eliran Kachlon:
Conflict Checkable and Decodable Codes and Their Applications. SODA 2024: 1379-1424 - Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian:
Quantum Worst-Case to Average-Case Reductions for All Linear Problems. SODA 2024: 2535-2567 - Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Fully Dynamic Matching: -Approximation in Polylog Update Time. SODA 2024: 3040-3061 - Ainesh Bakshi, Ewin Tang:
An Improved Classical Singular Value Transformation for Quantum Machine Learning. SODA 2024: 2398-2453 - Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA 2024: 2829-2860 - Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning Wang:
Fair Price Discrimination. SODA 2024: 2679-2703 - Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. SODA 2024: 3485-3533 - Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Power of Posted-price Mechanisms for Prophet Inequalities. SODA 2024: 4580-4604 - Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. SODA 2024: 4155-4176 - Tatiana Belova, Alexander S. Kulikov, Ivan Mihajlin, Olga Ratseeva, Grigory Reznikov, Denil Sharipov:
Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds. SODA 2024: 1834-1853 - Abhinav Bhardwaj, Van Vu:
Matrix Perturbation: Davis-Kahan in the Infinity Norm. SODA 2024: 880-934 - Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. SODA 2024: 3393-3440 - Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. SODA 2024: 4564-4579 - Philip Bille, Inge Li Gørtz:
Sparse Regular Expression Matching. SODA 2024: 3354-3375 - Greg Bodwin, Bernhard Haeupler, Merav Parter:
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. SODA 2024: 2609-2642
skipping 163 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-10-02 08:06 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