Compuserve < Comput < Comput chem

Facettes : Author.f AffOrg.f AffPays.f AffRegion.f AffVille.f Teeft.f

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000172 (2013)	Sergei O. Kuznetsov [Russie] ; Jonas Poelmans [Russie, Belgique]	Knowledge representation and processing with formal concept analysis
000595 (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
000B26 (2009)	Nelson H. F. Beebe [États-Unis]	A new math library
001C58 (2002)	Nicodème Paul [France] ; Didier Rognan [France]	ConsDock: A new program for the consensus analysis of protein–ligand interactions
001E06 (2001)	Vincent D. Blondel [Belgique] ; Olivier Bournez [France] ; Pascal Koiran [France] ; John N. Tsitsiklis	The Stability of Saturated Linear Dynamical Systems Is Undecidable
001E76 (2001)	François Fages [France] ; Paul Ruet [France] ; Sylvain Soliman [France]	Linear Concurrent Constraint Programming: Operational and Phase Semantics
001E94 (2001)	Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. Mcconnell	Efficient and Practical Algorithms for Sequential Modular Decomposition
001F04 (2001)		Current Awareness
001F42 (2001)	Sorin Stratulat [France]	A General Framework to Build Contextual Cover Set Induction Provers
001F63 (2000)	Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]	Specification and proof in membership equational logic
001F70 (2000)	Didier Galmiche [France] ; David J. Pym [Royaume-Uni]	Proof-search in type-theoretic languages: an introduction
001F76 (2000)	Raphaël Couturier [France] ; Christophe Chipot [France]	Parallel molecular dynamics using OpenMP on a shared memory machine
002009 (2000)	D. Galmiche [France]	Connection methods in linear logic and proof nets construction
002057 (2000)	Miki Hermann [France] ; Phokion G. Kolaitis	Unification Algorithms Cannot Be Combined in Polynomial Time
002108 (2000)	Jordi Levy [Espagne] ; Margus Veanes [Colombie]	On the Undecidability of Second-Order Unification
002129 (2000)	Ursula Martin [Royaume-Uni] ; Duncan Shand [Royaume-Uni]	Invariants, Patterns and Weights for Ordering Terms
002134 (2000)	Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]	Induction=I-Axiomatization+First-Order Consistency
002137 (2000)	Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]	Higher Order Unification via Explicit Substitutions
002175 (2000)	Ricardo Caferra [France] ; Nicolas Peltier	Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
002231 (1999)	Jean-Pierre Thomesse [France]	Fieldbuses and interoperability
002455 (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/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i -k "Comput" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i  \
                -Sk "Comput" \
         | 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=    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