Остановите войну!
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 45 matches
- 1983
- Samson Abramsky:
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. FCT 1983: 1-13 - Piotr Berman:
Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. FCT 1983: 14-25 - Andreas Brandstädt, Klaus W. Wagner:
Reversal-Bounded and Visit-Bounded Realtime Computations. FCT 1983: 26-39 - Burchard von Braunmühl, Rutger Verbeek:
Input-Driven Languages are Recognized in log n Space. FCT 1983: 40-51 - Bernard Chazelle:
How to Search in History. FCT 1983: 52-63 - Robert L. Constable:
Constructive Mathematics as a Programming Logic I: Some Principles of Theory. FCT 1983: 64-77 - Stephen A. Cook:
The Classifikation of Problems which have Fast Parallel Algorithms. FCT 1983: 78-93 - Gerardo Costa, Colin Stirling:
A Fair Calculus of Communicating Systems. FCT 1983: 94-105 - Karel Culík II, Emo Welzl:
Two Way Finite State Generators. FCT 1983: 106-114 - Peter Drum, Detlef Wotschke:
Economy of Description for Program Schemes -Extended Abstract-. FCT 1983: 475-486 - Michael J. Fischer:
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). FCT 1983: 127-140 - Philippe Flajolet:
Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. FCT 1983: 141-158 - Rusins Freivalds:
Space and Reversal Complexity of Probabilistic One-Way Turing Machines. FCT 1983: 159-170 - Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer:
Pseudorandom Number Generation and Space Complexity. FCT 1983: 171-176 - David Harel:
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). FCT 1983: 177-194 - David Harel, Rivi Sherman:
Propositional Dynamic Logic of Flowcharts. FCT 1983: 195-206 - Stefan Hertel, Kurt Mehlhorn:
Fast Triangulation of Simple Polygons. FCT 1983: 207-218 - Yair Itzhaik, Amiram Yehudai:
On Containment Problems for Finite-Turn Languages (Extended Abstract). FCT 1983: 219-231 - Ladislav Janiga, Václav Koubek:
On Languages Generated by Semigroups. FCT 1983: 232-240 - Hans Langmaack:
Apects of Programs With Finite Modes. FCT 1983: 241-254 - Frank Thomson Leighton, Ronald L. Rivest:
Estimating a Probability Using Finite Memory (Extended Abstract). FCT 1983: 255-269 - Andrzej Lingas:
The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete. FCT 1983: 270-284 - Angus Macintyre:
Decision Problems for Exponential Rings: The p-adic case. FCT 1983: 285-289 - Michael G. Main, David B. Benson:
Functional Behaviour of Nondeterministic Programs. FCT 1983: 290-301 - Kurt Mehlhorn, Bernd H. Schmidt:
A Single Shortest Path Algorithm for Graphs with Separators. FCT 1983: 302-309 - Gary L. Miller:
Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). FCT 1983: 310-327 - Rocco De Nicola:
A Complete Set of Axioms for a Theory of Communicating Sequential Processes. FCT 1983: 115-126 - Renata Ochranová:
Finding Dominators. FCT 1983: 328-334 - Fernando Orejas:
Characterizing Composability of Abstract Implementations. FCT 1983: 335-346 - Rohit Parikh:
Propositional Logics of Programs: New Directions. FCT 1983: 347-359
skipping 15 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-05-03 15:33 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