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
- 2011
- Marcella Anselmo, Maria Madonia:
Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages. CAI 2011: 84-96 - Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages. CAI 2011: 97-114 - Anna Benini, Achille Frigeri, Fiorenza Morini:
Codes and Combinatorial Structures from Circular Planar Nearrings. CAI 2011: 115-126 - Matthieu Deneufchâtel, Gérard Duchamp, Vincel Hoang Ngoc Minh, Allan I. Solomon:
Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics. CAI 2011: 127-139 - Sicun Gao, André Platzer, Edmund M. Clarke:
Quantifier Elimination over Finite Fields Using Gröbner Bases. CAI 2011: 140-157 - Mamadou Moustapha Kanté, Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs. CAI 2011: 158-173 - Gregory Karagiorgos, Dimitrios Poulakis:
An Algorithm for Computing a Basis of a Finite Abelian Group. CAI 2011: 174-184 - Ondrej Klíma, Miroslav Korbelár, Libor Polák:
Rewriting in Varieties of Idempotent Semigroups. CAI 2011: 185-200 - Cynthia Kop:
Simplifying Algebraic Functional Systems. CAI 2011: 201-215 - Christos Koukouvinos, Dimitris E. Simos, Zlatko Varbanov:
Hadamard Matrices, Designs and Their Secret-Sharing Schemes. CAI 2011: 216-229 - Ulrich Loup, Erika Ábrahám:
I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra. CAI 2011: 230-246 - Irini-Eleftheria Mens, George Rahonis:
Variable Tree Automata over Infinite Ranked Alphabets. CAI 2011: 247-260 - Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl:
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20 - Peter Padawitz:
From Grammars and Automata to Algebras and Coalgebras. CAI 2011: 21-43 - Jean-Éric Pin:
Theme and Variations on the Concatenation Product. CAI 2011: 44-64 - Lajos Rónyai, Tamás Mészáros:
Some Combinatorial Applications of Gröbner Bases. CAI 2011: 65-83 - Franz Winkler:
Algebraic Informatics - 4th International Conference, CAI 2011, Linz, Austria, June 21-24, 2011. Proceedings. Lecture Notes in Computer Science 6742, Springer 2011, ISBN 978-3-642-21492-9 [contents]
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-11-07 02:09 CET 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