Остановите войну!
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 119 matches
- 2005
- Martín Abadi, Bogdan Warinschi:
Password-Based Encryption Analyzed. ICALP 2005: 664-676 - Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell:
Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101 - Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89 - Rajeev Alur, Viraj Kumar, P. Madhusudan, Mahesh Viswanathan:
Congruences for Visibly Pushdown Languages. ICALP 2005: 1102-1114 - Christoph Ambühl:
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. ICALP 2005: 1139-1150 - Eugene Asarin, Pieter Collins:
Noisy Turing Machines. ICALP 2005: 1031-1042 - Albert Atserias, Anuj Dawar, Martin Grohe:
Preservation Under Extensions on Well-Behaved Finite Structures. ICALP 2005: 1437-1449 - Chen Avin, Gunes Ercal:
On the Cover Time of Random Geometric Graphs. ICALP 2005: 677-689 - Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler:
Facility Location in Sublinear Time. ICALP 2005: 866-877 - Éric Badouel, Jules Chenou, Goulven Guillou:
Petri Algebras. ICALP 2005: 742-754 - Michael Baldamus, Joachim Parrow, Björn Victor:
A Fully Abstract Encoding of the pi-Calculus with Data Terms. ICALP 2005: 1202-1213 - Mathieu Baudet, Véronique Cortier, Steve Kremer:
Computationally Sound Implementations of Equational Theories Against Passive Adversaries. ICALP 2005: 652-663 - Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
On the Equivalence of -Automata. ICALP 2005: 397-409 - Paul Beame, Toniann Pitassi, Nathan Segerlind:
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. ICALP 2005: 1176-1188 - Martin Beaudry, François Lemieux, Denis Thérien:
Groupoids That Recognize Only Regular Languages. ICALP 2005: 421-433 - Petra Berenbrink, Tom Friedetzky, Russell A. Martin:
Dynamic Diffusion Load Balancing. ICALP 2005: 1386-1398 - Philip Bille, Inge Li Gørtz:
The Tree Inclusion Problem: In Optimal Space and Faster. ICALP 2005: 66-77 - Allan Borodin, David Cashman, Avner Magen:
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. ICALP 2005: 943-955 - Aaron R. Bradley, Zohar Manna, Henny B. Sipma:
The Polyranking Principle. ICALP 2005: 1349-1361 - An Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel:
Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties. ICALP 2005: 324-334 - Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
An Accessible Approach to Behavioural Pseudometrics. ICALP 2005: 1018-1030 - Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP 2005: 576-588 - Giuseppe Castagna, Alain Frisch:
A Gentle Introduction to Semantic Subtyping. ICALP 2005: 30-34 - Dario Catalano, Ivan Visconti:
Hybrid Trapdoor Commitments and Their Applications. ICALP 2005: 298-310 - Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong:
Dynamic Bin Packing of Unit Fractions Items. ICALP 2005: 614-626 - Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger:
The Complexity of Stochastic Rabin and Streett Games'. ICALP 2005: 878-890 - Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen:
Lower Bounds for Circuits with Few Modular and Symmetric Gates. ICALP 2005: 994-1005 - Yannick Chevalier, Michaël Rusinowitch:
Combining Intruder Theories. ICALP 2005: 639-651 - Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh:
Worst Case Optimal Union-Intersection Expression Evaluation. ICALP 2005: 179-190 - Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik:
On the Wake-Up Problem in Radio Networks. ICALP 2005: 347-359
skipping 89 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 20:50 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