Остановите войну!
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
- 1991
- A. M. Akimenkov:
Solution of the Reducibility Problem for 4-String Braids. Int. J. Algebra Comput. 1(2): 185-200 (1991) - Jorge Almeida:
On Direct Product Decompositions of Finite -Trivial Semigroups. Int. J. Algebra Comput. 1(3): 329-338 (1991) - Christopher J. Ash:
Inevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures. Int. J. Algebra Comput. 1(1): 127-146 (1991) - Jean-Camille Birget:
Strict Local Testability of the Finite Control of Two-Way Automata and of Regular Picture Description Languages. Int. J. Algebra Comput. 1(2): 161-176 (1991) - Marcus Brazil:
Monoid Growth Functions for Braid Groups. Int. J. Algebra Comput. 1(2): 201-206 (1991) - Stanley Burris, John Lawrence:
Term Rewrite Rules for Finite Fields. Int. J. Algebra Comput. 1(3): 353-370 (1991) - Christophe Carré:
The Rule of Littlewood-Richardson in a Construction of Berenstein-Zelevinsky. Int. J. Algebra Comput. 1(4): 473-492 (1991) - Daniel E. Cohen:
Isodiametric and isoperimetric inequalities for Group Presentations. Int. J. Algebra Comput. 1(3): 315-320 (1991) - Maxime Crochemore, Pavel Goralcik:
Mutually Avoiding Ternary Words of Small Exponent. Int. J. Algebra Comput. 1(4): 407-410 (1991) - Ralph Freese, George Grätzer, E. Tamás Schmidt:
On Complete Congruence Lattices of Complete Modular Lattices. Int. J. Algebra Comput. 1(2): 147-160 (1991) - S. M. Gersten:
The Double exponential Theorem for isodiametric and isoperimetric Functions. Int. J. Algebra Comput. 1(3): 321-328 (1991) - Robert H. Gilman:
Verifying that a Group is Virtually Free. Int. J. Algebra Comput. 1(3): 339-352 (1991) - Pavel Goralcik, Tomas Vanicek:
Binary Patterns in Binary Words. Int. J. Algebra Comput. 1(3): 387-392 (1991) - Narain Gupta:
On Groups without Dimension Property. Int. J. Algebra Comput. 1(2): 247-252 (1991) - Karsten Henckell, Stuart W. Margolis, Jean-Eric Pin, John Rhodes:
Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I. Int. J. Algebra Comput. 1(4): 411-436 (1991) - David Hobby:
Finding Type Sets is NP-Hard. Int. J. Algebra Comput. 1(4): 437-444 (1991) - S. V. Ivanov:
Relation Modules and Relation Bimodules of Groups, Semigroups and Associative Algebras. Int. J. Algebra Comput. 1(1): 89-114 (1991) - S. V. Ivanov:
Relation Modules and Relation Bimodules of Groups, Semigroups and Associative Algebras - Addendum and Errata. Int. J. Algebra Comput. 1(3): 393-394 (1991) - Peter R. Jones, Peter G. Trotter:
Joins of Inverse Semigroup Varieties and Band Varieties. Int. J. Algebra Comput. 1(3): 371-386 (1991) - Olga Kharlampovich, Dion Gildenhuys:
Identities in the Variety of Center-by- Lie Algebras. Int. J. Algebra Comput. 1(4): 493- (1991) - David A. Klarner, Jean-Camille Birget, Wade Satterfield:
On the Undecidability of the Freeness of Integer Matrix Semigroups. Int. J. Algebra Comput. 1(2): 223-226 (1991) - Aldo de Luca, Stefano Varricchio:
Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups. Int. J. Algebra Comput. 1(2): 227-246 (1991) - Jonathan P. McCammond:
The Solution to the Word Problem for the Relatively Free Semigroups Satisfying TA = Ta+b with a ≥ 6. Int. J. Algebra Comput. 1(1): 1-32 (1991) - Chrystopher L. Nehaniv:
Algebraic Connectivity. Int. J. Algebra Comput. 1(4): 445-472 (1991) - Jan Okninski, Mohan S. Putcha:
Parabolic Subgroups and Cuspidal Representations of Finite Monoids. Int. J. Algebra Comput. 1(1): 33-48 (1991) - Alexander Yu. Olshanskii:
Hyperbolicity of Groups with Subquadratic isoperimetric inequality. Int. J. Algebra Comput. 1(3): 281-290 (1991) - John Rhodes:
Monoids Acting on Trees: Elliptic and wreath Products and the Holonomy Theorem for Arbitrary Monoids with Applications to Infinite Groups. Int. J. Algebra Comput. 1(2): 253-280 (1991) - Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. 1(3): 291-314 (1991) - Mark V. Sapir:
On the Word Problem in periodic Group Varieties. Int. J. Algebra Comput. 1(1): 115-126 (1991) - Vladimir Shpilrain:
Automorphisms of F/R′ Groups. Int. J. Algebra Comput. 1(2): 177-184 (1991)
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-05-19 16:31 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