Остановите войну!
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 60 matches
- 1983
- Samson Abramsky:
On Semantic Foundations for Applicative Multiprogramming. ICALP 1983: 1-14 - Krzysztof R. Apt, Carole Delporte:
An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract). ICALP 1983: 15-27 - André Arnold:
Topological Characterizations of Infinite Behaviours of Transition Systems. ICALP 1983: 28-38 - J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer:
Linear Time and Branching Time Semantics for Recursion with Merge. ICALP 1983: 39-51 - J. W. de Bakker, Jeffery I. Zucker:
Processes and a Fair Semantics for the Ada Rendez-Vous. ICALP 1983: 52-66 - Paul De Bra, Jan Paredaens:
Conditional Dependencies for Horizontal Decompositions. ICALP 1983: 67-82 - Stephen D. Brookes:
On the Relationship of CCS and CSP. ICALP 1983: 83-96 - Stephen D. Brookes, William C. Rounds:
Behavioural Equivalence Relations Induced by Programming Logics. ICALP 1983: 97-108 - Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Lower Bounds for Constant Depth Circuits for Prefix Problems. ICALP 1983: 109-117 - Christian Choffrut, Juhani Karhumäki:
Test Sets for Morphisms with Bounded Delay. ICALP 1983: 118-127 - Shimon Cohen, Daniel Lehmann, Amir Pnueli:
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract). ICALP 1983: 128-136 - Karel Culík II, Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems. ICALP 1983: 137-146 - Philippe Darondeau, Laurent Kott:
On the Observational Semantics of Fair Parallelism. ICALP 1983: 147-159 - Frank K. H. A. Dehne:
On O(N4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching. ICALP 1983: 160-172 - Marie-Pierre Delest, Gérard Viennot:
Algebraic Languages and Polyominoes Enumeration. ICALP 1983: 173-181 - Herbert Edelsbrunner, Emo Welzl:
On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). ICALP 1983: 182-187 - Hartmut Ehrig, Eric G. Wagner, James W. Thatcher:
Algebraic Specifications with Generating Constraints. ICALP 1983: 188-202 - Aviezri S. Fraenkel:
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP 1983: 203-225 - Joaquim Gabarró:
Initial Index: A New Complexity Function for Languages. ICALP 1983: 226-236 - Harald Ganzinger:
Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract). ICALP 1983: 237-249 - Joachim von zur Gathen, Erich L. Kaltofen:
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. ICALP 1983: 250-263 - Ursula Goltz, Wolfgang Reisig:
Processes of Place/Transition-Nets. ICALP 1983: 264-277 - Joseph Y. Halpern, Zohar Manna, Ben C. Moszkowski:
A Hardware Semantics Based on Temporal Intervals. ICALP 1983: 278-291 - Susanne E. Hambrusch, Janos Simon:
Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP 1983: 292-303 - Sergiu Hart, Micha Sharir:
Concurrent Probabilistic Program, or: How to Schedule if You Must. ICALP 1983: 304-318 - Juris Hartmanis, Yaacov Yesha:
Computation Times of NP Sets of Different Densities. ICALP 1983: 319-330 - Jieh Hsiang, Nachum Dershowitz:
Rewrite Methods for Clausal and Non-Clausal Theorem Proving. ICALP 1983: 331-346 - Klaus Indermark:
Complexity of Infinite Trees. ICALP 1983: 347-360 - Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner:
Incremental Construction of Unification Algorithms in Equational Theories. ICALP 1983: 361-373 - Tsutomu Kamimura:
Tree Automata and Attribute Grammars. ICALP 1983: 374-384
skipping 30 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-23 20:05 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