Остановите войну!
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 40 matches
- 2010
- Dorit Aharonov, Michael Ben-Or, Elad Eban:
Interactive Proofs For Quantum Computations. ICS 2010: 453-469 - Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Adversarial Leakage in Games. ICS 2010: 111-119 - Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch:
Global Alignment of Molecular Sequences via Ancestral State Reconstruction. ICS 2010: 358-369 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? ICS 2010: 1-19 - Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge:
Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract). ICS 2010: 49-65 - Vikraman Arvind, Srikanth Srinivasan:
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. ICS 2010: 383-396 - Maria-Florina Balcan, Avrim Blum, Yishay Mansour:
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. ICS 2010: 200-213 - Mihály Bárász, Santosh S. Vempala:
A New Approach to Strongly Polynomial Linear Programming. ICS 2010: 42-48 - Yonatan Bilu, Nathan Linial:
Are Stable Instances Easy? ICS 2010: 332-341 - Andrej Bogdanov, Kunal Talwar, Andrew Wan:
Hard Instances for Satisfiability and Quasi-one-way Functions. ICS 2010: 290-300 - Mickey Brautbar, Michael J. Kearns:
Local Algorithms for Finding Interesting Individuals in Large Networks. ICS 2010: 188-199 - Sergey Bravyi, Cristopher Moore, Alexander Russell:
Bounds on the Quantum Satisfiability Threshold. ICS 2010: 482-489 - Bernard Chazelle:
Analytical Tools for Natural Algorithms. ICS 2010: 32-41 - Jing Chen, Avinatan Hassidim, Silvio Micali:
Robust Perfect Revenue From Perfectly Informed Players. ICS 2010: 94-105 - Jing Chen, Silvio Micali, Paul Valiant:
Robustly Leveraging Collusion in Combinatorial Auctions. ICS 2010: 81-93 - Steve Chien, Katrina Ligett, Andrew McGregor:
Space-Efficient Estimation of Robust Statistics and Distribution Testing. ICS 2010: 251-265 - Alessandro Chiesa, Eran Tromer:
Proof-Carrying Data and Hearsay Arguments from Signature Cards. ICS 2010: 310-331 - Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. ICS 2010: 434-452 - Vitaly Feldman:
Distribution-Specific Agnostic Boosting. ICS 2010: 241-250 - Michal Feldman, Adam Kalai, Moshe Tennenholtz:
Playing Games without Observing Payoffs. ICS 2010: 106-110 - Lance Fortnow, Rahul Santhanam:
Bounding Rationality by Discounting Time. ICS 2010: 143-155 - Ariel Gabizon, Avinatan Hassidim:
Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction. ICS 2010: 397-405 - Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Robustness of the Learning with Errors Assumption. ICS 2010: 230-240 - Joseph Y. Halpern, Rafael Pass:
Game Theory with Costly Computation: Formulation and Application to Protocol Security. ICS 2010: 120-142 - Avinatan Hassidim:
Cache Replacement Policies for Multicore Processors. ICS 2010: 501-509 - Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. ICS 2010: 470-481 - Tali Kaufman, Shachar Lovett, Ely Porat:
Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS 2010: 422-433 - Tali Kaufman, Avi Wigderson:
Symmetric LDPC Codes and Local Testing. ICS 2010: 406-421 - Noam Livne:
On the Construction of One-Way Functions from Average Case Hardness. ICS 2010: 301-309
skipping 10 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-20 07:01 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