Остановите войну!
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 1,005 matches
- 2024
- Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. ITCS 2024: 27:1-27:13 - Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Testing Intersecting and Union-Closed Families. ITCS 2024: 33:1-33:23 - Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. ITCS 2024: 56:1-56:17 - Ke Wu, Elaine Shi, Hao Chung:
Maximizing Miner Revenue in Transaction Fee Mechanism Design. ITCS 2024: 98:1-98:23 - Ce Jin, R. Ryan Williams, Nathaniel Young:
A VLSI Circuit Model Accounting for Wire Delay. ITCS 2024: 66:1-66:22 - Zhao Song, Lichen Zhang, Ruizhe Zhang:
Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time. ITCS 2024: 93:1-93:15 - Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh:
Exponential-Time Approximation Schemes via Compression. ITCS 2024: 64:1-64:22 - Yuhao Li, William Pires, Robert Robere:
Intersection Classes in TFNP and Proof Complexity. ITCS 2024: 74:1-74:22 - Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa:
Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle. ITCS 2024: 72:1-72:19 - Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Quantum Pseudoentanglement. ITCS 2024: 2:1-2:21 - Scott Aaronson, Harry Buhrman, William Kretschmer:
A Qubit, a Coin, and an Advice String Walk into a Relational Problem. ITCS 2024: 1:1-1:24 - Maryam Aliakbarpour, Rose Silver, Thomas Steinke, Jonathan R. Ullman:
Differentially Private Medians and Interior Points for Non-Pathological Data. ITCS 2024: 3:1-3:21 - Josh Alman, Ethan Turok, Hantao Yu, Hengzhi Zhang:
Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming. ITCS 2024: 4:1-4:23 - Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS 2024: 5:1-5:24 - Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. ITCS 2024: 6:1-6:22 - Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20 - Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang:
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. ITCS 2024: 8:1-8:23 - Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha:
Quantum Merlin-Arthur and Proofs Without Relative Phase. ITCS 2024: 9:1-9:19 - Gabriel Bathie, R. Ryan Williams:
Towards Stronger Depth Lower Bounds. ITCS 2024: 10:1-10:24 - Omri Ben-Eliezer, Esty Kelman, Uri Meir, Sofya Raskhodnikova:
Property Testing with Online Adversaries. ITCS 2024: 11:1-11:25 - Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS 2024: 12:1-12:22 - Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco, Archan Ray, Sushant Sachdeva, David P. Woodruff:
Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra. ITCS 2024: 13:1-13:24 - Kaartik Bhushan, Venkata Koppula, Manoj Prabhakaran:
Homomorphic Indistinguishability Obfuscation and Its Applications. ITCS 2024: 14:1-14:21 - Hadley Black, Eric Blais, Nathaniel Harms:
Testing and Learning Convex Sets in the Ternary Hypercube. ITCS 2024: 15:1-15:21 - Keller Blackwell, Mary Wootters:
A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications. ITCS 2024: 16:1-16:20 - Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran:
Loss Minimization Yields Multicalibration for Large Neural Networks. ITCS 2024: 17:1-17:21 - Avrim Blum, Melissa Dutz:
Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round. ITCS 2024: 18:1-18:18 - Greg Bodwin, Henry L. Fleischmann:
Spanning Adjacency Oracles in Sublinear Time. ITCS 2024: 19:1-19:21 - Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann:
Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract). ITCS 2024: 21:1-21:11 - Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam:
Discreteness of Asymptotic Tensor Ranks (Extended Abstract). ITCS 2024: 20:1-20:14
skipping 975 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-24 09:49 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