Остановите войну!
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 61 matches
- 2018
- Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. ITCS 2018: 31:1-31:17 - Oded Goldreich, Guy N. Rothblum:
Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets. ITCS 2018: 18:1-18:19 - Srikanth Srinivasan, Madhu Sudan:
Local Decoding and Testing of Polynomials over Grids. ITCS 2018: 26:1-26:14 - Amir Abboud, Aviad Rubinstein:
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds. ITCS 2018: 35:1-35:14 - Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. ITCS 2018: 40:1-40:21 - Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan:
Graph Clustering using Effective Resistance. ITCS 2018: 41:1-41:16 - Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan:
Minimum Circuit Size, Graph Isomorphism, and Related Problems. ITCS 2018: 20:1-20:20 - Josh Alman, Virginia Vassilevska Williams:
Further Limitations of the Known Approaches for Matrix Multiplication. ITCS 2018: 25:1-25:15 - Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos:
Quantum Query Algorithms are Completely Bounded Forms. ITCS 2018: 3:1-3:21 - Maria-Florina Balcan, Yingyu Liang, David P. Woodruff, Hongyang Zhang:
Matrix Completion and Related Problems via Strong Duality. ITCS 2018: 5:1-5:22 - Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. ITCS 2018: 43:1-43:21 - Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. ITCS 2018: 10:1-10:20 - Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ITCS 2018: 38:1-38:21 - Michael Ben-Or, Lior Eldar:
A Quasi-Random Approach to Matrix Spectral Analysis. ITCS 2018: 6:1-6:22 - Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. ITCS 2018: 19:1-19:20 - Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. ITCS 2018: 51:1-51:14 - Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde:
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs. ITCS 2018: 9:1-9:18 - Aditya Bhaskara, Silvio Lattanzi:
Non-Negative Sparse Regression and Column Subset Selection with L1 Error. ITCS 2018: 7:1-7:15 - Avrim Blum, Yishay Mansour:
On Price versus Quality. ITCS 2018: 16:1-16:12 - Lucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale:
Limits for Rumor Spreading in Stochastic Populations. ITCS 2018: 49:1-49:21 - Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro:
Foundations of Homomorphic Secret Sharing. ITCS 2018: 21:1-21:21 - Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz:
A Candidate for a Strong Separation of Information and Communication. ITCS 2018: 11:1-11:13 - Mark Braverman, Young Kun-Ko:
Information Value of Two-Prover Games. ITCS 2018: 12:1-12:15 - Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. ITCS 2018: 24:1-24:20 - Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, Michael Kowalczyk:
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory. ITCS 2018: 2:1-2:22 - Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Channel Noise. ITCS 2018: 50:1-50:20 - Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu:
Lattice-based Locality Sensitive Hashing is Optimal. ITCS 2018: 42:1-42:18 - Bernard Chazelle:
Toward a Theory of Markov Influence Systems and their Renormalization. ITCS 2018: 58:1-58:18 - Alessandro Chiesa, Tom Gur:
Proofs of Proximity for Distribution Testing. ITCS 2018: 53:1-53:14 - Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams:
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS 2018: 34:1-34:23
skipping 31 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-04-25 16: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