Остановите войну!
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 33 matches
- 1979
- Joffroy Beauquier:
Strong Non-Deterministic Context-Free Languages. Theoretical Computer Science 1979: 47-57 - Victor L. Bennison:
Information Content Characterizations of Complexity Theoretic Properties. Theoretical Computer Science 1979: 58-66 - Norbert Blum, Kurt Mehlhorn:
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science 1979: 67-78 - Peter van Emde Boas, Jan van Leeuwen:
Move Rules and Trade-Offs in the Pebble Game. Theoretical Computer Science 1979: 101-112 - Luc Boasson:
Context-Free Sets of Infinite Words. Theoretical Computer Science 1979: 1-9 - Gérard Boudol:
A new Recursion Induction Principle. Theoretical Computer Science 1979: 79-90 - Burchard von Braunmühl, Rutger Verbeek:
Finite-Change Automata. Theoretical Computer Science 1979: 91-100 - Dietmar Friede:
Transition Diagrams and Strict Deterministic Grammars. Theoretical Computer Science 1979: 113-123 - Péter Gács:
Exact Expressions for some Randomness Tests. Theoretical Computer Science 1979: 124-131 - Harald Ganzinger:
On Storage Optimization for Automatically Generated Compilers. Theoretical Computer Science 1979: 132-141 - Irène Guessarian:
On Continuous Completions. Theoretical Computer Science 1979: 142-152 - Joos Heintz:
A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. Theoretical Computer Science 1979: 153-157 - Matthias Jantzen:
On Zerotesting-Bounded Multicounter Machines. Theoretical Computer Science 1979: 158-169 - Akira Kanda, David Michael Ritchie Park:
When are two Effectively given Domains Identical?. Theoretical Computer Science 1979: 170-181 - Michel Latteux:
Sur deux langages linéaires. Theoretical Computer Science 1979: 182-189 - Mila E. Majster-Cederbaum, Angelika Reiser:
An Efficient On-Line Position Tree Construction Algorithm. Theoretical Computer Science 1979: 190-198 - Hermann A. Maurer:
New Aspects of Homomorphisms. Theoretical Computer Science 1979: 10-24 - Kurt Mehlhorn:
Sorting Presorted Files. Theoretical Computer Science 1979: 199-212 - Albert R. Meyer, Irene Greif:
Can Partial Correctness Assertions Specify Programming Language Semantics?. Theoretical Computer Science 1979: 25-26 - Robin Milner:
An Algebraic Theory for Synchronization. Theoretical Computer Science 1979: 27-35 - Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221 - Wolfgang J. Paul, Rüdiger Reischuk:
A Graph Theoretic Approach to Determinism versus Non-Determinism. Theoretical Computer Science 1979: 222-232 - Jean-Eric Pin:
Une caractérisation de trois variétés de langages bien connues. Theoretical Computer Science 1979: 233-243 - Lutz Priese:
Über eine minimale universelle Turing-Maschine. Theoretical Computer Science 1979: 244-259 - Christophe Reutenauer:
Sur les variétés de langages et de monoídes. Theoretical Computer Science 1979: 260-265 - Hans-Anton Rollik:
Automaten in planaren Graphen. Theoretical Computer Science 1979: 266-275 - Jacques Sakarovitch:
Théorème de transversale rationnelle pour les automates à pile déterministes. Theoretical Computer Science 1979: 276-285 - Claus-Peter Schnorr:
On the Additive Complexity of Polynomials and some New Lower Bounds. Theoretical Computer Science 1979: 286-297 - Arnold Schönhage:
Storage Modification Machines. Theoretical Computer Science 1979: 36-37 - Esko Ukkonen:
Remarks on the Nonexistence of some Covering Grammars. Theoretical Computer Science 1979: 298-309
skipping 3 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-25 03: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