4. CAI 2011:
Linz,
Austria
Franz Winkler (Ed.):
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 
Invited Papers
Contributed Papers
- Marcella Anselmo, Maria Madonia:
Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages.
84-96
- Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages.
97-114
- Anna Benini, Achille Frigeri, Fiorenza Morini:
Codes and Combinatorial Structures from Circular Planar Nearrings.
115-126
- Matthieu Deneufchâtel, Gérard Duchamp, Vincel Hoang Ngoc Minh, Allan I. Solomon:
Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics.
127-139
- Sicun Gao, André Platzer, Edmund M. Clarke:
Quantifier Elimination over Finite Fields Using Gröbner Bases.
140-157
- Mamadou Moustapha Kanté, Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs.
158-173
- Gregory Karagiorgos, Dimitrios Poulakis:
An Algorithm for Computing a Basis of a Finite Abelian Group.
174-184
- Ondrej Klíma, Miroslav Korbelár, Libor Polák:
Rewriting in Varieties of Idempotent Semigroups.
185-200
- Cynthia Kop:
Simplifying Algebraic Functional Systems.
201-215
- Christos Koukouvinos, Dimitris E. Simos, Zlatko Varbanov:
Hadamard Matrices, Designs and Their Secret-Sharing Schemes.
216-229
- Ulrich Loup, Erika Ábrahám:
I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra.
230-246
- Irini-Eleftheria Mens, George Rahonis:
Variable Tree Automata over Infinite Ranked Alphabets.
247-260
Last update Tue May 22 23:23:15 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
