Остановите войну!
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
- 1990
- Sergio De Agostino, Rossella Petreschi:
Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. Int. J. Found. Comput. Sci. 1(2): 123-130 (1990) - Giorgio Ausiello, Marco Protasi:
Limiting Polynomial Approximation of Complexity Classes. Int. J. Found. Comput. Sci. 1(2): 111-122 (1990) - Franco Barbanera:
Combining Term Rewriting and Type Assignment Systems. Int. J. Found. Comput. Sci. 1(3): 165-184 (1990) - Roberto Barbuti, Maurizio Martelli:
Recognizing Non-Floundering Logic Programs and Goals. Int. J. Found. Comput. Sci. 1(2): 151-164 (1990) - Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi:
Deadlock Prediction in the Case of Dynamic Routing. Int. J. Found. Comput. Sci. 1(3): 185-200 (1990) - Danilo Bruschi, Deborah Joseph, Paul Young:
Strong Separations for the Boolean Hierarchy over RP. Int. J. Found. Comput. Sci. 1(3): 201-218 (1990) - Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli:
Breath and Depth Grammars and Deque Automata. Int. J. Found. Comput. Sci. 1(3): 219-232 (1990) - Hubert Comon:
Solving Symbolic Ordering Constraints. Int. J. Found. Comput. Sci. 1(4): 387-412 (1990) - Stefania Costantini:
Semantics of a Metalogic Programming Language. Int. J. Found. Comput. Sci. 1(3): 233-248 (1990) - Manfred Droste, Rüdiger Göbel:
Universal Information Systems. Int. J. Found. Comput. Sci. 1(4): 413-424 (1990) - Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Simulation of Systolic Tree Automata on Trellis Automata. Int. J. Found. Comput. Sci. 1(2): 87-110 (1990) - Moreno Falaschi, Maurizio Gabbrielli, Giorgio Levi, Masaki Murakami:
Nested Guarded Horn Clauses. Int. J. Found. Comput. Sci. 1(3): 249-264 (1990) - William M. Farmer, Ronald J. Watro:
Redex Capturing in Term Graph Rewriting. Int. J. Found. Comput. Sci. 1(4): 369-386 (1990) - Massimiliano Goldwurm:
Some Limit Distributions in Analysis of Algorithms for Problems on Trace Languages. Int. J. Found. Comput. Sci. 1(3): 265-276 (1990) - Roberto Gorrieri, Ugo Montanari:
Towards Hierarchical Description of Systems: A Proof System for Strong Prefixing. Int. J. Found. Comput. Sci. 1(3): 277-294 (1990) - Erich Grädel:
On the Notion of Linear Time Computability. Int. J. Found. Comput. Sci. 1(3): 295-308 (1990) - Jyrki Katajainen, Erkki Mäkinen:
Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1(4): 425-448 (1990) - Claire Kenyon, Andrew Chi-Chih Yao:
On Evaluating Boolean Functions with Unreliable Tests. Int. J. Found. Comput. Sci. 1(1): 1-10 (1990) - A. P. Korah, M. R. Kaimal:
Dynamic Optimal Binary Search Tree. Int. J. Found. Comput. Sci. 1(4): 449-464 (1990) - Keqin Li, Kam-Hoi Cheng:
Generalized First-Fit Algorithms in Two and Three Dimensions. Int. J. Found. Comput. Sci. 1(2): 131-150 (1990) - Robert McNaughton:
The Development of Formal Language Theory Since 1956 (Review Paper). Int. J. Found. Comput. Sci. 1(4): 355-368 (1990) - Filippo Mignosi:
Sturmian Words and Ambigous Context-Free Languages. Int. J. Found. Comput. Sci. 1(3): 309-324 (1990) - Adolfo Piperno, Enrico Tronci:
Regular Systems in lambda-Calculus. Int. J. Found. Comput. Sci. 1(3): 325-340 (1990) - Franco P. Preparata:
Planar Point Location Revisited (Review Paper). Int. J. Found. Comput. Sci. 1(1): 71-86 (1990) - Giuseppe Rosolini:
About Modest Sets. Int. J. Found. Comput. Sci. 1(3): 341-354 (1990) - Ahmed Saoudi, David E. Muller, Paul E. Schupp:
On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. 1(1): 11-22 (1990) - V. S. Subrahmanian:
A Ring-Theoretic Basis for Logic Programming. Int. J. Found. Comput. Sci. 1(1): 23-48 (1990) - V. S. Subrahmanian:
Errata: A Ring-Theoretic Basis for Logic Programming. Int. J. Found. Comput. Sci. 1(4): 465- (1990) - Marek A. Suchenek:
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models. Int. J. Found. Comput. Sci. 1(1): 49-60 (1990) - W.-D. Wei:
On A Personnel Assignment Problem. Int. J. Found. Comput. Sci. 1(1): 61-70 (1990)
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-28 00:51 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