Остановите войну!
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 52 matches
- 1985
- J. W. de Bakker, Joost N. Kok:
Towards a Uniform Topological Treatment of Streams and Functions on Streams. ICALP 1985: 140-148 - J. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog:
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency. ICALP 1985: 149-157 - Danièle Beauquier, Maurice Nivat:
About Rational Sets of Factors of a Bi-Infinite Word. ICALP 1985: 33-42 - Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52 - Gianfranco Bilardi, Franco P. Preparata:
The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP 1985: 53-62 - Luc Bougé:
Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract). ICALP 1985: 63-70 - Paul De Bra:
Imposed-Functional Dependencies Inducing Horizontal Decompositions. ICALP 1985: 158-170 - Walter Bucher, Andrzej Ehrenfeucht, David Haussler:
On Total Regulators Generated by Derivation Relations. ICALP 1985: 71-79 - Bernard Chazelle, Herbert Edelsbrunner:
Optimal Solutions for a Class of Point Retrieval Problems. ICALP 1985: 80-89 - Bernard Chazelle, Leonidas J. Guibas:
Fractional Cascading: A Data Structuring Technique with Geometric Applications. ICALP 1985: 90-100 - Marek Chrobak:
Hierarchies of One-Way Multihead Automata Languages. ICALP 1985: 101-110 - Richard Cole:
Partitioning Point Sets in 4 Dimensions. ICALP 1985: 111-119 - Mario Coppo:
A Completeness Theorem for Recursively Defined Types. ICALP 1985: 120-129 - Pierre-Louis Curien:
Categorial Combinatory Logic. ICALP 1985: 130-139 - Joost Engelfriet, Heiko Vogler:
Characterization of High Level Tree Transducers. ICALP 1985: 171-178 - Philippe Flajolet:
Ambiguity and Transcendence. ICALP 1985: 179-188 - Steven Fortune:
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract). ICALP 1985: 189-198 - Martin Fürer:
Deterministic and Las Vegas Primality Testing Algorithms. ICALP 1985: 199-209 - Harold N. Gabow, Matthias F. M. Stallmann:
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). ICALP 1985: 210-220 - Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer:
Operational Semantics for Order-Sorted Algebra. ICALP 1985: 221-231 - Carl A. Gunter:
A Universal Domain Technique for Profinite Posets. ICALP 1985: 232-243 - Georges Hansel:
A Simple Proof of the Skolem-Mahler-Lech Theorem. ICALP 1985: 244-249 - Juris Hartmanis, Neil Immerman:
On Complete Problems for NP$\cap$CoNP. ICALP 1985: 250-259 - Matthew Hennessy:
An Algebraic Theory of Fair Asynchronous Communicating Processes. ICALP 1985: 260-269 - Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem. ICALP 1985: 270-280 - Karel Hrbacek:
Powerdomains as Algebraic Lattices (Preliminary Report). ICALP 1985: 281-289 - Mark Jerrum:
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). ICALP 1985: 290-299 - J. Howard Johnson:
Do Rational Equivalence Relations have Regular Cross-Sections? ICALP 1985: 300-309 - Hermann Jung:
On Probabilistic Time and Space. ICALP 1985: 310-317 - Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson:
The Nearest Neighbor Problem on Bounded Domains. ICALP 1985: 318-327
skipping 22 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-26 10:16 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