 | 2008 |
|---|
| 55 |       | John P. McSorley,
Philip Feinsilver,
René Schott:
Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs.
Ars Comb. 87: (2008) |
| 54 |  | René Schott,
G. Stacey Staples:
Partitions and Clifford algebras.
Eur. J. Comb. 29(5): 1133-1138 (2008) |
| 2007 |
|---|
| 53 | | René Schott,
Jean-Claude Spehner:
Erratum for "Shuffle of Words and Araucaria Trees".
Fundam. Inform. 81(4): 485-490 (2007) |
| 52 | | Otfried Cheong,
Hazel Everett,
Hyo-Sil Kim,
Sylvain Lazard,
René Schott:
Parabola Separation Queries and their Application to Stone Throwing.
Int. J. Comput. Geometry Appl. 17(4): 349-360 (2007) |
| 51 | | Philip Feinsilver,
René Schott:
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach.
Mathematics in Computer Science 1(2): 239-251 (2007) |
| 50 | | Francis Comets,
François Delarue,
René Schott:
Distributed algorithms in an ergodic Markovian environment.
Random Struct. Algorithms 30(1-2): 131-167 (2007) |
| 2006 |
|---|
| 49 | | Otfried Cheong,
Hazel Everett,
Hyo-Sil Kim,
Sylvain Lazard,
René Schott:
Throwing Stones Inside Simple Polygons .
AAIM 2006: 185-193 |
| 48 | | Philip Feinsilver,
René Schott:
Operator Calculus Approach to Solving Analytic Systems.
AISC 2006: 170-180 |
| 47 | | Lhassane Idoumghar,
René Schott:
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem.
ICTAI 2006: 18-25 |
| 46 | | René Schott,
Jean-Claude Spehner:
Shuffle of Words and Araucaria Trees.
Fundam. Inform. 74(4): 579-601 (2006) |
| 45 | | Clément Dombry,
Nadine Guillotin-Plantard,
Bruno Pinçon,
René Schott:
Data structures with dynamical random transitions.
Random Struct. Algorithms 28(4): 403-426 (2006) |
| 2004 |
|---|
| 44 | | René Schott,
Jean-Claude Spehner:
On the Minimal Automaton of the Shuffle of Words and Araucarias.
MCU 2004: 316-327 |
| 43 | | Jean-Yves Greff,
Lhassane Idoumghar,
René Schott:
Application Of Markov Decision Processes To The Frequency Assignment Problem.
Applied Artificial Intelligence 18(8): 761-773 (2004) |
| 42 | | Laurent Alonso,
Philippe Chassaing,
Florent Gillet,
Svante Janson,
Edward M. Reingold,
René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing 13(4-5): 419-449 (2004) |
| 41 | | Laurent Alonso,
Philippe Chassaing,
Edward M. Reingold,
René Schott:
The worst-case chip problem.
Inf. Process. Lett. 89(6): 303-308 (2004) |
| 40 | | René Schott,
Jean-Claude Spehner:
Two optimal parallel algorithms on the commutation class of a word.
Theor. Comput. Sci. 324(1): 107-131 (2004) |
| 2002 |
|---|
| 39 | | Nadine Guillotin-Plantard,
René Schott:
Distributed algorithms with dynamical random transitions.
Random Struct. Algorithms 21(3-4): 371-396 (2002) |
| 2001 |
|---|
| 38 | | Miguel Alabau,
Lhassane Idoumghar,
René Schott:
New Hybrid Genetic Algorithms for the Frequency Assignment Problem.
ICTAI 2001: 136- |
| 37 | | Pierre Laroche,
Yann Boniface,
René Schott:
A new decomposition technique for solving Markov decision processes.
SAC 2001: 12-16 |
| 36 | | Laurent Alonso,
René Schott:
On the tree inclusion problem.
Acta Inf. 37(9): 653-670 (2001) |
| 1999 |
|---|
| 35 | | Pierre Laroche,
François Charpillet,
René Schott:
Mobile Robotics Planning Using Abstract Markov Decision Processes.
ICTAI 1999: 299-306 |
| 1998 |
|---|
| 34 | | Philip Feinsilver,
René Schott:
Formal power series, operator calculus, and duality on Lie algebras.
Discrete Mathematics 180(1-3): 157-171 (1998) |
| 33 | | Philip Feinsilver,
René Schott:
Computing Representations of a Lie Group via the Universal Enveloping Algebra.
J. Symb. Comput. 26(3): 329-338 (1998) |
| 1997 |
|---|
| 32 | | Philip Feinsilver,
Uwe Granz,
René Schott:
On the computation of polynomial representations of nilpotent Lie groups: a symbolic mathematical approach.
SAC 1997: 537-539 |
| 31 | | Laurent Alonso,
Jean-Luc Remy,
René Schott:
A Linear-Time Algorithm for the Generation of Trees.
Algorithmica 17(2): 162-183 (1997) |
| 30 | | Laurent Alonso,
Jean-Luc Remy,
René Schott:
Uniform Generation of a Schröder Tree.
Inf. Process. Lett. 64(6): 305-308 (1997) |
| 29 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput. 26(1): 1-14 (1997) |
| 28 | | Guy Louchard,
Claire Kenyon,
René Schott:
Data Structures' Maxima.
SIAM J. Comput. 26(4): 1006-1042 (1997) |
| 1996 |
|---|
| 27 | | Eric Monfroy,
Michaël Rusinowitch,
René Schott:
Implementing non-linear constraints with cooperative solvers.
SAC 1996: 63-72 |
| 26 | | Dominique Geniet,
René Schott,
Loÿs Thimonier:
A Markovian Concurrency Measure.
ITA 30(4): 295-304 (1996) |
| 25 | | Lin Chen,
René Schott:
Optimal Operations on Red-Black Trees.
Int. J. Found. Comput. Sci. 7(3): 227-240 (1996) |
| 24 | | Philip Feinsilver,
John P. McSorley,
René Schott:
Combinatorial Interpretation and Operator Calculus of Lommel Polynomials.
J. Comb. Theory, Ser. A 75(1): 163-171 (1996) |
| 23 | | Laurent Alonso,
Philippe Chassaing,
René Schott:
The average complexity of a coin-weighing problem.
Random Struct. Algorithms 9(1-2): 1-14 (1996) |
| 22 | | Laurent Alonso,
René Schott:
A Parallel Algorithm for the Generation of a Permutation and Applications.
Theor. Comput. Sci. 159(1): 15-28 (1996) |
| 1995 |
|---|
| 21 | | Laurent Alonso,
René Schott:
Random Generation of Colored Trees.
LATIN 1995: 16-35 |
| 20 | | R. Feinsilver,
René Schott:
An Operator Calculus Approach to the Evolution of Dynamic Data Structures.
MFCS 1995: 574-586 |
| 19 | | Ricardo A. Baeza-Yates,
René Schott:
Parallel Searching in the Plane.
Comput. Geom. 5: 143-154 (1995) |
| 18 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discrete Math. 8(3): 428-447 (1995) |
| 1993 |
|---|
| 17 | | Robert S. Maier,
René Schott:
Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions.
FCT 1993: 352-362 |
| 16 | | Lin Chen,
René Schott:
Optimal Operations on Red-Black Trees.
ICCI 1993: 529-533 |
| 15 | | Laurent Alonso,
René Schott:
On the Tree Inclusion Problem.
MFCS 1993: 211-221 |
| 14 | | Robert S. Maier,
René Schott:
The Exhaustion of Shared Memory: Stochastic Results.
WADS 1993: 494-505 |
| 13 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
Determining the Majority.
Inf. Process. Lett. 47(5): 253-255 (1993) |
| 1992 |
|---|
| 12 | | Jean-Daniel Boissonnat,
Olivier Devillers,
René Schott,
Monique Teillaud,
Mariette Yvinec:
Applications of Random Sampling to On-line Algorithms in Computational Geometry.
Discrete & Computational Geometry 8: 51-71 (1992) |
| 11 | | Guy Louchard,
B. Randrianarimanana,
René Schott:
Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis.
Theor. Comput. Sci. 93(2): 201-225 (1992) |
| 1991 |
|---|
| 10 | | Guy Louchard,
Claire Kenyon,
René Schott:
Data Structures Maxima.
FCT 1991: 339-349 |
| 9 | | Guy Louchard,
René Schott:
Probabilistic Analysis of Some Distributed Algorithms.
Random Struct. Algorithms 2(2): 151-186 (1991) |
| 1990 |
|---|
| 8 | | Dominique Geniet,
René Schott,
Loÿs Thimonier:
A Markovian Concurrency Measure.
CAAP 1990: 177-190 |
| 7 | | Guy Louchard,
René Schott:
Probabilistic Analysis of Some Distributed Algorithms.
CAAP 1990: 239-253 |
| 6 | | Jean Françon,
B. Randrianarimanana,
René Schott:
Analysis of Dynamic Algorithms in Knuth's Model.
Theor. Comput. Sci. 72(2&3): 147-167 (1990) |
| 1989 |
|---|
| 5 | | Jean Françon,
B. Randrianarimanana,
René Schott:
Dynamic Data Structures with Finite Population: A Combinatorial Analysis.
FCT 1989: 162-174 |
| 4 | | Guy Louchard,
B. Randrianarimanana,
René Schott:
Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis.
ICALP 1989: 521-533 |
| 3 | | Fabrizio Luccio,
Mireille Régnier,
René Schott:
Discs and Other Related Data Structures.
WADS 1989: 192-205 |
| 1988 |
|---|
| 2 | | Jean Françon,
B. Randrianarimanana,
René Schott:
Analysis of Dynamic Algorithms in D. E. Knuth's Model.
CAAP 1988: 72-88 |
| 1986 |
|---|
| 1 | | René Schott:
Random Walks on Trees.
CAAP 1986: 225-237 |
