Остановите войну!
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 29 matches
- 1995
- Carme Àlvarez, José L. Balcázar, Birgit Jenner:
Adaptive Logspace Reducibility and Parallel Time. Math. Syst. Theory 28(2): 117-140 (1995) - Alberto Apostolico, Maxime Crochemore:
Fast Parallel Lyndon Factorization with Applications. Math. Syst. Theory 28(2): 89-108 (1995) - Franz Aurenhammer, Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time. Math. Syst. Theory 28(5): 387-395 (1995) - Richard Chang, Jim Kadin:
On Computing Boolean Connectives of Characteristic Functions. Math. Syst. Theory 28(3): 173-198 (1995) - Christian Choffrut, Leucio Guerra:
Logical Definability of Some Rational Trace Languages. Math. Syst. Theory 28(5): 397-420 (1995) - Christian Choffrut, Massimiliano Goldwurm:
Rational Transductions and Complexity of Counting Problems. Math. Syst. Theory 28(5): 437-450 (1995) - Jeff I. Chu, Georg Schnitger:
Communication Complexity of Matrix Computation over Finite Fields. Math. Syst. Theory 28(3): 215-228 (1995) - Hubert Comon:
On Unification of Terms with Integer Exponents. Math. Syst. Theory 28(1): 67-88 (1995) - Bruno Courcelle, Joost Engelfriet:
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory 28(6): 515-552 (1995) - Shimon Even, Sergio Rajsbaum:
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. Math. Syst. Theory 28(5): 421-435 (1995) - Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente:
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. Math. Syst. Theory 28(3): 245-266 (1995) - William I. Gasarch, Mark W. Krentel, Kevin J. Rappoport:
OptP as the Normal Behavior of NP-Complete Problems. Math. Syst. Theory 28(6): 487-514 (1995) - Frederic Green:
A Lower Bound for Monotone Perceptrons. Math. Syst. Theory 28(4): 283-298 (1995) - Amos Israeli, Amnon Shaham, Asaf Shirazi:
Linear-Time Snapshot Implementations in Unbalanced Systems. Math. Syst. Theory 28(5): 469-486 (1995) - Sanjay Jain, Arun Sharma:
Prudence in Vacillatory Language Identification. Math. Syst. Theory 28(3): 267-279 (1995) - Jyrki Kivinen:
Learning Reliably and with One-Sided Error. Math. Syst. Theory 28(2): 141-172 (1995) - Matthias Krause, Stephan Waack:
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. Math. Syst. Theory 28(6): 553-564 (1995) - Maciej Liskiewicz:
On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. Math. Syst. Theory 28(4): 329-339 (1995) - Igor Litovsky, Yves Métivier, Éric Sopena:
Different Local Controls for Graph Relabeling Systems. Math. Syst. Theory 28(1): 41-65 (1995) - Timothy J. Long, Ming-Jye Sheu:
A Refinement of the Low and High Hierarchies. Math. Syst. Theory 28(4): 299-327 (1995) - Christoph Meinel, Stephan Waack:
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. Math. Syst. Theory 28(1): 21-39 (1995) - Friedrich Otto:
On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems. Math. Syst. Theory 28(4): 363-384 (1995) - Michael A. Palis, Sunil M. Shende:
Pumping Lemmas for the Control Language Hierarchy. Math. Syst. Theory 28(3): 199-213 (1995) - Prabhakar Raghavan:
Robust Algorithms for Packet Routing in a Mesh. Math. Syst. Theory 28(1): 1-11 (1995) - Kenneth W. Regan, James S. Royer:
On Closure Properties of Bounded Two-Sided Error Complexity Classes. Math. Syst. Theory 28(3): 229-243 (1995) - Josep Rifà, Joan Borrell:
A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields. Math. Syst. Theory 28(1): 13-20 (1995) - Jie Wang:
Productive Functions and Isomorphisms. Math. Syst. Theory 28(2): 109-116 (1995) - Jeffery R. Westbrook, Dicky C. K. Yan:
The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems. Math. Syst. Theory 28(5): 451-468 (1995) - Celia Wrathall, Volker Diekert:
On Confluence of One-Rule Trace-Rewriting Systems. Math. Syst. Theory 28(4): 341-361 (1995)
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-30 11:28 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