Остановите войну!
for scientists:
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 191 matches
- 2023
- Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Approximate Trace Reconstruction from a Single Trace. SODA 2023: 605-637 - Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA 2023: 2532-2566 - Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA 2023: 878-924 - Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. SODA 2023: 1905-1930 - Xinrui Jia, Ola Svensson, Weiqiang Yuan:
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. SODA 2023: 1635-1654 - Michal Koucký, Michael E. Saks:
Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance. SODA 2023: 5203-5219 - Pan Peng, Yuichi Yoshida:
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. SODA 2023: 4936-4965 - R. Ravi, Weizhong Zhang, Michael Zlatin:
Approximation Algorithms for Steiner Tree Augmentation Problems. SODA 2023: 2429-2448 - Fang Kong, Shuai Li:
Player-optimal Stable Regret for Bandit Learning in Matching Markets. SODA 2023: 1512-1522 - Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. SODA 2023: 738-792 - Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA 2023: 3218-3228 - Yi Li, Honghao Lin, David P. Woodruff:
The ℓp-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines. SODA 2023: 850-877 - Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
Improved Approximation for Two-Edge-Connectivity. SODA 2023: 2368-2410 - Xin Lyu, Weihao Zhu:
Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness. SODA 2023: 5243-5281 - Shu Liu, Tingyi Wu, Chaoping Xing:
Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. SODA 2023: 4104-4114 - Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. SODA 2023: 4205-4272 - Kun He, Qian Li, Xiaoming Sun:
Moser-Tardos Algorithm: Beyond Shearer's Bound. SODA 2023: 3362-3387 - Kun He, Kewen Wu, Kuan Yang:
Improved Bounds for Sampling Solutions of Random CNF Formulas. SODA 2023: 3330-3361 - Kun He, Chunyang Wang, Yitong Yin:
Deterministic counting Lovász local lemma beyond linear programming. SODA 2023: 3388-3425 - Yu Chen, Sanjeev Khanna, Zihan Tan:
Query Complexity of the Metric Steiner Tree Problem. SODA 2023: 4893-4935 - Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. SODA 2023: 1806-1833 - Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA 2023: 2087-2110 - Josh Alman, Yunfeng Guan, Ashwin Padaki:
Smaller Low-Depth Circuits for Kronecker Powers. SODA 2023: 4159-4187 - Andrew Alseth, Matthew J. Patitz:
The Need for Seed (in the abstract Tile Assembly Model). SODA 2023: 4540-4589 - Michael Anastos:
Fast algorithms for solving the Hamilton Cycle problem with high probability. SODA 2023: 2286-2323 - Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. SODA 2023: 1265-1318 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. SODA 2023: 1834-1861 - Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. SODA 2023: 456-476
skipping 161 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-06-14 14:46 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