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 23 matches
- 1989
- Kunio Aizawa, Akira Nakamura:
Graph grammars for map generation. A Perspective in Theoretical Computer Science 1989: 3-22 - Karel Culík II, Juhani Karhumäki:
A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers. A Perspective in Theoretical Computer Science 1989: 23-32 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Clans and the Complexity of Dependence graphs. A Perspective in Theoretical Computer Science 1989: 33-37 - Gérard P. Huet:
The Constructive Engine. A Perspective in Theoretical Computer Science 1989: 38-69 - Akira Ito, Katsushi Inoue, Itsuo Takanami:
Complexity of Acceptance Problems for Two-Dimensional Automata. A Perspective in Theoretical Computer Science 1989: 70-94 - Aravind K. Joshi, K. Vijay-Shanker:
Parsing Tree Adjoining Grammars. A Perspective in Theoretical Computer Science 1989: 95-105 - Neal Koblitz:
Discrete Logarithms and discreet Curves. A Perspective in Theoretical Computer Science 1989: 106-120 - Manfred Kudlek:
Deterministic Indian Parllel Systems. A Perspective in Theoretical Computer Science 1989: 121-133 - Meena Mahajan, Kamala Krithivasan:
Hexagonal Cellular Automata. A Perspective in Theoretical Computer Science 1989: 134-164 - Madhavan Mukund, P. S. Thiagarajan:
A Petri Net Model of Asynchronously Communicating Sequential Processes. A Perspective in Theoretical Computer Science 1989: 165-198 - Rohit Parikh:
Decidability and Undecidability in Distributed Transition Systems. A Perspective in Theoretical Computer Science 1989: 199-209 - Zdzislaw Pawlak:
Indiscernibility, Partitions and Rough Sets. A Perspective in Theoretical Computer Science 1989: 210-220 - Azaria Paz:
A 4-State Probablistic Table Approximating All 2-State Probablistic Tables. A Perspective in Theoretical Computer Science 1989: 221-228 - Przemyslaw Prusinkiewicz, Kamala Krithivasan, M. G. Vijaynarayana:
Application of L-Systems to Algorithmic Generation of South Indian Folk Art Patterns and Karnatic Music. A Perspective in Theoretical Computer Science 1989: 229-247 - Azriel Rosenfeld:
An Architecture for Picture Parsing. A Perspective in Theoretical Computer Science 1989: 248-256 - Arto Salomaa:
Public-Key Cryptosystems and Language Theory. A Perspective in Theoretical Computer Science 1989: 257-266 - Rani Siromoney, M. Chandrasekaran, Abdul Huq:
Cryptosystems for Tamil. A Perspective in Theoretical Computer Science 1989: 353-379 - Gift Siromoney, Rani Siromoney, T. Robinson:
Kahbi Kolam and Cycle Grammars. A Perspective in Theoretical Computer Science 1989: 267-300 - Gift Siromoney, K. G. Subramanian, Rani Siromoney:
Map Systems with handles. A Perspective in Theoretical Computer Science 1989: 324-352 - Gift Siromoney, Rani Siromoney, K. G. Subramanian, V. Rajkumar Dare, P. J. Abisha:
Generalized Parikh Vector and Public Key Cryptosystems. A Perspective in Theoretical Computer Science 1989: 301-323 - Patrick S. P. Wang, Hwei-Jen Lin:
New Approach for Array Grammatical Inference. A Perspective in Theoretical Computer Science 1989: 398- - Bal Wang, R. K. Shyamsundar:
Proving Termination of Logic Programs. A Perspective in Theoretical Computer Science 1989: 380-397 - R. Narasimhan:
A Perspective in Theoretical Computer Science - Commemorative Volume for Gift Siromoney. World Scientific Series in Computer Science 16, World Scientific 1989, ISBN 978-9971-5-0925-5, pp. 1-456 [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-11-26 08:29 CET 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