Serveur d'exploration sur la recherche en informatique en Lorraine - 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-4149  Facettes :

List of bibliographic references indexed by 0304-3975

Number of relevant bibliographic references: 117.
[0-50] [0 - 20][0 - 50][50-70]
Ident.Authors (with country if any)Title
000112 (2016) Eric Domenjoud [France] ; Xavier Provençal [France] ; Laurent Vuillon [France]Palindromic language of thin discrete planes
000680 (2015) Laura Bozzelli [Espagne] ; Hans Van Ditmarsch [France] ; Sophie Pinchinat [France]The complexity of one-agent refinement modal logic
000686 (2015) Guillaume Bonfante [France] ; Florian Deloup [France] ; Antoine Henrot [France]Real or Natural numbers interpretations and their effect on complexity
001376 (2013) Vincent Cheval [Royaume-Uni] ; Véronique Cortier [France] ; Stéphanie Delaune [France]Deciding equivalence-based properties using constraint solving
001394 (2013) Andrés Cord N-Franco [Espagne] ; Hans Van Ditmarsch [France] ; David Fernández Duque [Espagne] ; Fernando Soler-Toscano [Espagne]A colouring protocol for the generalized Russian cards problem
001841 (2012-11-27) Romain Péchoux [France]Synthesis of sup-interpretations: a survey
001959 (2012-09-07) Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]Loops and overloops for Tree Walking Automata
002508 (2011) Pierre-Cyrille Heam [France]On the Complexity of Computing the Profinite Closure of a Rational Language
002804 (2011) G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France]Quasi-interpretations a way to control resources
002805 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
002807 (2011) D. Jamet [France] ; G. Paquin [France] ; G. Richomme [France] ; L. Vuillon [France]On the fixed points of the iterated pseudopalindromic closure operator
002812 (2011) S. Chevillard [France] ; J. Harrison [États-Unis] ; M. Joldes [France] ; Ch. Lauter [France]Efficient and accurate computation of upper bounds of approximation errors
002E78 (2010) Pierre-Cyrille Heam [France] ; Cyril Nicaud [France] ; Sylvain Schmitz [France]Parametric Random Generation of Deterministic Tree Automata
003169 (2010) Yannick Chevalier [France] ; Michael Rusinowitch [France]Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
003734 (2009) Alessio Guglielmi [France]Personal Portrait of Giorgio Levi
004449 (2008) S. Brlek [Canada] ; D. Jamet [France] ; G. Paquin [Canada]Smooth words on 2-letter alphabets having same parity
004452 (2008) Elias P. Tsigaridas [France] ; Ioannis Z. Emiris [Grèce]On the complexity of real root isolation using continued fractions
004D50 (2007) Jérome Besombes [France] ; Jean-Yves Marion [France]Learning tree languages from positive examples and membership queries
004D51 (2007) Pierre Arnoux [France] ; Valérie Berthe [France] ; Thomas Fernique [France] ; Damien Jamet [France]Functional stepped surfaces, flips, and generalized substitutions
005261 (2006) Véronique Cortier [France] ; Martin Abadi [États-Unis]Deciding knowledge in security protocols under equational theories.
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. RaynaudComputational 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
006D04 (2004) Jean-Pierre Duval [France] ; Roman Kolpakov [Royaume-Uni] ; Gregory Kucherov [France] ; Thierry Lecroq [France] ; Arnaud Lefebvre [France]Linear-time computation of local periods
006D05 (2004) Daniel Leivant [États-Unis]Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion
006D20 (2004) Ralph Benzinger [États-Unis]Automated higher-order complexity analysis
006D23 (2004) Klaus Aehlig [Allemagne] ; Ulrich Berger [Royaume-Uni] ; Martin Hofinann [Allemagne] ; Helmut Schwichtenberg [Allemagne]An arithmetic for non-size-increasing polynomial-time computation
006D26 (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
007450 (2003) Denys Duchier [France]Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment
007453 (2003) Guillaume Hanrot [France] ; Joel Rivat [France] ; Gérald Tenenbaum [France] ; Paul Zimmermann [France]Density results on floating-point invertible numbers
007B38 (2003) Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France]Weak-order extensions of an order
007B39 (2003) Cesare Tinelli [États-Unis] ; Christophe Ringeissen [France]Unions of non-disjoint theories and combinations of satisfiability procedures
007B50 (2003) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol insecurity with a finite number of sessions and composed keys is NP-complete

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
}}

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