Jean-Yves Greff < Jean-Yves Marion < Jean-Yves Moyen

Facettes : Author.f

List of bibliographic references

Number of relevant bibliographic references: 36.
[0-20] [0 - 20][0 - 36][20-35][20-40]

Ident.	Authors (with country if any)	Title
000104 (2005)	Guillaume Bonfante ; Jean-Yves Marion ; Jean-Yves Moyen ; Romain Péchoux	Synthesis of Quasi-interpretations
000247 (2005)	Guillaume Bonfante ; Jean-Yves Marion ; Jean-Yves Moyen	Quasi-interpretations and small space bounds
000275 (2005)	Jean-Yves Marion ; Romain Péchoux	Resource analysis by sup-interpretation
000304 (2005)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Implicit Complexity Over an Arbitrary Structure : Sequential and Parallel Polynomial Time
000334 (2005)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Logical Characterizations of P_\mathcal{K} and NP_\mathcal{K} Over an Arbitrary Structure K
000368 (2005)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Implicit Complexity over an Arbitrary Structure : Quantifier Alternations
000518 (2005)	Guillaume Bonfante ; Jean-Yves Marion ; Jean-Yves Moyen	Quasi-interpretation : a way to control ressources
000839 (2004)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
000896 (2003)	Jérome Besombes ; Jean-Yves Marion	Apprentissage des langages réguliers d'arbres à l'aide d'un expert
000962 (2003)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH
000969 (2003)	Jérome Besombes ; Jean-Yves Marion	Apprentissage des langages réguliers d'arbres et applications
000A94 (2003)	Mohamed El Habib ; Claude Kirchner ; Hélène Kirchner ; Jean-Yves Marion ; Stephan Merz	The QSL platform at LORIA
000B68 (2003)	Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves Marion	Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
000C03 (2003)	Jean-Yves Marion	Analysing the implicit complexity of programs
000D83 (2003)	Jean-Yves Marion ; Jean-Yves Moyen	Termination and resource analysis of assembly programs by Petri nets
000E66 (2002)	Olivier Bournez ; Paulin De Naurois ; Jean-Yves Marion	Safe Recursion and Calculus over an Arbitrary Structure
001111 (2002)	Jérôme Besombes ; Jean-Yves Marion	Learning regular tree languages with positive samples and queries
001133 (2002)	Serge Grigorieff ; Jean-Yves Marion	Kolmogorov complexity and non-determinism
001232 (2002)	Olivier Bournez ; Paulin De Naurois ; Jean-Yves Marion	Safe Recursion over an Arbitrary Structure : Deterministic Polynomial Time
001446 (2001)	Jérôme Besombes ; Jean-Yves Marion	Identification reversible dependency tree languages
001490 (2001)	Guillaume Bonfante ; Adam Cichon ; Jean-Yves Marion ; Hélène Touzet	Algorithms with Polynomial Interpretation Termination Proof

---

List of associated KwdEn.i

Nombre de documents	Descripteur
10	complexity
7	implicit complexity
3	blum shub smale model
2	blum shub et smale model
2	dependency
2	learning
2	ptime
2	quasi-interpretation
2	regular tree languages
2	safe recursion
1	Complexity
1	Computational complexity
1	DEXP-TIME
1	Decision procedures
1	EXP-TIME
1	Free lattices
1	LINSPACE
1	Linear Logic
1	PTIME
1	Polynomial interpretation
1	Predicative recurrence
1	Rewriting systems
1	Sequent Calculus
1	Stratified recursion
1	additive linear logic
1	algebraic grammar
1	arithmetic
1	bss model
1	categorial grammar
1	certified programs
1	complexity analysis
1	curry-howard
1	decision procedure
1	entropy
1	feasabilitity
1	free lattices
1	gold
1	gold model
1	grammar
1	grammatical inference
1	identification
1	kolmogorov complexity
1	kolmogorov-complexity non-determinism
1	learner/teacher paradigm
1	learning in the limit
1	lexicographic path ordering
1	logic
1	membership queries
1	non-determinism
1	non-size increasing
1	ordering
1	petri nets
1	platform
1	poly-space
1	polynomial interpretation
1	polynomial space certification
1	polynomial time
1	positifs samples
1	program analysis
1	program transformation
1	proof theoretic
1	proof-theory
1	qsl
1	quantification
1	quasi-interpretations
1	recursion complexity
1	regular tree language
1	ressource control
1	reversibility
1	reversible
1	rewriting polynomial-interpretations computational-complexity
1	rewriting system
1	runtime analysis
1	sequent calculus
1	size-change principle
1	synthesis problem
1	termination
1	termination analysis
1	termination ordering
1	termination ordering complexity ptime

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/Author.i -k "Jean-Yves Marion" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/Author.i  \
                -Sk "Jean-Yves Marion" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Crin
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Author.i
   |clé=    Jean-Yves Marion
}}

---

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