Compuserve < Comput < Comput chem

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f KwdFr.f Mesh.f MeshFr.f Teeft.f

List of bibliographic references indexed by Comput

Number of relevant bibliographic references: 50.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
001546 (2013)	Sergei O. Kuznetsov [Russie] ; Jonas Poelmans [Russie, Belgique]	Knowledge representation and processing with formal concept analysis
002695 (2011)	Matthieu Chavent [France] ; Antoine Vanel [France] ; Alex Tek [France] ; Bruno Levy [France] ; Sophie Robert [France] ; Bruno Raffin [France] ; Marc Baaden [France, Allemagne]	GPU‐accelerated atom and dynamic bond visualization using hyperballs: A unified algorithm for balls, sticks, and hyperboloids
003A19 (2009)	Nelson H. F. Beebe [États-Unis]	A new math library
008822 (2002)	Nicodème Paul [France] ; Didier Rognan [France]	ConsDock: A new program for the consensus analysis of protein–ligand interactions
009264 (2001)	Vincent D. Blondel [Belgique] ; Olivier Bournez [France] ; Pascal Koiran [France] ; John N. Tsitsiklis	The Stability of Saturated Linear Dynamical Systems Is Undecidable
009334 (2001)	François Fages [France] ; Paul Ruet [France] ; Sylvain Soliman [France]	Linear Concurrent Constraint Programming: Operational and Phase Semantics
009352 (2001)	Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. Mcconnell	Efficient and Practical Algorithms for Sequential Modular Decomposition
009362 (2001)		Current Awareness
009400 (2001)	Sorin Stratulat [France]	A General Framework to Build Contextual Cover Set Induction Provers
009D11 (2000)	Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]	Specification and proof in membership equational logic
009D18 (2000)	Didier Galmiche [France] ; David J. Pym [Royaume-Uni]	Proof-search in type-theoretic languages: an introduction
009D24 (2000)	Raphaël Couturier [France] ; Christophe Chipot [France]	Parallel molecular dynamics using OpenMP on a shared memory machine
009D56 (2000)	D. Galmiche [France]	Connection methods in linear logic and proof nets construction
009E04 (2000)	Miki Hermann [France] ; Phokion G. Kolaitis	Unification Algorithms Cannot Be Combined in Polynomial Time
009E55 (2000)	Jordi Levy [Espagne] ; Margus Veanes [Colombie]	On the Undecidability of Second-Order Unification
009E76 (2000)	Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]	Invariants, Patterns and Weights for Ordering Terms
009E81 (2000)	Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]	Induction=I-Axiomatization+First-Order Consistency
009E84 (2000)	Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]	Higher Order Unification via Explicit Substitutions
009F22 (2000)	Ricardo Caferra [France] ; Nicolas Peltier	Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
00A846 (1999)	Jean-Pierre Thomesse [France]	Fieldbuses and interoperability
00AA69 (1999)	Stéphane Gobron [Japon] ; Norishige Chiba	3D surface cellular automata and their applications

---

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 "Comput" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Comput" \
         | 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é=    Comput
}}

---

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