default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené Schott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j41]Abdusy Syarif
, Abdelhafid Abouaissa, Lhassane Idoumghar, Pascal Lorenz, René Schott, G. Stacey Staples:
New Path Centrality Based on Operator Calculus Approach for Wireless Sensor Network Deployment. IEEE Trans. Emerg. Top. Comput. 7(1): 162-173 (2019)- 2015
- [c33]Bilel Nefzi, René Schott, Yeqiong Song, George Stacey Staples, Evangelia Tsiontsiou:
An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks. MobiHoc 2015: 367-376 - 2014
- [j40]Francis Comets, François Delarue, René Schott:
Information Transmission under Random Emission Constraints. Comb. Probab. Comput. 23(6): 973-1009 (2014) - [c32]Akram Bedoui, Philippe Debreux, Lhassane Idoumghar, René Schott, Thierry Schott:
Steps toward the design of hybrid metaheuristics for the multi-objective frequency assignment problem in broadcasting. ISTT 2014: 208-213 - 2012
- [c31]Hugo Cruz-Sanchez, G. Stacey Staples, René Schott, Yeqiong Song:
Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation. GLOBECOM 2012: 3431-3436 - 2011
- [j39]Lhassane Idoumghar, Mahmoud Melkemi, René Schott, Maha Idrissi-Aouad:
Hybrid PSO-SA Type Algorithms for Multimodal Function Optimization and Reducing Energy Consumption in Embedded Systems. Appl. Comput. Intell. Soft Comput. 2011: 138078:1-138078:12 (2011) - [j38]René Schott, G. Stacey Staples:
Nilpotent Adjacency Matrices and Random Graphs. Ars Comb. 98: 225-239 (2011) - [j37]René Schott, G. Stacey Staples:
Complexity of counting cycles using zeons. Comput. Math. Appl. 62(4): 1828-1837 (2011) - [p2]René Schott, G. Stacey Staples:
On the Complexity of Cycle Enumeration for Simple Graphs. Guide to Geometric Algebra in Practice 2011: 233-249 - [i1]Philip Feinsilver, René Schott:
On Krawtchouk Transforms. CoRR abs/1107.1695 (2011) - 2010
- [c30]Philip Feinsilver, René Schott:
On Krawtchouk Transforms. AISC/MKM/Calculemus 2010: 64-75 - [c29]Maha Idrissi-Aouad, René Schott, Olivier Zendra:
Genetic Heuristics for Reducing Memory Energy Consumption in Embedded Systems. ICSOFT (2) 2010: 394-402 - [c28]Lhassane Idoumghar, Maha Idrissi-Aouad, Mahmoud Melkemi, René Schott:
Metropolis Particle Swarm Optimization Algorithm with Mutation Operator for Global Optimization Problems. ICTAI (1) 2010: 35-42 - [c27]Maha Idrissi-Aouad, René Schott, Olivier Zendra:
Hybrid Heuristics for Optimizing Energy Consumption in Embedded Systems. ISCIS 2010: 409-414 - [c26]Yanjun Li, Yeqiong Song, Yi-hua Zhu, René Schott:
Deploying Wireless Sensors for Differentiated Coverage and Probabilistic Connectivity. WCNC 2010: 1-6 - [p1]René Schott, G. Stacey Staples:
Computational Complexity Reductions Using Clifford Algebras. Geometric Algebra Computing 2010: 431-453
2000 – 2009
- 2009
- [j36]Lhassane Idoumghar, René Schott:
Two Distributed Algorithms for the Frequency Assignment Problem in the Field of Radio Broadcasting. IEEE Trans. Broadcast. 55(2): 223-229 (2009) - 2008
- [j35]John P. McSorley, Philip Feinsilver, René Schott:
Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs. Ars Comb. 87 (2008) - [j34]René Schott, G. Stacey Staples:
Partitions and Clifford algebras. Eur. J. Comb. 29(5): 1133-1138 (2008) - 2007
- [j33]René Schott, Jean-Claude Spehner:
Erratum for "Shuffle of Words and Araucaria Trees". Fundam. Informaticae 81(4): 485-490 (2007) - [j32]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Parabola Separation Queries and their Application to Stone Throwing. Int. J. Comput. Geom. Appl. 17(4): 349-360 (2007) - [j31]Philip Feinsilver, René Schott:
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach. Math. Comput. Sci. 1(2): 239-251 (2007) - [j30]Francis Comets, François Delarue, René Schott:
Distributed algorithms in an ergodic Markovian environment. Random Struct. Algorithms 30(1-2): 131-167 (2007) - 2006
- [j29]René Schott, Jean-Claude Spehner:
Shuffle of Words and Araucaria Trees. Fundam. Informaticae 74(4): 579-601 (2006) - [j28]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) - [c25]Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . AAIM 2006: 185-193 - [c24]Philip Feinsilver, René Schott:
Operator Calculus Approach to Solving Analytic Systems. AISC 2006: 170-180 - [c23]Lhassane Idoumghar, René Schott:
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem. ICTAI 2006: 18-25 - 2004
- [j27]Jean-Yves Greff, Lhassane Idoumghar, René Schott:
Application Of Markov Decision Processes To The Frequency Assignment Problem. Appl. Artif. Intell. 18(8): 761-773 (2004) - [j26]Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. 13(4-5): 419-449 (2004) - [j25]Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott:
The worst-case chip problem. Inf. Process. Lett. 89(6): 303-308 (2004) - [j24]René Schott, Jean-Claude Spehner:
Two optimal parallel algorithms on the commutation class of a word. Theor. Comput. Sci. 324(1): 107-131 (2004) - [c22]René Schott, Jean-Claude Spehner:
On the Minimal Automaton of the Shuffle of Words and Araucarias. MCU 2004: 316-327 - 2002
- [j23]Nadine Guillotin-Plantard, René Schott:
Distributed algorithms with dynamical random transitions. Random Struct. Algorithms 21(3-4): 371-396 (2002) - [j22]Miguel Alabau, Lhassane Idoumghar, René Schott:
New hybrid genetic algorithms for the frequency assignment problem. IEEE Trans. Broadcast. 48(1): 27-34 (2002) - [j21]Nazeih M. Botros, Jian Yang, Philip Feinsilver, René Schott:
Hardware realization of Krawtchouk transform using VHDL modeling and FPGAs. IEEE Trans. Ind. Electron. 49(6): 1306-1312 (2002) - 2001
- [b2]Jean-François Mari, René Schott:
Probabilistic and statistical methods in computer science. Kluwer 2001, ISBN 978-0-7923-7286-8, pp. I-XVI, 1-236 - [j20]Laurent Alonso, René Schott:
On the tree inclusion problem. Acta Informatica 37(9): 653-670 (2001) - [c21]Miguel Alabau, Lhassane Idoumghar, René Schott:
New Hybrid Genetic Algorithms for the Frequency Assignment Problem. ICTAI 2001: 136- - [c20]Pierre Laroche, Yann Boniface, René Schott:
A new decomposition technique for solving Markov decision processes. SAC 2001: 12-16 - 2000
- [c19]René Schott, Jean-Claude Spehner:
Two Optimal Parallel Algorithms on the Commutation Class of a Word. Words, Languages & Combinatorics 2000: 403-419
1990 – 1999
- 1999
- [c18]Pierre Laroche, François Charpillet, René Schott:
Mobile Robotics Planning Using Abstract Markov Decision Processes. ICTAI 1999: 299-306 - 1998
- [j19]Philip Feinsilver, René Schott:
Formal power series, operator calculus, and duality on Lie algebras. Discret. Math. 180(1-3): 157-171 (1998) - [j18]Philip Feinsilver, René Schott:
Computing Representations of a Lie Group via the Universal Enveloping Algebra. J. Symb. Comput. 26(3): 329-338 (1998) - 1997
- [j17]Laurent Alonso, Jean-Luc Rémy, René Schott:
A Linear-Time Algorithm for the Generation of Trees. Algorithmica 17(2): 162-183 (1997) - [j16]Laurent Alonso, Jean-Luc Rémy, René Schott:
Uniform Generation of a Schröder Tree. Inf. Process. Lett. 64(6): 305-308 (1997) - [j15]Laurent Alonso, Edward M. Reingold, René Schott:
The Average-Case Complexity of Determining the Majority. SIAM J. Comput. 26(1): 1-14 (1997) - [j14]Guy Louchard, Claire Kenyon, René Schott:
Data Structures' Maxima. SIAM J. Comput. 26(4): 1006-1042 (1997) - [c17]Philip Feinsilver, Uwe Granz, René Schott:
On the computation of polynomial representations of nilpotent Lie groups: a symbolic mathematical approach. SAC 1997: 537-539 - 1996
- [j13]Lin Chen, René Schott:
Optimal Operations on Red-Black Trees. Int. J. Found. Comput. Sci. 7(3): 227-240 (1996) - [j12]Dominique Geniet, René Schott, Loÿs Thimonier:
A Markovian Concurrency Measure. RAIRO Theor. Informatics Appl. 30(4): 295-304 (1996) - [j11]Philip Feinsilver, John P. McSorley, René Schott:
Combinatorial Interpretation and Operator Calculus of Lommel Polynomials. J. Comb. Theory A 75(1): 163-171 (1996) - [j10]Laurent Alonso, Philippe Chassaing, René Schott:
The average complexity of a coin-weighing problem. Random Struct. Algorithms 9(1-2): 1-14 (1996) - [j9]Laurent Alonso, René Schott:
A Parallel Algorithm for the Generation of a Permutation and Applications. Theor. Comput. Sci. 159(1): 15-28 (1996) - [c16]Éric Monfroy, Michaël Rusinowitch, René Schott:
Implementing non-linear constraints with cooperative solvers. SAC 1996: 63-72 - 1995
- [b1]Laurent Alonso, René Schott:
Random generation of trees - random generators in computer science. Kluwer 1995, ISBN 978-0-7923-9528-7, pp. I-XI, 1-208 - [j8]Ricardo A. Baeza-Yates, René Schott:
Parallel Searching in the Plane. Comput. Geom. 5: 143-154 (1995) - [j7]Laurent Alonso, Edward M. Reingold, René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences. SIAM J. Discret. Math. 8(3): 428-447 (1995) - [c15]Laurent Alonso, René Schott:
Random Generation of Colored Trees. LATIN 1995: 16-35 - [c14]Philip Feinsilver, René Schott:
An Operator Calculus Approach to the Evolution of Dynamic Data Structures. MFCS 1995: 574-586 - 1993
- [j6]Laurent Alonso, Edward M. Reingold, René Schott:
Determining the Majority. Inf. Process. Lett. 47(5): 253-255 (1993) - [c13]Robert S. Maier, René Schott:
Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions. FCT 1993: 352-362 - [c12]Lin Chen, René Schott:
Optimal Operations on Red-Black Trees. ICCI 1993: 529-533 - [c11]Laurent Alonso, René Schott:
On the Tree Inclusion Problem. MFCS 1993: 211-221 - [c10]Robert S. Maier, René Schott:
The Exhaustion of Shared Memory: Stochastic Results. WADS 1993: 494-505 - 1992
- [j5]Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec:
Applications of Random Sampling to On-line Algorithms in Computational Geometry. Discret. Comput. Geom. 8: 51-71 (1992) - [j4]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
- [j3]Guy Louchard, René Schott:
Probabilistic Analysis of Some Distributed Algorithms. Random Struct. Algorithms 2(2): 151-186 (1991) - [c9]Guy Louchard, Claire Kenyon, René Schott:
Data Structures Maxima. FCT 1991: 339-349 - 1990
- [j2]Philippe Flajolet, René Schott:
Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series. Eur. J. Comb. 11(5): 421-432 (1990) - [j1]Jean Françon, B. Randrianarimanana, René Schott:
Analysis of Dynamic Algorithms in Knuth's Model. Theor. Comput. Sci. 72(2&3): 147-167 (1990) - [c8]Dominique Geniet, René Schott, Loÿs Thimonier:
A Markovian Concurrency Measure. CAAP 1990: 177-190 - [c7]Guy Louchard, René Schott:
Probabilistic Analysis of Some Distributed Algorithms. CAAP 1990: 239-253
1980 – 1989
- 1989
- [c6]Jean Françon, B. Randrianarimanana, René Schott:
Dynamic Data Structures with Finite Population: A Combinatorial Analysis. FCT 1989: 162-174 - [c5]Guy Louchard, B. Randrianarimanana, René Schott:
Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis. ICALP 1989: 521-533 - [c4]Fabrizio Luccio, Mireille Régnier, René Schott:
Discs and Other Related Data Structures. WADS 1989: 192-205 - 1988
- [c3]Jean Françon, B. Randrianarimanana, René Schott:
Analysis of Dynamic Algorithms in D. E. Knuth's Model. CAAP 1988: 72-88 - 1987
- [c2]René Schott:
On mobile robots: A probabilistic model for the representation and manipulation of spatial uncertainty. ICRA 1987: 409-415 - 1986
- [c1]René Schott:
Random Walks on Trees. CAAP 1986: 225-237
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
