Auteurs
Checkpoint
Istex
Racine
Checkpoint
Istex
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (Istex)

Index « Auteurs » - entrée « Miki Hermann »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Mikheil Rukhaia < Miki Hermann < Mikkel Birkegaard Andersen  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 20.
Ident.Authors (with country if any)Title
001816 (2004) Ángel J. Gil [Espagne, États-Unis] ; Miki Hermann [France] ; Gernot Salzer [Autriche] ; Bruno Zanuttini [France]Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains
002057 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
002077 (2000) Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Subtractive Reductions and Complete Problems for Counting Complexity Classes
002344 (1999) Arnaud Durand [France] ; Miki Hermann [France] ; Laurent Juban [France]On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
002345 (1999) Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis]On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
002414 (1999) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational Complexity of Simultaneous Elementary Matching Problems
002568 (1998) Miki Hermann [France] ; Gernot Salzer [Autriche]On the word, subsumption, and complement problem for recurrent term schematizations
002650 (1997) Miki Hermann [France] ; Roman Galbav [France]Unification of infinite sets of terms schematized by primal grammars
002748 (1997) Ali Amaniss [France] ; Miki Hermann [France] ; Denis Lugiez [France]Set operations for recurrent term schematizations
002763 (1997) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]On the complexity of unification and disunification in commutative idempotent semigroups
002905 (1996) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
002980 (1996) Nadia Creignou [France] ; Miki Hermann [France]Complexity of Generalized Satisfiability Counting Problems
002B10 (1995) Miki Hermann [États-Unis] ; Phokion G. Kolaitis [États-Unis]The Complexity of Counting Problems in Equational Matching
002B89 (1995) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Computational complexity of simultaneous elementary matching problems
002C66 (1994) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]The complexity of counting problems in equational matching
002F93 (1992) Miki Hermann [France]On the relation between primitive recursion, schematization, and divergence
003122 (1991) Miki Hermann [France]On proving properties of completion strategies
003126 (1991) Hélène Kirchner [France] ; Miki Hermann [France]Meta-rule synthesis from crossed rewrite systems
003255 (1990) Miki Hermann [France]Chain properties of rule closures
003351 (1989) Miki Hermann [France]Chain properties of rule closures

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Author.i -k "Miki Hermann" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Author.i  \
                -Sk "Miki Hermann" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Author.i
   |clé=    Miki Hermann
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022