Random Walks on Trees. - René Schott (CAAP, 1986)

On mobile robots: A probabilistic model for the representation and manipulation of spatial uncertainty. - René Schott (ICRA, 1987)

Analysis of Dynamic Algorithms in D. E. Knuth's Model. - Jean Françon; B. Randrianarimanana; René Schott (CAAP, 1988)

Dynamic Data Structures with Finite Population: A Combinatorial Analysis. - Jean Françon; B. Randrianarimanana; René Schott (FCT, 1989)

Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis. - Guy Louchard; B. Randrianarimanana; René Schott (ICALP, 1989)

Discs and Other Related Data Structures. - Fabrizio Luccio; Mireille Régnier; René Schott (WADS, 1989)

Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series. - Philippe Flajolet; René Schott (Eur. J. Comb., 1990)

Analysis of Dynamic Algorithms in Knuth's Model. - Jean Françon; B. Randrianarimanana; René Schott (Theor. Comput. Sci., 1990)

Probabilistic Analysis of Some Distributed Algorithms. - Guy Louchard; René Schott (Random Struct. Algorithms, 1991)

Applications of Random Sampling to On-line Algorithms in Computational Geometry. - Jean-Daniel Boissonnat; Olivier Devillers; René Schott; Monique Teillaud; Mariette Yvinec (Discret. Comput. Geom., 1992)

Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis. - Guy Louchard; B. Randrianarimanana; René Schott (Theor. Comput. Sci., 1992)

Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions. - Robert S. Maier 001; René Schott (FCT, 1993)

The Exhaustion of Shared Memory: Stochastic Results. - Robert S. Maier 001; René Schott (WADS, 1993)

Determining the Majority. - Laurent Alonso; Edward M. Reingold; René Schott (Inf. Process. Lett., 1993)

Random generation of trees - random generators in computer science. - Laurent Alonso; René Schott (Kluwer, 1995)

Random Generation of Colored Trees. - Laurent Alonso; René Schott (LATIN, 1995)

An Operator Calculus Approach to the Evolution of Dynamic Data Structures. - Philip Feinsilver; René Schott (MFCS, 1995)

Parallel Searching in the Plane. - Ricardo A. Baeza-Yates; René Schott (Comput. Geom., 1995)

Multidimensional Divide-and-Conquer Maximin Recurrences. - Laurent Alonso; Edward M. Reingold; René Schott (SIAM J. Discret. Math., 1995)

Implementing non-linear constraints with cooperative solvers. - Éric Monfroy; Michaël Rusinowitch; René Schott (SAC, 1996)

Optimal Operations on Red-Black Trees. - Lin Chen 001; René Schott (Int. J. Found. Comput. Sci., 1996)

A Markovian Concurrency Measure. - Dominique Geniet; René Schott; Loÿs Thimonier (RAIRO Theor. Informatics Appl., 1996)

Combinatorial Interpretation and Operator Calculus of Lommel Polynomials. - Philip Feinsilver; John P. McSorley; René Schott (J. Comb. Theory A, 1996)

The average complexity of a coin-weighing problem. - Laurent Alonso; Philippe Chassaing; René Schott (Random Struct. Algorithms, 1996)

A Parallel Algorithm for the Generation of a Permutation and Applications. - Laurent Alonso; René Schott (Theor. Comput. Sci., 1996)

On the computation of polynomial representations of nilpotent Lie groups: a symbolic mathematical approach. - Philip Feinsilver; Uwe Granz; René Schott (SAC, 1997)

A Linear-Time Algorithm for the Generation of Trees. - Laurent Alonso; Jean-Luc Rémy; René Schott (Algorithmica, 1997)

Uniform Generation of a Schröder Tree. - Laurent Alonso; Jean-Luc Rémy; René Schott (Inf. Process. Lett., 1997)

The Average-Case Complexity of Determining the Majority. - Laurent Alonso; Edward M. Reingold; René Schott (SIAM J. Comput., 1997)

Data Structures' Maxima. - Guy Louchard; Claire Kenyon; René Schott (SIAM J. Comput., 1997)

Formal power series, operator calculus, and duality on Lie algebras. - Philip Feinsilver; René Schott (Discret. Math., 1998)

Computing Representations of a Lie Group via the Universal Enveloping Algebra. - Philip Feinsilver; René Schott (J. Symb. Comput., 1998)

Mobile Robotics Planning Using Abstract Markov Decision Processes. - Pierre Laroche; François Charpillet; René Schott (ICTAI, 1999)

Probabilistic and statistical methods in computer science. - Jean-François Mari; René Schott (Kluwer, 2001)

A new decomposition technique for solving Markov decision processes. - Pierre Laroche; Yann Boniface; René Schott (SAC, 2001)

On the tree inclusion problem. - Laurent Alonso; René Schott (Acta Informatica, 2001)

Distributed algorithms with dynamical random transitions. - Nadine Guillotin-Plantard; René Schott (Random Struct. Algorithms, 2002)

New hybrid genetic algorithms for the frequency assignment problem. - Miguel Alabau; Lhassane Idoumghar; René Schott (IEEE Trans. Broadcast., 2002)

Hardware realization of Krawtchouk transform using VHDL modeling and FPGAs. - Nazeih M. Botros; Jian Yang; Philip Feinsilver; René Schott (IEEE Trans. Ind. Electron., 2002)

On the Minimal Automaton of the Shuffle of Words and Araucarias. - René Schott; Jean-Claude Spehner (MCU, 2004)

Application Of Markov Decision Processes To The Frequency Assignment Problem. - Jean-Yves Greff; Lhassane Idoumghar; René Schott (Appl. Artif. Intell., 2004)

Quicksort with Unreliable Comparisons: A Probabilistic Analysis. - Laurent Alonso; Philippe Chassaing; Florent Gillet; Svante Janson; Edward M. Reingold; René Schott (Comb. Probab. Comput., 2004)

The worst-case chip problem. - Laurent Alonso; Philippe Chassaing; Edward M. Reingold; René Schott (Inf. Process. Lett., 2004)

Two optimal parallel algorithms on the commutation class of a word. - René Schott; Jean-Claude Spehner (Theor. Comput. Sci., 2004)

Throwing Stones Inside Simple Polygons . - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (AAIM, 2006)

Operator Calculus Approach to Solving Analytic Systems. - Philip Feinsilver; René Schott (AISC, 2006)

A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem. - Lhassane Idoumghar; René Schott (ICTAI, 2006)

Shuffle of Words and Araucaria Trees. - René Schott; Jean-Claude Spehner (Fundam. Informaticae, 2006)

Data structures with dynamical random transitions. - Clément Dombry; Nadine Guillotin-Plantard; Bruno Pinçon; René Schott (Random Struct. Algorithms, 2006)

Erratum for "Shuffle of Words and Araucaria Trees". - René Schott; Jean-Claude Spehner (Fundam. Informaticae, 2007)

Parabola Separation Queries and their Application to Stone Throwing. - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (Int. J. Comput. Geom. Appl., 2007)

Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach. - Philip Feinsilver; René Schott (Math. Comput. Sci., 2007)

Distributed algorithms in an ergodic Markovian environment. - Francis Comets; François Delarue; René Schott (Random Struct. Algorithms, 2007)

Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs. - John P. McSorley; Philip Feinsilver; René Schott (Ars Comb., 2008)

Partitions and Clifford algebras. - René Schott; G. Stacey Staples (Eur. J. Comb., 2008)

Two Distributed Algorithms for the Frequency Assignment Problem in the Field of Radio Broadcasting. - Lhassane Idoumghar; René Schott (IEEE Trans. Broadcast., 2009)

Computational Complexity Reductions Using Clifford Algebras. - René Schott; G. Stacey Staples (Geometric Algebra Computing, 2010)

On Krawtchouk Transforms. - Philip Feinsilver; René Schott (AISC/MKM/Calculemus, 2010)

Genetic Heuristics for Reducing Memory Energy Consumption in Embedded Systems. - Maha Idrissi-Aouad; René Schott; Olivier Zendra (ICSOFT (2), 2010)

Metropolis Particle Swarm Optimization Algorithm with Mutation Operator for Global Optimization Problems. - Lhassane Idoumghar; Maha Idrissi-Aouad; Mahmoud Melkemi; René Schott (ICTAI (1), 2010)

Hybrid Heuristics for Optimizing Energy Consumption in Embedded Systems. - Maha Idrissi-Aouad; René Schott; Olivier Zendra (ISCIS, 2010)

Deploying Wireless Sensors for Differentiated Coverage and Probabilistic Connectivity. - Yanjun Li 004; Yeqiong Song; Yi-hua Zhu 001; René Schott (WCNC, 2010)

On the Complexity of Cycle Enumeration for Simple Graphs. - René Schott; G. Stacey Staples (Guide to Geometric Algebra in Practice, 2011)

Hybrid PSO-SA Type Algorithms for Multimodal Function Optimization and Reducing Energy Consumption in Embedded Systems. - Lhassane Idoumghar; Mahmoud Melkemi; René Schott; Maha Idrissi-Aouad (Appl. Comput. Intell. Soft Comput., 2011)

Nilpotent Adjacency Matrices and Random Graphs. - René Schott; G. Stacey Staples (Ars Comb., 2011)

Complexity of counting cycles using zeons. - René Schott; G. Stacey Staples (Comput. Math. Appl., 2011)

Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation. - Hugo Cruz-Sanchez; G. Stacey Staples; René Schott; Yeqiong Song (GLOBECOM, 2012)

Steps toward the design of hybrid metaheuristics for the multi-objective frequency assignment problem in broadcasting. - Akram Bedoui; Philippe Debreux; Lhassane Idoumghar; René Schott; Thierry Schott (ISTT, 2014)

Information Transmission under Random Emission Constraints. - Francis Comets; François Delarue; René Schott (Comb. Probab. Comput., 2014)

An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks. - Bilel Nefzi; René Schott; Yeqiong Song; George Stacey Staples; Evangelia Tsiontsiou (MobiHoc, 2015)

New Path Centrality Based on Operator Calculus Approach for Wireless Sensor Network Deployment. - Abdusy Syarif; Abdelhafid Abouaissa; Lhassane Idoumghar; Pascal Lorenz; René Schott; G. Stacey Staples (IEEE Trans. Emerg. Top. Comput., 2019)