


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.
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 18 matches
- 1993
- Fred S. Annexstein, Marc Baumslag:
On the Diameter and Bisector Size of Cayley Graphs. Math. Syst. Theory 26(3): 271-291 (1993) - Amotz Bar-Noy, Danny Dolev
:
A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment. Math. Syst. Theory 26(1): 21-39 (1993) - Richard Beigel, Richard Chang, Mitsunori Ogiwara
:
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. Math. Syst. Theory 26(3): 293-310 (1993) - Piotr Berman, Juan A. Garay:
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. Math. Syst. Theory 26(1): 3-19 (1993) - Jean-Camille Birget:
State-Complexity of Finite-State Devices, State Compressibility and Incompressibility. Math. Syst. Theory 26(3): 237-269 (1993) - Brian A. Coan, Jennifer L. Welch:
Modular Cosntruction of an Efficient 1-Bit Byzantine Agreement Protocol. Math. Syst. Theory 26(1): 131-154 (1993) - Bin Fu:
On Lower Bounds of the Closeness Between Complexity Classes. Math. Syst. Theory 26(2): 187-202 (1993) - Jonathan Goldstine, John K. Price, Detlef Wotschke:
On Reducing the Number of Stack Symbols in a PDA. Math. Syst. Theory 26(4): 313-326 (1993) - Frederic Green:
On the Power of Deterministic Reductions to C=P. Math. Syst. Theory 26(2): 215-233 (1993) - Vassos Hadzilacos, Joseph Y. Halpern:
Message-Optimal Protocols for Byzantine Agreement. Math. Syst. Theory 26(1): 41-102 (1993) - Vassos Hadzilacos, Joseph Y. Halpern:
The Failure Discovery Problem. Math. Syst. Theory 26(1): 103-129 (1993) - Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke:
Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. Math. Syst. Theory 26(4): 379-395 (1993) - Fabrizio Luccio, Linda Pagli
:
A Model of Sequential Computation with Pipelines Access to Memory. Math. Syst. Theory 26(4): 343-356 (1993) - Haiko Müller
:
A Note on Balanced Immunity. Math. Syst. Theory 26(2): 157-167 (1993) - Laura A. Sanchis:
On the Effective Generation of Set Elements Within Specified Ranges. Math. Syst. Theory 26(4): 327-341 (1993) - Osamu Watanabe, Seinosuke Toda:
Structural Analysis of the Complexity of Inverse Functions. Math. Syst. Theory 26(2): 203-214 (1993) - Andreas Weber:
Distance Automata Having Large Finite Distance or Finite Ambiguity. Math. Syst. Theory 26(2): 169-185 (1993) - Hsu-Chun Yen, Namhee Pak:
Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling. Math. Syst. Theory 26(4): 357-378 (1993)
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.
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.
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.
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 2025-07-11 21:13 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
