Остановите войну!
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 30 matches
- 1984
- Malcolm P. Atkinson, Ronald Morrison:
Persistent First Class Procedures are Enough. FSTTCS 1984: 223-240 - Meurig Beynon:
Replacement in Monotone Boolean Networks: An Algebraic Perspective. FSTTCS 1984: 165-178 - Bhargab B. Bhattacharya, Suranjan Ghose, Bhabani P. Sinha, Pradip K. Srimani:
Heuristic Search Approach to Optimal Routing in a Distributed Architecture. FSTTCS 1984: 152-164 - Gael N. Buckley, Abraham Silberschatz:
Eliminating Cascading Rollback in Structured Database. FSTTCS 1984: 331-343 - Saumya K. Debray, Ariel J. Frank, Scott A. Smolka:
On the Existence and Construction of Robust Communication Protocals for Unreliable Channels. FSTTCS 1984: 136-151 - Subir Kumar Ghosh:
A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons. FSTTCS 1984: 317-330 - Asis K. Goswami, Lalit M. Patnaik:
Functional Programming System Revisited. FSTTCS 1984: 44-59 - P. Gupta, G. P. Bhattacharjee:
An Efficient Algorithm for Random Sampling without Replacement. FSTTCS 1984: 435-465 - Sushil Jajodia:
Universal and Representative Instances Using Unmarked Nulls. FSTTCS 1984: 367-378 - Rajiv Kane, Sartaj Sahni:
VLSI Systems For Design Rule Checks. FSTTCS 1984: 259-278 - Robert A. Kowalski:
Logic for Knowledge Representation. FSTTCS 1984: 1-12 - Kamala Krithivasan:
Treating Terminals as Function Values of Time. FSTTCS 1984: 188-201 - V. S. Lakshmanan, N. Chandrasekharan, C. E. Veni Madhavan:
Recognition and Top-Down Generation of beta-Acyclic Database Schemes. FSTTCS 1984: 344-366 - Christos Levcopoulos, Andrzej Lingas:
Bounds on the Length of Convex Partitions of Polygons. FSTTCS 1984: 279-295 - C. E. Veni Madhavan:
Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. FSTTCS 1984: 381-392 - T. S. E. Maibaum, M. R. Sadler, Paulo A. S. Veloso:
Logical Specification and Implementation. FSTTCS 1984: 13-30 - Thomas J. Myers, A. Toni Cohen:
Models and Transformations for Nondeterministic Extensions of Functional Programming. FSTTCS 1984: 60-88 - N. Natarajan:
A Distributed Algorithm for Detecting Communication Deadlocks. FSTTCS 1984: 119-135 - Mogens Nielsen, P. S. Thiagarajan:
Degrees of Non-Determinism and Concurrency: A Petri Net View. FSTTCS 1984: 89-117 - Asim K. Pal, A. Bagchi:
On the Mean Weight Balance Factor of Binary Trees. FSTTCS 1984: 419-434 - Rohit Parikh:
Logics of Knowledge, Games and Dynamic Logic. FSTTCS 1984: 202-222 - Bruno Poizat:
Generic Oracles (Abstract). FSTTCS 1984: 380 - I. V. Ramakrishnan:
On Mapping Cube Graphs onto VLSI Arrays. FSTTCS 1984: 296-316 - Ramaswamy Ramanujam, R. K. Shyamasundar:
Process Specification of Logic Programs. FSTTCS 1984: 31-43 - Mireille Régnier:
Grid File Algorithms: An Analysis in the Biased Case. FSTTCS 1984: 393-418 - F. de Santis, Maria I. Sessa:
On Some Computational Problems Related to Data Base Coding (Abstract). FSTTCS 1984: 379 - Rudi Studer:
Abstraction Concepts for Modeling Screen Oriented Dialogue Interfaces. FSTTCS 1984: 241-258 - Gadi Taubenfeld, Nissim Francez:
Proof Rules for Communication Abstractions (Abstract). FSTTCS 1984: 118 - Stathis Zachos:
A New Characterization of BPP. FSTTCS 1984: 179-187 - Mathai Joseph, R. K. Shyamasundar:
Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings. Lecture Notes in Computer Science 181, Springer 1984, ISBN 3-540-13883-8 [contents]
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-28 10: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