Остановите войну!
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 143 matches
- 2017
- Jing Chen, Bo Li, Yingkai Li:
Efficient Approximations for the Online Dispersion Problem. ICALP 2017: 11:1-11:15 - Yi Li, David P. Woodruff:
Embeddings of Schatten Norms with Applications to Data Streams. ICALP 2017: 60:1-60:14 - Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP 2017: 128:1-128:14 - Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis:
Stochastic Control via Entropy Compression. ICALP 2017: 83:1-83:13 - Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk:
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP 2017: 35:1-35:15 - Shweta Agrawal, Ishaan Preet Singh:
Reusable Garbled Deterministic Finite Automata from Learning With Errors. ICALP 2017: 36:1-36:13 - Sara Ahmadian, Zachary Friggstad:
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. ICALP 2017: 55:1-55:13 - Susanne Albers, Dennis Kraft:
On the Value of Penalties in Time-Inconsistent Planning. ICALP 2017: 10:1-10:12 - Shaull Almagor, Joël Ouaknine, James Worrell:
The Polytope-Collision Problem. ICALP 2017: 24:1-24:14 - Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ICALP 2017: 41:1-41:16 - Rajeev Alur, Konstantinos Mamouras, Caleb Stanford:
Automata-Based Stream Processing. ICALP 2017: 112:1-112:15 - Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel:
A Circuit-Based Approach to Efficient Enumeration. ICALP 2017: 111:1-111:15 - Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese:
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP 2017: 31:1-31:14 - Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. ICALP 2017: 38:1-38:16 - Kazuyuki Asada, Naoki Kobayashi:
Pumping Lemma for Higher-order Languages. ICALP 2017: 97:1-97:14 - Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan:
Universal Framework for Wireless Scheduling Problems. ICALP 2017: 129:1-129:15 - Albert Atserias, Joanna Ochremiak:
Proof Complexity Meets Algebra. ICALP 2017: 110:1-110:14 - Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Selling Complementary Goods: Dynamics, Efficiency and Revenue. ICALP 2017: 134:1-134:14 - Giovanni Bacci, Giorgio Bacci, Kim G. Larsen, Radu Mardare:
On the Metric-Based Approximate Minimization of Markov Chains. ICALP 2017: 104:1-104:14 - Miriam Backens:
A New Holant Dichotomy Inspired by Quantum Computation. ICALP 2017: 16:1-16:14 - Nicolas Bacquey, Etienne Grandjean, Frédéric Olive:
Definability by Horn Formulas and Linear Time on Cellular Automata. ICALP 2017: 99:1-99:14 - Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri:
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. ICALP 2017: 5:1-5:14 - Borja Balle, Pascale Gourdeau, Prakash Panangaden:
Bisimulation Metrics for Weighted Automata. ICALP 2017: 103:1-103:14 - Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP 2017: 70:1-70:13 - Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub:
*-Liftings for Differential Privacy. ICALP 2017: 102:1-102:12 - Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissiblity in Concurrent Games. ICALP 2017: 123:1-123:14 - Surender Baswana, Keerti Choudhary, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP 2017: 72:1-72:15 - Amanda Belleville, David Doty, David Soloveichik:
Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols. ICALP 2017: 141:1-141:14 - Omri Ben-Eliezer, Simon Korman, Daniel Reichman:
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. ICALP 2017: 9:1-9:14 - Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP 2017: 40:1-40:15
skipping 113 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-11 15: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