0304-3959 < 0304-3975 < 0304-4149

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 0304-3975

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

Ident.	Authors (with country if any)	Title
005589 (2006)	Alexander Knapp [Allemagne] ; Stephan Merz [France] ; Martin Wirsing [Allemagne] ; Julia Zappe [Allemagne, France]	Specification and refinement of mobile systems in MTLA and mobile UML
005603 (2006)	Abdessamad Imine [France] ; Michaël Rusinowitch [France] ; Gérald Oster [France] ; Pascal Molli [France]	Formal design and verification of operational transformation algorithms for copies convergence
005604 (2006)	Dominique Cansell [France] ; Dominique Méry [France]	Formal and incremental construction of distributed algorithms : On the distributed reference counting algorithm
005612 (2006)	Manin Abadi [États-Unis] ; Véronique Cortier [France]	Deciding knowledge in security protocols under equational thoories
005617 (2006)	Michael Backes [Allemagne] ; Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Mathieu Turuani [France]	Compositional analysis of contract-signing protocols
005623 (2006)	Nachum Dershowitz [Israël] ; Claude Kirchner [France]	Abstract canonical presentations
005C23 (2005)	Hubert Comon-Lundh [France] ; Véronique Cortier [France]	Tree automata with one memory, set constraints and cryptographic protocols
006370 (2005)	Olivier Bournez [France] ; Emmanuel Hainry [France]	Elementarily computable functions over the real numbers and R-sub-recursive functions
006380 (2005)	Yannick Chevalier [France] ; Ralf Küsters [Allemagne] ; Michaël Rusinowitch [France] ; Mathieu Turuani [France]	An NP decision procedure for protocol insecurity with XOR
006761 (2004)	Jean-Yves Marion [France]	Editorial : Implicit Computational Complexity (ICC)
006762 (2004)	Michel Habib [France] ; Eric Thierry [France] ; Lhouari Nourine ; O. Raynaud	Computational aspects of the 2-dimension of partially ordered sets
006C83 (2004)		Implicit computational complexity
006C87 (2004)	René Schott [France] ; Jean-Claude Spehner [France]	Two optimal parallel algorithms on the commutation class of a word
006C90 (2004)	Patrick Baillot [France]	Stratified coherence spaces: a denotational semantics for light linear logic
006C91 (2004)	Yves Lafont [France]	Soft linear logic and polynomial time
006C92 (2004)	S. Bellantoni [Canada] ; I. Oitavem [Portugal]	Separating NC along the δ axis
006C94 (2004)	M. Hofmann [Allemagne] ; P. J. Scott [Canada]	Realizability models for BLL-like languages
006C99 (2004)	L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne]	On the computational complexity of imperative programming languages
006D00 (2004)	James S. Royer [États-Unis]	On the computational complexity of Longley's H functional
006D01 (2004)	A. S. Murawski [Royaume-Uni] ; C.-H. L. Ong [Royaume-Uni]	On an interpretation of safe recursion in light affine logic
006D02 (2004)	N. Danner [États-Unis] ; C. Pollett [États-Unis]	Minimization and NP multifunctions

---

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/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/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    ISSN.i
   |clé=    0304-3975
}}

---

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