According to our database1, René Schott authored at least 70 papers between 1986 and 2015.
Legend:Book In proceedings Article PhD thesis Other
An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks.
Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2015
Information Transmission under Random Emission Constraints.
Combinatorics, Probability & Computing, 2014
Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation.
Proceedings of the 2012 IEEE Global Communications Conference, 2012
Complexity of counting cycles using zeons.
Computers & Mathematics with Applications, 2011
Nilpotent Adjacency Matrices and Random Graphs.
Ars Comb., 2011
Hybrid PSO-SA Type Algorithms for Multimodal Function Optimization and Reducing Energy Consumption in Embedded Systems.
Applied Comp. Int. Soft Computing, 2011
On the Complexity of Cycle Enumeration for Simple Graphs.
Proceedings of the Guide to Geometric Algebra in Practice., 2011
Deploying Wireless Sensors for Differentiated Coverage and Probabilistic Connectivity.
Proceedings of the 2010 IEEE Wireless Communications and Networking Conference, 2010
Hybrid Heuristics for Optimizing Energy Consumption in Embedded Systems.
Proceedings of the Computer and Information Sciences, 2010
Metropolis Particle Swarm Optimization Algorithm with Mutation Operator for Global Optimization Problems.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010
Genetic Heuristics for Reducing Memory Energy Consumption in Embedded Systems.
Proceedings of the ICSOFT 2010, 2010
On Krawtchouk Transforms.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010
Computational Complexity Reductions Using Clifford Algebras.
Proceedings of the Geometric Algebra Computing - in Engineering and Computer Science., 2010
Two Distributed Algorithms for the Frequency Assignment Problem in the Field of Radio Broadcasting.
Partitions and Clifford algebras.
Eur. J. Comb., 2008
Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs.
Ars Comb., 2008
Distributed algorithms in an ergodic Markovian environment.
Random Struct. Algorithms, 2007
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach.
Mathematics in Computer Science, 2007
Parabola Separation Queries and their Application to Stone Throwing.
Int. J. Comput. Geometry Appl., 2007
Erratum for "Shuffle of Words and Araucaria Trees".
Fundam. Inform., 2007
Data structures with dynamical random transitions.
Random Struct. Algorithms, 2006
Shuffle of Words and Araucaria Trees.
Fundam. Inform., 2006
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem.
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006
Operator Calculus Approach to Solving Analytic Systems.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2006
Throwing Stones Inside Simple Polygons .
Proceedings of the Algorithmic Aspects in Information and Management, 2006
The worst-case chip problem.
Inf. Process. Lett., 2004
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing, 2004
Application Of Markov Decision Processes To The Frequency Assignment Problem.
Applied Artificial Intelligence, 2004
On the Minimal Automaton of the Shuffle of Words and Araucarias.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004
Hardware realization of Krawtchouk transform using VHDL modeling and FPGAs.
IEEE Trans. Industrial Electronics, 2002
Distributed algorithms with dynamical random transitions.
Random Struct. Algorithms, 2002
A new decomposition technique for solving Markov decision processes.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001
New Hybrid Genetic Algorithms for the Frequency Assignment Problem.
Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, 2001
Probabilistic and statistical methods in computer science.
Kluwer, ISBN: 978-0-7923-7286-8, 2001
Two Optimal Parallel Algorithms on the Commutation Class of a Word.
Proceedings of the International Colloquium on Words, 2000
Mobile Robotics Planning Using Abstract Markov Decision Processes.
Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, 1999
Computing Representations of a Lie Group via the Universal Enveloping Algebra.
J. Symb. Comput., 1998
Formal power series, operator calculus, and duality on Lie algebras.
Discrete Mathematics, 1998
Data Structures' Maxima.
SIAM J. Comput., 1997
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput., 1997
Uniform Generation of a Schröder Tree.
Inf. Process. Lett., 1997
A Linear-Time Algorithm for the Generation of Trees.
On the computation of polynomial representations of nilpotent Lie groups: a symbolic mathematical approach.
Proceedings of the 1997 ACM symposium on Applied Computing, 1997
A Parallel Algorithm for the Generation of a Permutation and Applications.
Theor. Comput. Sci., 1996
The average complexity of a coin-weighing problem.
Random Struct. Algorithms, 1996
Combinatorial Interpretation and Operator Calculus of Lommel Polynomials.
J. Comb. Theory, Ser. A, 1996
Implementing non-linear constraints with cooperative solvers.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996
Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discrete Math., 1995
Parallel Searching in the Plane.
Comput. Geom., 1995
An Operator Calculus Approach to the Evolution of Dynamic Data Structures.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995
Random Generation of Colored Trees.
Proceedings of the LATIN '95: Theoretical Informatics, 1995
Random generation of trees - random generators in computer science.
Kluwer, ISBN: 978-0-7923-9528-7, 1995
Determining the Majority.
Inf. Process. Lett., 1993
The Exhaustion of Shared Memory: Stochastic Results.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
On the Tree Inclusion Problem.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
Optimal Operations on Red-Black Trees.
Proceedings of the Computing and Information, 1993
Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis.
Theor. Comput. Sci., 1992
Applications of Random Sampling to On-line Algorithms in Computational Geometry.
Discrete & Computational Geometry, 1992
Data Structures Maxima.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
Analysis of Dynamic Algorithms in Knuth's Model.
Theor. Comput. Sci., 1990
Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series.
Eur. J. Comb., 1990
Probabilistic Analysis of Some Distributed Algorithms.
Proceedings of the CAAP '90, 1990
A Markovian Concurrency Measure.
Proceedings of the CAAP '90, 1990
Discs and Other Related Data Structures.
Proceedings of the Algorithms and Data Structures, 1989
Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Dynamic Data Structures with Finite Population: A Combinatorial Analysis.
Proceedings of the Fundamentals of Computation Theory, 1989
Analysis of Dynamic Algorithms in D. E. Knuth's Model.
Proceedings of the CAAP '88, 1988
On mobile robots: A probabilistic model for the representation and manipulation of spatial uncertainty.
Proceedings of the 1987 IEEE International Conference on Robotics and Automation, Raleigh, North Carolina, USA, March 31, 1987
Random Walks on Trees.
Proceedings of the CAAP '86, 1986