Остановите войну!
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 103 matches
- 2004
- Martín Abadi, Véronique Cortier:
Deciding Knowledge in Security Protocols Under Equational Theories. ICALP 2004: 46-58 - Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani:
Representing Nested Inductive Types Using W-Types. ICALP 2004: 59-71 - Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu:
Algorithms for Multi-product Pricing. ICALP 2004: 72-83 - Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ICALP 2004: 84-96 - Luca de Alfaro, Marco Faella, Mariëlle Stoelinga:
Linear and Branching Metrics for Quantitative Transition Systems. ICALP 2004: 97-109 - Noga Alon, Vera Asodi:
Learning a Hidden Subgraph. ICALP 2004: 110-121 - Rajeev Alur, Mikhail Bernadsky, P. Madhusudan:
Optimal Reachability for Weighted Timed Games. ICALP 2004: 122-133 - Matthew Andrews, Lisa Zhang:
Wavelength Assignment in Optical Networks with Fixed Fiber Capacity. ICALP 2004: 134-145 - Lars Arge, Ulrich Meyer, Laura Toma:
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157 - Robert Atkey:
A lambda-Calculus for Resource Separation. ICALP 2004: 158-170 - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
The Power of Verification for One-Parameter Agents. ICALP 2004: 171-182 - Baruch Awerbuch, Christian Scheideler:
Group Spreading: A Protocol for Provably Secure Distributed Name Service. ICALP 2004: 183-195 - Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - Noam Berger, Christian Borgs, Jennifer T. Chayes, Raissa M. D'Souza, Robert D. Kleinberg:
Competition-Induced Preferential Attachment. ICALP 2004: 208-221 - Andreas Björklund, Thore Husfeldt, Sanjeev Khanna:
Approximating Longest Directed Paths and Cycles. ICALP 2004: 222-233 - Carlo Blundo, Paolo D'Arco, Alfredo De Santis:
Definitions and Bounds for Self-Healing Key Distribution Schemes. ICALP 2004: 234-245 - Mikolaj Bojanczyk, Thomas Colcombet:
Tree-Walking Automata Cannot Be Determinized. ICALP 2004: 246-256 - Pierre Boudes:
Projecting Games on Hypercoherences. ICALP 2004: 257-268 - Olivier Bournez, Emmanuel Hainry:
An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP 2004: 269-280 - Glenn Bruns, Patrice Godefroid:
Model Checking with Multi-valued Logics. ICALP 2004: 281-293 - Andrei A. Bulatov, Martin Grohe:
The Complexity of Partition Functions. ICALP 2004: 294-306 - Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro:
Comparing Recursion, Replication, and Iteration in Process Calculi. ICALP 2004: 307-319 - Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao:
Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). ICALP 2004: 320-331 - James Cheney:
The Complexity of Equivariant Unification. ICALP 2004: 332-344 - George Christodoulou, Elias Koutsoupias, Akash Nanavati:
Coordination Mechanisms. ICALP 2004: 345-357 - Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý:
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. ICALP 2004: 358-370 - Bruno Codenotti, Kasturi R. Varadarajan:
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. ICALP 2004: 371-382 - Amin Coja-Oghlan:
Coloring Semirandom Graphs Optimally. ICALP 2004: 383-395 - Artur Czumaj, Christian Sohler:
Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407 - Robert Dabrowski, Wojciech Plandowski:
Solving Two-Variable Word Equations (Extended Abstract). ICALP 2004: 408-419
skipping 73 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 03:36 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