Остановите войну!
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 61 matches
- 2008
- Meirav Amram, Mina Teicher, Uzi Vishne:
The Fundamental Group of Galois Cover of the Surface T × T. Int. J. Algebra Comput. 18(8): 1259-1282 (2008) - Roland Bacher:
Determinants Related to Dirichlet Characters Modulo 2, 4 and 8 of binomial Coefficients and the Algebra of Recurrence Matrices. Int. J. Algebra Comput. 18(3): 535-566 (2008) - Taras O. Banakh, Nadia Lyaskovska:
Weakly P-Small not P-Small Subsets in Groups. Int. J. Algebra Comput. 18(1): 1-6 (2008) - Laurent Bartholdi, Bettina Eick, René Hartung:
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications. Int. J. Algebra Comput. 18(8): 1321-1344 (2008) - Laurent Bartholdi, Illya I. Reznykov:
A Mealy Machine with Polynomial Growth of Irrational Degree. Int. J. Algebra Comput. 18(1): 59-82 (2008) - Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. 18(2): 375-405 (2008) - Hans-Joachim Baues, Roman Mikhailov:
Intersection of Subgroups in Free Groups and Homotopy Groups. Int. J. Algebra Comput. 18(5): 803-823 (2008) - Igor Belegradek, Andrzej Szczepanski:
Endomorphisms of Relatively Hyperbolic Groups. Int. J. Algebra Comput. 18(1): 97-110 (2008) - Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov:
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18(8): 1231-1241 (2008) - Jean-Camille Birget:
Factorizations of the Thompson-higman Groups, and Circuit Complexity. Int. J. Algebra Comput. 18(2): 285-320 (2008) - Willem J. Blok, James G. Raftery:
Assertionally Equivalent quasivarieties. Int. J. Algebra Comput. 18(4): 589-681 (2008) - Stephen G. Brick, Jon M. Corson, Dohyoung Ryang:
A Quasi-Isometry Invariant Loop Shortening Property for Groups. Int. J. Algebra Comput. 18(8): 1243-1257 (2008) - Peter A. Brooksbank, Eamonn A. O'Brien:
Constructing the Group Preserving a System of Forms. Int. J. Algebra Comput. 18(2): 227-241 (2008) - Mahir Bilen Can, Lex E. Renner:
H-Polynomials and rook Polynomials. Int. J. Algebra Comput. 18(5): 935-949 (2008) - John Crisp, Michah Sageev, Mark V. Sapir:
Surface Subgroups of Right-Angled Artin Groups. Int. J. Algebra Comput. 18(3): 443-491 (2008) - M. R. Darafsheh:
On the Recognition of the Simple Groups L7(3) and L8(3) by the Spectrum. Int. J. Algebra Comput. 18(5): 925-933 (2008) - Volker Diekert, Markus Lohrey:
Word Equations over Graph Products. Int. J. Algebra Comput. 18(3): 493-533 (2008) - Volker Diekert, Nicole Ondrusch, Markus Lohrey:
Algorithmic Problems on Inverse Monoids over Virtually Free Groups. Int. J. Algebra Comput. 18(1): 181-208 (2008) - John Donnelly:
The Ruinous-Thin Relationship for Three Element Sets. Int. J. Algebra Comput. 18(3): 407-419 (2008) - David Easdown, James East, Desmond G. Fitzgerald:
A Presentation of the Dual Symmetric Inverse Monoid. Int. J. Algebra Comput. 18(2): 357-374 (2008) - Murray Elder, Mark Kambites, Gretchen Ostheimer:
On Groups and Counter Automata. Int. J. Algebra Comput. 18(8): 1345-1364 (2008) - Vincent Ferlini:
Solutions to Zero-Sum Exponent Equations over Finite Cyclic Groups of Exponent Greater than Two. Int. J. Algebra Comput. 18(3): 423-441 (2008) - Eddy Godelle:
The Braid rook Monoid. Int. J. Algebra Comput. 18(4): 779-802 (2008) - Oliver Goodman, Michael Shapiro:
On a Generalization of Dehn's Algorithm. Int. J. Algebra Comput. 18(7): 1137-1177 (2008) - Harri Haanpää, Patric R. J. Östergård, Sándor Szabó:
Small P-Groups with Full-Rank Factorization. Int. J. Algebra Comput. 18(6): 1019-1034 (2008) - Susan M. Hermiller, Derek F. Holt, Sarah Rees:
Groups whose Geodesics are Locally Testable. Int. J. Algebra Comput. 18(5): 911-923 (2008) - Derek F. Holt, Sarah Rees, Michael Shapiro:
Groups that do and do not Have Growing Context-Sensitive Word Problem. Int. J. Algebra Comput. 18(7): 1179-1191 (2008) - Zur Izhakian:
Tropical Algebraic Sets, Ideals and an Algebraic Nullstellensatz. Int. J. Algebra Comput. 18(6): 1067-1098 (2008) - George Janelidze, Valdis Laan, László Márki:
Limit Preservation Properties of the Greatest Semilattice Image Functor. Int. J. Algebra Comput. 18(5): 853-867 (2008) - Keith A. Kearnes, Ágnes Szendrei:
Clones Closed under Conjugation I: Clones with Constants. Int. J. Algebra Comput. 18(1): 7-58 (2008)
skipping 31 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-27 21:35 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