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

Index « ISSN » - entrée « 1432-4350 »
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.
1432-2994 < 1432-4350 < 1432-5195  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 14.
Ident.Authors (with country if any)Title
000158 (2016) Stephane Demri [France] ; Didier Galmiche [France] ; Dominique Larchey-Wendling [France] ; Daniel Mery [France]Separation Logic with One Quantified Variable
001E03 (2012) Jean-Yves Marion [France] ; Thomas Schwentick [Allemagne, États-Unis]Theoretical Aspects of Computer Science
001E09 (2012) Nazim Fatès [France]Stochastic Cellular Automata Solutions to the Density Classification Problem
001F35 (2012) Jean-Yves Marion [France] ; Thomas Schwentick [Allemagne]Theoretical Aspects of Computer Science
002549 (2011) Peter Gacs [États-Unis] ; Mathieu Hoyrup [France] ; Cristobal Rojas [Canada]Randomness on Computable Probability Spaces—A Dynamical Point of View
003096 (2010) Susanne Albers [Allemagne] ; Jean-Yves Marion [France]Preface: Special Issue on Theoretical Aspects of Computer Science (STACS)
006E20 (2004) Manfred Schmidt-Schau [Allemagne] ; Jürgen Stuber [France]The Complexity of Linear and Stratified Context Matching Problems
006F01 (2004) Foreword
007233 (2004) Manfred Schmidt-Schauss ; Jürgen Stuber [France]The complexity of linear and stratified context matching problems
008B87 (2002) O. Bournez ; M. Branicky [États-Unis]The Mortality Problem for Matrices of Low Dimensions
008C22 (2002) Cohen ; Fraigniaud ; MitjanaPolynomial-Time Algorithms for Minimum-Time Broadcast in Trees
008F99 (2002) Johanne Cohen [France] ; Pierre Fraigniaud [France] ; Margarita MitjanaPolynomial Time Algorithms for Minimum-Time Broadcast in Tree
009010 (2002) Olivier Bournez [France] ; Michael BranickyOn the mortality problem for matrices of low dimensions
00B341 (1999) Olivier Bournez [France]Some bounds on the computational power of piecewise constant derivative systems

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Merge/ISSN.i -k "1432-4350" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Merge/ISSN.i  \
                -Sk "1432-4350" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Merge/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    indexItem
   |index=    ISSN.i
   |clé=    1432-4350
}}

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