ISSN
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur les relations entre la France et l'Australie - Exploration (Accueil)

Index « ISSN » - entrée « 0304-3975 »
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.
0304-3959 < 0304-3975 < 0304-3991  Facettes :

List of bibliographic references indexed by 0304-3975

Number of relevant bibliographic references: 14.
Ident.Authors (with country if any)Title
007414 (2010) Tayssir Touili [France] ; MOHAMED FAOUZI ATIG [France]Verifying parallel programs with dynamic communication structures
007650 (2010) Pierre-Cyrille Heam [France] ; Cyril Nicaud [France] ; Sylvain Schmitz [France]Parametric random generation of deterministic tree automata
007A61 (2010) Pascal Caron [France] ; Jean-Marc Champarnaud [France] ; Ludovic Mignot [France]Acyclic automata and small expressions using multi-tilde-bar operators
008184 (2009) Michael R. Fellows [Australie] ; Danny Hermelin [Israël] ; Frances Rosamond [Australie] ; Stéphane Vialette [France]On the parameterized complexity of multiple-interval graph problems
008241 (2009) Michael J. Maher [Australie]Local consistency for extended CSPs
008337 (2009) Jean-Yves Audibert [France] ; Rémi Munos [France] ; Csaba Szepesvari [Canada]Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
008B53 (2008) Daniil Ryabko [Suisse, France] ; Marcus Hutter [Australie]On the possibility of learning in reactive environments with arbitrary dependence
009B66 (2006) Markus Lohrey [Allemagne] ; Sebastian Maneth [Australie]The complexity of tree automata and XPath on grammar-compressed trees
009C80 (2006) M. Hill [Australie] ; I. Robinson [Australie]Quadrature using 64-bit IEEE arithmetic for integrands over [0,1] with a singularity at 1
00AA75 (2004) Alan R. Woods [Australie]Subset sum "cubes" and the complexity of primality testing
00B112 (2003) Henning Fernau [Australie]Nonterminal complexity of programmed grammars
00C179 (2000) M. W. Bunder [Australie]Proof finding algorithms for implicational logics
00C423 (1999) Costas S. Iliopoulos [Royaume-Uni, Australie] ; Laurent Mouchard [Royaume-Uni, France]Quasiperiodicity and string covering
00CE18 (1997) Carl Pomerance [États-Unis] ; John Michael Robson [Australie, France] ; Jeffrey Shallit [Canada]Automaticity II: Descriptional complexity in the unary case

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/ISSN.i -k "0304-3975" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/ISSN.i  \
                -Sk "0304-3975" \
         | 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/Asie
   |area=    AustralieFrV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    ISSN.i
   |clé=    0304-3975
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024