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 17 matches
- 1992
- Jean-Michel Autebert, Luc Boasson:
The Equivalence of pre-NTS Grammars is Decidable. Math. Syst. Theory 25(1): 61-74 (1992) - Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD Class. Math. Syst. Theory 25(3): 223-237 (1992) - Peter Clote:
A Time-Space Hierarchy Between Polynomial Time and Polynomial Space. Math. Syst. Theory 25(2): 77-92 (1992) - David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener:
Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. Math. Syst. Theory 25(1): 23-36 (1992) - Christiane Frougny:
Representations of Numbers and Finite Automata. Math. Syst. Theory 25(1): 37-60 (1992) - Andrew Gleason:
Semigroups of Shift Register Counting Matrices. Math. Syst. Theory 25(4): 253-267 (1992) - Raymond Greenlaw:
The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Math. Syst. Theory 25(3): 161-175 (1992) - Ulrich Huckenbeck:
Constructing Sets of Functions Which Have a Given F-Cardinality. Math. Syst. Theory 25(1): 3-22 (1992) - Sandy Irani, Moni Naor, Ronitt Rubinfeld:
On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil? Math. Syst. Theory 25(2): 141-159 (1992) - Ravi Janardan, Siu-Wing Cheng:
Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. Math. Syst. Theory 25(2): 93-122 (1992) - Evangelos Kranakis, Paul M. B. Vitányi:
A Note on Weighted Distributed Match-Making. Math. Syst. Theory 25(2): 123-140 (1992) - Siegfried Lehr:
A Result About Languages Concerning Paperfolding Sequences. Math. Syst. Theory 25(4): 309-313 (1992) - Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda:
General Circular Permutation Layout. Math. Syst. Theory 25(4): 269-292 (1992) - Michael C. Loui, David R. Luginbuhl:
The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines. Math. Syst. Theory 25(4): 293-308 (1992) - Friedrich Otto:
The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems. Math. Syst. Theory 25(4): 241-251 (1992) - Alan L. Selman:
A Survey of One-Way Functions in Complexity Theory. Math. Syst. Theory 25(3): 203-221 (1992) - Tomoyuki Yamakami:
Structural Properties for Feasibly Computable Classes of Type Two. Math. Syst. Theory 25(3): 177-201 (1992)
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-09-16 01: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