RR.bib

@comment{{This file has been generated by bib2bib 1.95}}

@comment{{Command line: bib2bib -c $type="TECHREPORT" ../CV/publis.bib -ob RR.bib}}

@techreport{RT-0242,
  author = {Emmanuel Jeandel},
  title = {Évaluation rapide de fonctions hypergéométriques},
  institution = {INRIA - ENS Lyon},
  year = {2000},
  number = {RT-0242},
  download = {http://www.inria.fr/rrrt/rt-0242.html},
  abstract = {Nous présentons ici l'implantation des fonctions
  hypergéométriques dans la bibliothèque MPFR. Ceci a été effectué à l'aide de la méthode Binary Splitting. Un algorithme générique a donc été créé, qui a permis l'amélioration de l'exponentielle, de certaines constantes, et l'implantation du sinus et du cosinus. Nous exposons l'algorithme pour le cas rationnel, puis nous montrons comment ce cas particulier permet d'obtenir l'exponentielle. Nous utilisons ensuite une méthode similaire pour les autres fonctions. Les expériences montrent que la méthode est plus efficace que celles employées précédemment dans MPFR.},
  keywords = {Fonctions hypergéométriques, binary-splitting, bibliothèque MPFR}
}

@techreport{RR2003-24,
  author = {Vincent D. Blondel and Emmanuel Jeandel and Pascal Koiran and Natacha Portier},
  title = {{Decidable and undecidable problems about quantum automata.}},
  institution = {LIP, ENS Lyon},
  year = {2003},
  abstract = {We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or non-strict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata for which it is known that strict and non-strict thresholds both lead to undecidable problems.},
  download = {LIP/RR/RR2003/RR2003-24.ps.gz},
  directdownload = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2003/RR2003-24.ps.gz},
  number = {RR2003-24},
  month = apr,
  keywords = {Quantum Computing, Automaton, Decidability.}
}

@techreport{RR2003-39,
  author = {Harm Derksen and Emmanuel Jeandel and Pascal Koiran},
  title = {{Quantum automata and algebraic groups}},
  institution = {LIP, ENS Lyon},
  year = {2003},
  abstract = {We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.},
  keywords = {Quantum Automata, Probabilistic Automata, Undecidability, Algebraic Groups, Algebraic Geometry.},
  download = {LIP/RR/RR2003/RR2003-39.ps.gz},
  directdownload = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2003/RR2003-39.ps.gz},
  number = {RR2003-39},
  month = {July}
}

@techreport{CCSD-00013788,
  author = {Emmanuel Jeandel and Nicolas Ollinger},
  title = {{Playing with Conway's Problem}},
  institution = { Laboratoire d'informatique Fondamentale de Marseille},
  year = {2005},
  abstract = {The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a lot of attention. In Kunc 2005, a strong negative answer to this problem was given by showing that even complete co-recursively enumerable centralizers exist for finite languages. Using a combinatorial game approach, we give here an incremental construction of rational languages embedding any recursive computation in their centralizers.},
  keywords = {Conway's problem;commutation;centralizer;game theory},
  download = {http://hal.ccsd.cnrs.fr/view_by_stamp.php?label=LIF&action_todo=view&id=ccsd-00013788&version=1},
  number = {ccsd-00013788}
}

@techreport{RR2006-05,
  author = { Pierre Charbit and Emmanuel Jeandel and Pascal Koiran and  Sylvain Perifel and St\'ephan Thomass\'e},
  title = {{Finding a Vector Orthogonal to Roughly Half a Collection of Vectors.}},
  institution = {LIP, ENS Lyon},
  year = {2006},
  keywords = {Algebraic complexity, decision trees, parallel algorithms, derandomization},
  abstract = {Dimitri Grigoriev has shown that for any family of $N$ vectors
  in the $d$-dimensional linear space $E=(F_2^d)$, there exists a vector in $E$ which is orthogonal to at least $N/3$ and at most $2N/3$ vectors of the family. We show that the range $[N/3,2N/3]$ can be replaced by the much smaller range $[N/2-\sqrt{N}/2,N/2+\sqrt{N}/2]$ and we give an efficient, deterministic parallel algorithm which finds a vector achieving this bound. The optimality of the bound is also investigated.},
  download = {LIP/RR/RR2006/RR2006-05.ps.gz},
  directdownload = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-05.ps.gz},
  number = {RR2006-05},
  month = jan
}