Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Teeft.i » - entrée « Nite »
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.
Nitary sort < Nite < Nite algebra  Facettes :

List of bibliographic references indexed by Nite

Number of relevant bibliographic references: 38.
[0-20] [0 - 20][0 - 38][20-37][20-40]
Ident.Authors (with country if any)Title
001E50 (2012) Gaetan BissonComputing endomorphism rings of elliptic curves under the GRH
001E56 (2012) J. Remacle [Belgique] ; J. Lambrechts [Belgique] ; B. Seny [Belgique] ; E. Marchandise [Belgique] ; A. Johnen [Belgique] ; C. Euzainet [Belgique]Blossom‐Quad: A non‐uniform quadrilateral mesh generator using a minimum‐cost perfect‐matching algorithm
003A20 (2009) Naohi Eguchi [Japon]A lexicographic path order with slow growing derivation bounds
004349 (2008) Ren Schott [France] ; George Stacey Staples [États-Unis]Nilpotent adjacency matrices, random graphs and quantum random variables
004C77 (2007) Francis Comets [France] ; François Delarue [France] ; René Schott [France]Distributed algorithms in an ergodic Markovian environment
005421 (2006) Boniface Nkemzi [Cameroun]On the solution of Maxwell's equations in polygonal domains
006250 (2005) Olivier Bournez ; Felipe Cucker ; Paulin Jacobe De Naurois ; Jean-Yves MarionImplicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
006315 (2005) Yann Guermeur [France] ; André Elisseeff [Allemagne] ; Dominique Zelus [Argentine]A comparative study of multi‐class support vector machines in the unifying framework of large margin classifiers
007994 (2003) Didier Galmiche ; Daniel Me RySemantic Labelled Tableaux for Propositional BI⊥
008813 (2002) Nadine Guillotin-Plantard [France] ; René Schott [France]Distributed algorithms with dynamical random transitions
009254 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
009262 (2001) H. Cirstea [France] ; K. Kirchner [France]The rewriting calculus - part I
009320 (2001) N. Peltier [France]On the decidability of the PVD class with equality
009389 (2001) He Le Ne Kirchner ; Peter D. MossesAlgebraic Specifications, Higher‐order Types and Set‐theoretic Models
009400 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
009D07 (2000) Hélène Kirchner [France] ; Isabelle Gnaedig [France]Termination and normalisation under strategy Proofs in ELAN
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D40 (2000) Jianyang Zhou [France]Introduction to the constraint language NCL
009D45 (2000) Christophe Ringeissen [France]Handling Relations over Finite Domains in the Rule-Based System ELAN
009D69 (2000) Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]A reflective extension of ELAN
009E76 (2000) Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]Invariants, Patterns and Weights for Ordering Terms

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i -k "Nite" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Nite" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Teeft.i
   |clé=    Nite
}}

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