Остановите войну!
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 29 matches
- 1991
- Luca Aceto, Uffe Engberg:
Failures Semantics for a Simple Process Language with Refinement. FSTTCS 1991: 89-108 - Manindra Agrawal:
NP-hard Sets and Creativeness over Constant Time Languages. FSTTCS 1991: 224-241 - Binay K. Bhattacharya:
Usefulness of Angle-Sweep over Line-Sweep. FSTTCS 1991: 390-419 - Andreas Blass, Yuri Gurevich:
Randomizing Reductions of Search Problems. FSTTCS 1991: 10-24 - Manuel Blum:
Program Checking. FSTTCS 1991: 1-9 - John Case, Sanjay Jain, Arun Sharma:
Complexity Issues for Vacillatory Function Identification. FSTTCS 1991: 121-140 - Martin Fürer:
Contracting Planar Graphs Efficiency in Parallel. FSTTCS 1991: 319-335 - Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223 - Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS 1991: 369-389 - Hardi Hungar:
Correstness of Programs over Poor Signatures. FSTTCS 1991: 109-120 - Tao Jiang, Edward McDowell, Bala Ravikumar:
The Structure and Complexity of Minimal NFA's over a Unary Alphabet. FSTTCS 1991: 152-171 - Sam M. Kim, Robert McNaughton:
Computing the Order of a Locally Testable Automaton. FSTTCS 1991: 186-211 - Danny Krizanc, Lata Narayanan, Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays. FSTTCS 1991: 336-346 - Kamal Lodaya, Ramaswamy Ramanujam:
Tense Logics for Local Reasoning in Distributed Systems. FSTTCS 1991: 71-88 - Meena Mahajan, Kamala Krithivasan:
Relativised Cellular Automata and Complexity Classes. FSTTCS 1991: 172-185 - Yishay Mansour, James K. Park, Baruch Schieber:
Improved Selection on Totally Monotone Arrays. FSTTCS 1991: 347-359 - Subrata Mitra, G. Sivakumar:
AC-Equation Solving. FSTTCS 1991: 40-56 - J. Ian Munro, Venkatesh Raman:
Fast Sorting In-Place Sorting with O(n) Data. FSTTCS 1991: 266-277 - Inga Niepel, Peter Rossmanith:
Uniform Circuits and Exclusive Read PRAMs. FSTTCS 1991: 307-318 - Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri:
Designing Secure Communication Protocols from Trust Specifications. FSTTCS 1991: 360-368 - Vangelis Th. Paschos:
A Theorem on the Approximation of Set Cover and Vertex Cover. FSTTCS 1991: 278-287 - Sachin B. Patkar, H. Narayanan:
A Fast Algorithm for the Principle Partition of a Graph. FSTTCS 1991: 288-306 - Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS 1991: 141-151 - David Sands:
Time Analysis, Cost Equivalence and Program Refinement. FSTTCS 1991: 25-39 - Iain A. Stewart:
Complete Problems Involving Boolean Labelled Structures and Projections Translations. FSTTCS 1991: 242-260 - Qing-Ping Tan, Huo-Wang Chen:
On the Operational Interpretation of Complex Types. FSTTCS 1991: 57-70 - V. Vinay:
Is BP.+P a Probabilistic Class? FSTTCS 1991: 261-265 - Glynn Winskel:
Petri Nets and Transition Systems (Abstract for an invited talk). FSTTCS 1991: 420 - Somenath Biswas, Kesav V. Nori:
Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings. Lecture Notes in Computer Science 560, Springer 1991, ISBN 3-540-54967-6 [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-05-02 01: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