|
Search the dblp DataBase
Jean-Pierre Ressayre:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jean-Pierre Ressayre
Polynomial Time Uniformization and Non-standard Methods. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1996, v:16, n:, pp:75-88 [Journal]
- Olivier Finkel, Jean-Pierre Ressayre
Stretchings. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1996, v:61, n:2, pp:563-585 [Journal]
- M. H. Mourgues, Jean-Pierre Ressayre
Every Real Closed Field Has an Integer Part. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1993, v:58, n:2, pp:641-647 [Journal]
- Jean-Pierre Ressayre
Formal Languages Defined by the Underlying Structure of their Words. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1988, v:53, n:4, pp:1009-1026 [Journal]
- J. Duparc, Olivier Finkel, Jean-Pierre Ressayre
Computer science and the fine structure of Borel sets. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:257, n:1-2, pp:85-105 [Journal]
- Jean-Pierre Ressayre
Weak Arithmetics. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:257, n:1-2, pp:1-15 [Journal]
- Jean-Pierre Ressayre
Winning strategies for infinite games: from large cardinals to computer science extended abstract. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:322, n:1, pp:175-179 [Journal]
Bootstrapping, part I. [Citation Graph (, )][DBLP]
On Infinite Real Trace Rational Languages of Maximum Topological Complexity [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|