Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

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-3800 < 0304-3975 < 0305-0548  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 75.
[20-40] [0 - 20][0 - 50][40-60]
Ident.Authors (with country if any)Title
000568 (2004) Yves Lafont [France]Soft linear logic and polynomial time
000569 (2004) S. Bellantoni [Canada] ; I. Oitavem [Portugal]Separating NC along the δ axis
000576 (2004) M. Hofmann [Allemagne] ; P. J. Scott [Canada]Realizability models for BLL-like languages
000584 (2004) L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne]On the computational complexity of imperative programming languages
000585 (2004) James S. Royer [États-Unis]On the computational complexity of Longley's H functional
000586 (2004) A. S. Murawski [Royaume-Uni] ; C.-H. L. Ong [Royaume-Uni]On an interpretation of safe recursion in light affine logic
000591 (2004) N. Danner [États-Unis] ; C. Pollett [États-Unis]Minimization and NP multifunctions
000595 (2004) Jean-Pierre Duval [France] ; Roman Kolpakov [Royaume-Uni] ; Gregory Kucherov [France] ; Thierry Lecroq [France] ; Arnaud Lefebvre [France]Linear-time computation of local periods
000597 (2004) Daniel Leivant [États-Unis]Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion
000625 (2004) Ralph Benzinger [États-Unis]Automated higher-order complexity analysis
000629 (2004) Klaus Aehlig [Allemagne] ; Ulrich Berger [Royaume-Uni] ; Martin Hofinann [Allemagne] ; Helmut Schwichtenberg [Allemagne]An arithmetic for non-size-increasing polynomial-time computation
000638 (2004) Damien Eveillard [France] ; Delphine Ropers [France] ; Hidde De Jong [France] ; Christiane Branlant [France] ; Alexander Bockmayr [France]A multi-scale constraint programming model of alternative splicing regulation
000662 (2003) Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France]Weak-order extensions of an order
000663 (2003) Cesare Tinelli [États-Unis] ; Christophe Ringeissen [France]Unions of non-disjoint theories and combinations of satisfiability procedures
000680 (2003) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol insecurity with a finite number of sessions and composed keys is NP-complete
000685 (2003) F. Laroussinie [France] ; Ph. Schnoebelen [France] ; M. Turuani [France]On the expressivity and complexity of quantitative branching-time temporal logics
000693 (2003) Lutz Strassburger [France]MELL in the calculus of structures
000703 (2003) Roman Kolpakov [Russie] ; Gregory Kucherov [France]Finding approximate repetitions under Hamming distance
000713 (2003) Robert Cori [France] ; Gilles Schaeffer [France]Description trees and Tutte formulas
000738 (2003) Dominique Poulalhon [France] ; Gilles Schaeffer [France]A bijection for triangulations of a polygon with interior points and multiple edges
000788 (2002) Adel Bouhoula [Tunisie] ; Michaël Rusinowitch [France]Observational proofs by rewriting

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/ISSN.i -k "0304-3975" 
HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/ISSN.i  \
                -Sk "0304-3975" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    ISSN.i
   |clé=    0304-3975
}}

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