default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Teytaud
Person information
- affiliation: Meta, France
SPARQL queries 
🛈 Please note that only 74% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j36]Elena Raponi
, Nathanaël Carraz Rakotonirina, Jérémy Rapin, Carola Doerr, Olivier Teytaud:
Optimizing With Low Budgets: A Comparison on the Black-Box Optimization Benchmarking Suite and OpenAI Gym. IEEE Trans. Evol. Comput. 29(1): 91-101 (2025)- 2024
- [i37]Ismail Labiad, Thomas Bäck, Pierre Fernandez, Laurent Najman, Tom Sander, Furong Ye, Mariia Zameshina, Olivier Teytaud:
Log-normal Mutations and their Use in Detecting Surreptitious Fake Images. CoRR abs/2409.15119 (2024) - [i36]Mathurin Videau, Mariia Zameshina, Alessandro Ferreira Leite, Laurent Najman, Marc Schoenauer, Olivier Teytaud:
Evolutionary Retrofitting. CoRR abs/2410.11330 (2024) - [i35]Mathurin Videau, Alessandro Ferreira Leite, Marc Schoenauer, Olivier Teytaud:
Mixture of Experts in Image Classification: What's the Sweet Spot? CoRR abs/2411.18322 (2024) - [i34]Mathurin Videau, Alessandro Ferreira Leite, Marc Schoenauer, Olivier Teytaud:
Evolutionary Pre-Prompt Optimization for Mathematical Reasoning. CoRR abs/2412.04291 (2024) - 2023
- [j35]Dennis J. N. J. Soemers, Vegard Mella, Éric Piette, Matthew Stephenson, Cameron Browne, Olivier Teytaud:
Towards a General Transfer Approach for Policy-Value Networks. Trans. Mach. Learn. Res. 2023 (2023) - [c128]Mathurin Videau, Nickolai Knizev, Alessandro Ferreira Leite, Marc Schoenauer, Olivier Teytaud:
Interactive Latent Diffusion Model. GECCO 2023: 586-596 - [i33]Elena Raponi, Nathanaël Carraz Rakotonirina, Jérémy Rapin, Carola Doerr, Olivier Teytaud:
Optimizing with Low Budgets: a Comparison on the Black-box Optimization Benchmarking Suite and OpenAI Gym. CoRR abs/2310.00077 (2023) - [i32]Mariia Zameshina, Olivier Teytaud, Laurent Najman:
Diverse Diffusion: Enhancing Image Diversity in Text-to-Image Generation. CoRR abs/2310.12583 (2023) - [i31]Mariia Zameshina, Marlène Careil, Olivier Teytaud, Laurent Najman:
PrivacyGAN: robust generative image privacy. CoRR abs/2310.12590 (2023) - 2022
- [j34]Laurent Meunier, Herilalaina Rakotoarison, Pak-Kan Wong, Baptiste Rozière, Jérémy Rapin, Olivier Teytaud, Antoine Moreau, Carola Doerr:
Black-Box Optimization Revisited: Improving Algorithm Selection Wizards Through Massive Benchmarking. IEEE Trans. Evol. Comput. 26(3): 490-500 (2022) - [c127]Chris Cummins, Bram Wasti, Jiadong Guo, Brandon Cui, Jason Ansel, Sahir Gomez, Somya Jain, Jia Liu, Olivier Teytaud, Benoit Steiner, Yuandong Tian, Hugh Leather:
CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research. CGO 2022: 92-105 - [c126]Mathurin Videau, Alessandro Ferreira Leite, Olivier Teytaud, Marc Schoenauer:
Multi-objective Genetic Programming for Explainable Reinforcement Learning. EuroGP 2022: 278-293 - [c125]Mariia Zameshina, Olivier Teytaud, Fabien Teytaud, Vlad Hosu, Nathanaël Carraz Rakotonirina, Laurent Najman, Markus Wagner:
Fairness in generative modeling: do it unsupervised! GECCO Companion 2022: 320-323 - [c124]Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj, Fabien Teytaud, Mathurin Videau, Olivier Teytaud, Tome Eftimov, Manuel López-Ibáñez, Carola Doerr:
Improving Nevergrad's Algorithm Selection Wizard NGOpt Through Automated Algorithm Configuration. PPSN (1) 2022: 18-31 - [i30]Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj, Fabien Teytaud, Mathurin Videau, Olivier Teytaud, Tome Eftimov, Manuel López-Ibáñez, Carola Doerr:
Improving Nevergrad's Algorithm Selection Wizard NGOpt through Automated Algorithm Configuration. CoRR abs/2209.04412 (2022) - [i29]Mariia Zameshina, Olivier Teytaud, Fabien Teytaud, Vlad Hosu, Nathanaël Carraz, Laurent Najman, Markus Wagner:
Fairness in generative modeling. CoRR abs/2210.03517 (2022) - 2021
- [j33]Dennis J. N. J. Soemers, Vegard Mella, Cameron Browne, Olivier Teytaud:
Deep learning for general game playing with Ludii and Polygames. J. Int. Comput. Games Assoc. 43(3): 146-161 (2021) - [j32]Ching-Nung Lin, Fabien Letouzey, Olivier Teytaud, Shi-Jim Yen:
Seed Optimization Framework on Draughts. J. Inf. Sci. Eng. 37(2): 425-439 (2021) - [j31]Baptiste Rozière, Morgane Rivière, Olivier Teytaud, Jérémy Rapin, Yann LeCun, Camille Couprie:
Inspirational Adversarial Image Generation. IEEE Trans. Image Process. 30: 4036-4045 (2021) - [c123]Laurent Meunier, Iskander Legheraba, Yann Chevaleyre, Olivier Teytaud:
Asymptotic convergence rates for averaging strategies. FOGA 2021: 1:1-1:11 - [i28]Dennis J. N. J. Soemers, Vegard Mella, Cameron Browne, Olivier Teytaud:
Deep Learning for General Game Playing with Ludii and Polygames. CoRR abs/2101.09562 (2021) - [i27]Dennis J. N. J. Soemers, Vegard Mella, Éric Piette, Matthew Stephenson, Cameron Browne, Olivier Teytaud:
Transfer of Fully Convolutional Policy-Value Networks Between Games and Game Variants. CoRR abs/2102.12375 (2021) - [i26]Laurent Meunier, Iskander Legheraba, Yann Chevaleyre, Olivier Teytaud:
Asymptotic convergence rates for averaging strategies. CoRR abs/2108.04707 (2021) - [i25]Chris Cummins, Bram Wasti, Jiadong Guo, Brandon Cui, Jason Ansel, Sahir Gomez, Somya Jain, Jia Liu, Olivier Teytaud, Benoit Steiner, Yuandong Tian, Hugh Leather:
CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research. CoRR abs/2109.08267 (2021) - 2020
- [j30]Tristan Cazenave, Yen-Chi Chen, Guan-Wei Chen, Shi-Yu Chen, Xian-Dong Chiu, Julien Dehos, Maria Elsa, Qucheng Gong, Hengyuan Hu, Vasil Khalidov, Cheng-Ling Li, Hsin-I Lin, Yu-Jin Lin, Xavier Martinet, Vegard Mella, Jérémy Rapin, Baptiste Rozière, Gabriel Synnaeve, Fabien Teytaud, Olivier Teytaud, Shi-Cheng Ye, Yi-Jun Ye, Shi-Jim Yen, Sergey Zagoruyko:
Polygames: Improved zero learning. J. Int. Comput. Games Assoc. 42(4): 244-256 (2020) - [c122]Baptiste Rozière, Fabien Teytaud, Vlad Hosu, Hanhe Lin, Jérémy Rapin, Mariia Zameshina, Olivier Teytaud:
EvolGAN: Evolutionary Generative Adversarial Networks. ACCV (4) 2020: 679-694 - [c121]Baptiste Rozière, Nathanaël Carraz Rakotonirina, Vlad Hosu, Hanhe Lin, Andry Rasoanaivo, Olivier Teytaud, Camille Couprie:
Evolutionary super-resolution. GECCO Companion 2020: 151-152 - [c120]Marie-Liesse Cauwet, Olivier Teytaud:
Population control meets doob's martingale theorems: the noise-free multimodal case. GECCO Companion 2020: 321-322 - [c119]Jialin Liu, Antoine Moreau, Mike Preuss, Jérémy Rapin, Baptiste Rozière, Fabien Teytaud, Olivier Teytaud:
Versatile black-box optimization. GECCO 2020: 620-628 - [c118]Jérémy Rapin, Pauline Bennet, Emmanuel Centeno, Daniel Haziza, Antoine Moreau, Olivier Teytaud:
Open source evolutionary structured optimization. GECCO Companion 2020: 1599-1607 - [c117]Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud, Nicolas Usunier:
Fully Parallel Hyperparameter Search: Reshaped Space-Filling. ICML 2020: 1338-1348 - [c116]Baptiste Rozière, Nathanaël Carraz Rakotonirina, Vlad Hosu, Andry Rasoanaivo, Hanhe Lin, Camille Couprie, Olivier Teytaud:
Tarsier: Evolving Noise Injection in Super-Resolution GANs. ICPR 2020: 7028-7035 - [c115]Evrard Garcelon, Baptiste Rozière, Laurent Meunier, Jean Tarbouriech, Olivier Teytaud, Alessandro Lazaric, Matteo Pirotta:
Adversarial Attacks on Linear Contextual Bandits. NeurIPS 2020 - [c114]Laurent Meunier, Carola Doerr, Jérémy Rapin, Olivier Teytaud:
Variance Reduction for Better Sampling in Continuous Domains. PPSN (1) 2020: 154-168 - [c113]Laurent Meunier, Yann Chevaleyre, Jérémy Rapin, Clément W. Royer, Olivier Teytaud:
On Averaging the Best Samples in Evolutionary Computation. PPSN (2) 2020: 661-674 - [p5]Bruno Bouzy, Tristan Cazenave, Vincent Corruble, Olivier Teytaud:
Artificial Intelligence for Games. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 313-337 - [i24]Tristan Cazenave, Yen-Chi Chen, Guan-Wei Chen, Shi-Yu Chen, Xian-Dong Chiu, Julien Dehos, Maria Elsa, Qucheng Gong, Hengyuan Hu, Vasil Khalidov, Cheng-Ling Li, Hsin-I Lin, Yu-Jin Lin, Xavier Martinet, Vegard Mella, Jérémy Rapin, Baptiste Rozière, Gabriel Synnaeve, Fabien Teytaud, Olivier Teytaud, Shi-Cheng Ye, Yi-Jun Ye, Shi-Jim Yen, Sergey Zagoruyko:
Polygames: Improved Zero Learning. CoRR abs/2001.09832 (2020) - [i23]Evrard Garcelon, Baptiste Rozière, Laurent Meunier, Jean Tarbouriech, Olivier Teytaud, Alessandro Lazaric, Matteo Pirotta:
Adversarial Attacks on Linear Contextual Bandits. CoRR abs/2002.03839 (2020) - [i22]Laurent Meunier, Yann Chevaleyre, Jérémy Rapin, Clément W. Royer, Olivier Teytaud:
Proving μ>1. CoRR abs/2004.11685 (2020) - [i21]Laurent Meunier, Carola Doerr, Jérémy Rapin, Olivier Teytaud:
Variance Reduction for Better Sampling in Continuous Domains. CoRR abs/2004.11687 (2020) - [i20]Jialin Liu, Antoine Moreau, Mike Preuss, Baptiste Rozière, Jérémy Rapin, Fabien Teytaud, Olivier Teytaud:
Versatile Black-Box Optimization. CoRR abs/2004.14014 (2020) - [i19]Marie-Liesse Cauwet, Olivier Teytaud:
Population Control meets Doob's Martingale Theorems: the Noise-free Multimodal Case. CoRR abs/2005.13970 (2020) - [i18]Baptiste Rozière, Nathanaël Carraz Rakotonirina, Vlad Hosu, Andry Rasoanaivo, Hanhe Lin, Camille Couprie, Olivier Teytaud:
Tarsier: Evolving Noise Injection in Super-Resolution GANs. CoRR abs/2009.12177 (2020) - [i17]Baptiste Rozière, Fabien Teytaud, Vlad Hosu, Hanhe Lin, Jérémy Rapin, Mariia Zameshina, Olivier Teytaud:
EvolGAN: Evolutionary Generative Adversarial Networks. CoRR abs/2009.13311 (2020) - [i16]Laurent Meunier, Herilalaina Rakotoarison, Pak-Kan Wong, Baptiste Rozière, Jérémy Rapin, Olivier Teytaud, Antoine Moreau, Carola Doerr:
Black-Box Optimization Revisited: Improving Algorithm Selection Wizards through Massive Benchmarking. CoRR abs/2010.04542 (2020)
2010 – 2019
- 2019
- [c112]Vasil Khalidov, Maxime Oquab, Jérémy Rapin, Olivier Teytaud:
Consistent population control: generate plenty of points, but with a bit of resampling. FOGA 2019: 116-123 - [c111]Jérémy Rapin, Pauline Dorval, Jules Pondard, Nicolas Vasilache, Marie-Liesse Cauwet, Camille Couprie, Olivier Teytaud:
Openly revisiting derivative-free optimization. GECCO (Companion) 2019: 267-268 - [c110]Jérémy Rapin, Marcus Gallagher, Pascal Kerschke, Mike Preuss, Olivier Teytaud:
Exploring the MLDA benchmark on the nevergrad platform. GECCO (Companion) 2019: 1888-1896 - [c109]Jialin Liu, Olivier Teytaud:
A Simple Yet Effective Resampling Rule in Noisy Evolutionary Optimization. SSCI 2019: 689-696 - [c108]Jialin Liu, Olivier Teytaud:
Efficient Decision Making under Uncertainty in a Power System Investment Problem. SSCI 2019: 697-704 - [i15]Morgane Rivière, Olivier Teytaud, Jérémy Rapin, Yann LeCun, Camille Couprie:
Inspirational Adversarial Image Generation. CoRR abs/1906.11661 (2019) - [i14]Laurent Meunier, Jamal Atif, Olivier Teytaud:
Yet another but more efficient black-box adversarial attack: tiling and evolution strategies. CoRR abs/1910.02244 (2019) - [i13]Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud:
Fully Parallel Hyperparameter Search: Reshaped Space-Filling. CoRR abs/1910.08406 (2019) - 2018
- [j29]Chang-Shing Lee, Mei-Hui Wang, Chi-Shiang Wang, Olivier Teytaud, Jialin Liu, Su-Wei Lin, Pi-Hsia Hung:
PSO-Based Fuzzy Markup Language for Student Learning Performance Evaluation and Educational Application. IEEE Trans. Fuzzy Syst. 26(5): 2618-2633 (2018) - [c107]Marie-Liesse Cauwet, Olivier Teytaud:
Surprising Strategies Obtained by Stochastic Optimization in Partially Observable Games. CEC 2018: 1-8 - [i12]Chang-Shing Lee, Mei-Hui Wang, Chi-Shiang Wang, Olivier Teytaud, Jialin Liu, Su-Wei Lin, Pi-Hsia Hung:
PSO-based Fuzzy Markup Language for Student Learning Performance Evaluation and Educational Application. CoRR abs/1802.08822 (2018) - [i11]Mathieu Guillame-Bert, Olivier Teytaud:
Exact Distributed Training: Random Forest with Billions of Examples. CoRR abs/1804.06755 (2018) - [i10]Marie-Liesse Cauwet, Olivier Teytaud:
Surprising strategies obtained by stochastic optimization in partially observable games. CoRR abs/1807.01877 (2018) - 2017
- [j28]Véronique Ventos, Olivier Teytaud:
Le bridge, nouveau défi de l'intelligence artificielle ? Rev. d'Intelligence Artif. 31(3): 249-279 (2017) - [c106]Véronique Ventos, Yves Costel, Olivier Teytaud, Solène Thépaut Ventos:
Boosting a Bridge Artificial Intelligence. ICTAI 2017: 1280-1287 - [i9]Karol Kurach, Sylvain Gelly, Michal Jastrzebski, Philip Häusser, Olivier Teytaud, Damien Vincent, Olivier Bousquet:
Better Text Understanding Through Image-To-Text Transfer. CoRR abs/1705.08386 (2017) - [i8]Olivier Bousquet, Sylvain Gelly, Karol Kurach, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Damien Vincent:
Toward Optimal Run Racing: Application to Deep Learning Calibration. CoRR abs/1706.03199 (2017) - [i7]Olivier Bousquet, Sylvain Gelly, Karol Kurach, Olivier Teytaud, Damien Vincent:
Critical Hyper-Parameters: No Random, No Cry. CoRR abs/1706.03200 (2017) - 2016
- [j27]Marie-Liesse Cauwet, Jialin Liu, Baptiste Rozière, Olivier Teytaud:
Algorithm portfolios for noisy optimization. Ann. Math. Artif. Intell. 76(1-2): 143-172 (2016) - [j26]Sandra Astete Morales, Marie-Liesse Cauwet, Jialin Liu, Olivier Teytaud:
Simple and cumulative regret for continuous noisy optimization. Theor. Comput. Sci. 617: 12-27 (2016) - [c105]Jialin Liu, Olivier Teytaud, Tristan Cazenave:
Fast Seed-Learning Algorithms for Games. Computers and Games 2016: 58-70 - [c104]Tristan Cazenave, Jialin Liu, Fabien Teytaud, Olivier Teytaud:
Learning opening books in partially observable games: Using random seeds in Phantom Go. CIG 2016: 1-7 - [c103]Fabien Teytaud, Olivier Teytaud:
QR Mutations Improve Many Evolution Strategies: A Lot On Highly Multimodal Problems. GECCO (Companion) 2016: 35-36 - [c102]Sandra Astete Morales, Marie-Liesse Cauwet, Olivier Teytaud:
Analysis of Different Types of Regret in Continuous Noisy Optimization. GECCO 2016: 205-212 - [c101]Marie-Liesse Cauwet, Olivier Teytaud:
Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms. GECCO 2016: 1101-1106 - [c100]Marie-Liesse Cauwet, Olivier Teytaud:
Multivariate bias reduction in capacity expansion planning. PSCC 2016: 1-8 - [i6]Jialin Liu, Olivier Teytaud:
Scenario-based decision-making for power systems investment planning. CoRR abs/1607.01313 (2016) - [i5]Tristan Cazenave, Jialin Liu, Fabien Teytaud, Olivier Teytaud:
Learning opening books in partially observable games: using random seeds in Phantom Go. CoRR abs/1607.02431 (2016) - [i4]David Lupien St-Pierre, Jean-Baptiste Hoock, Jialin Liu, Fabien Teytaud, Olivier Teytaud:
Automatically Reinforcing a Game AI. CoRR abs/1607.08100 (2016) - 2015
- [j25]Youhei Akimoto, Sandra Astete Morales, Olivier Teytaud:
Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theor. Comput. Sci. 605: 42-50 (2015) - [j24]Chang-Shing Lee, Mei-Hui Wang, Meng-Jhen Wu, Olivier Teytaud, Shi-Jim Yen:
T2FS-Based Adaptive Linguistic Assessment System for Semantic Analysis and Human Performance Evaluation on Game of Go. IEEE Trans. Fuzzy Syst. 23(2): 400-420 (2015) - [c99]Abdallah Saffidine, Olivier Teytaud, Shi-Jim Yen:
Go Complexities. ACG 2015: 76-88 - [c98]Olivier Teytaud:
Quasi-random Numbers Improve the CMA-ES on the BBOB Testbed. Artificial Evolution 2015: 58-70 - [c97]Jean-Joseph Christophe, Jérémie Decock, Jialin Liu, Olivier Teytaud:
Variance Reduction in Population-Based Optimization: Application to Unit Commitment. Artificial Evolution 2015: 219-233 - [c96]Vincent Berthier, Olivier Teytaud:
On the Codimension of the Set of Optima: Large Scale Optimisation with Few Relevant Variables. Artificial Evolution 2015: 234-247 - [c95]Shih-Yuan Chiu, Ching-Nung Lin, Jialin Liu, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Shi-Jim Yen:
Differential evolution for strongly noisy optimization: Use 1: 01n resamplings at iteration n and Reach the -1/2 slope. CEC 2015: 338-345 - [c94]David Lupien St-Pierre, Jialin Liu, Olivier Teytaud:
Nash reweighting of Monte Carlo simulations: Tsumego. CEC 2015: 1458-1465 - [c93]Marie-Liesse Cauwet, Olivier Teytaud, Tristan Cazenave, Abdallah Saffidine, Hua-Min Liang, Shi-Jim Yen, Hung-Hsuan Lin, I-Chen Wu:
Depth, balancing, and limits of the Elo model. CIG 2015: 376-382 - [c92]Tristan Cazenave, Jialin Liu, Olivier Teytaud:
The rectangular seeds of Domineering. CIG 2015: 530-531 - [c91]Sandra Astete Morales, Marie-Liesse Cauwet, Olivier Teytaud:
Evolution Strategies with Additive Noise: A Convergence Rate Lower Bound. FOGA 2015: 76-84 - [c90]Marie-Liesse Cauwet, Olivier Teytaud, Shih-Yuan Chiu, Kuo-Min Lin, Shi-Jim Yen, David Lupien St-Pierre, Fabien Teytaud:
Parallel Evolutionary Algorithms Performing Pairwise Comparisons. FOGA 2015: 99-113 - [c89]Mei-Hui Wang, Chi-Shiang Wang, Chang-Shing Lee, Olivier Teytaud, Jialin Liu, Su-Wei Lin, Pi-Hsia Hung:
Item response theory with fuzzy markup language for parameter estimation and validation. FUZZ-IEEE 2015: 1-7 - [c88]Sandra Astete Morales, Marie-Liesse Cauwet, Olivier Teytaud:
Criteria and Convergence Rates in Noisy Optimization. GECCO (Companion) 2015: 1347-1348 - [c87]Jérémie Decock, Jialin Liu, Olivier Teytaud:
Variance Reduction in Population-Based Optimization: Application to Unit Commitment. GECCO (Companion) 2015: 1377-1378 - [i3]Marie-Liesse Cauwet, Olivier Teytaud, Hua-Min Liang, Shi-Jim Yen, Hung-Hsuan Lin, I-Chen Wu, Tristan Cazenave, Abdallah Saffidine:
Depth, balancing, and limits of the Elo model. CoRR abs/1511.02006 (2015) - 2014
- [j23]Cheng-Wei Chou, Ping-Chiang Chou, Jean-Joseph Christophe, Adrien Couëtoux, Pierre de Freminville, Nicolas Galichet, Chang-Shing Lee, Jialin Liu, David Lupien Saint-Pierre, Michèle Sebag, Olivier Teytaud, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen:
Strategic Choices in Optimization. J. Inf. Sci. Eng. 30(3): 727-747 (2014) - [c86]David Auger, Jialin Liu, Sylvie Ruette, David Lupien St-Pierre, Olivier Teytaud:
Sparse binary zero-sum games. ACML 2014 - [c85]David Lupien St-Pierre, Olivier Teytaud:
The Nash and the bandit approaches for adversarial portfolios. CIG 2014: 1-7 - [c84]Jean-Joseph Christophe, Jérémie Decock, Olivier Teytaud:
Direct Model-Predictive Control. ESANN 2014 - [c83]Jialin Liu, Olivier Teytaud:
Meta Online Learning: Experiments on a Unit Commitment Problem. ESANN 2014 - [c82]David Lupien St-Pierre, Olivier Teytaud:
Sharing Information in Adversarial Bandit. EvoApplications 2014: 386-398 - [c81]Jialin Liu, David Lupien St-Pierre, Olivier Teytaud:
A mathematically derived number of resamplings for noisy optimization. GECCO (Companion) 2014: 61-62 - [c80]Marie-Liesse Cauwet, Jialin Liu, Olivier Teytaud:
Algorithm Portfolios for Noisy Optimization: Compare Solvers Early. LION 2014: 1-15 - [p4]Fabien Teytaud, Olivier Teytaud:
Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms. Theory and Principled Methods for the Design of Metaheuristics 2014: 25-39 - [p3]Olivier Teytaud, Emmanuel Vázquez:
Designing an Optimal Search Algorithm with Respect to Prior Information. Theory and Principled Methods for the Design of Metaheuristics 2014: 111-128 - [i2]Nicolas Galichet, Michèle Sebag, Olivier Teytaud:
Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits. CoRR abs/1401.1123 (2014) - 2013
- [c79]Nicolas Galichet, Michèle Sebag, Olivier Teytaud:
Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits. ACML 2013: 245-260 - [c78]Sandra Astete Morales, Jialin Liu, Olivier Teytaud:
Log-log Convergence for Noisy Optimization. Artificial Evolution 2013: 16-28 - [c77]Jérémie Decock, Olivier Teytaud:
Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functions. Artificial Evolution 2013: 53-64 - [c76]Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud:
Fuzzy Ontologies for the Game of Go. On Fuzziness (1) 2013: 359-364 - [c75]Jérémie Decock, Olivier Teytaud:
Noisy optimization complexity under locality assumption. FOGA 2013: 183-190 - [c74]Chang-Shing Lee, Meng-Jhen Wu, Mei-Hui Wang, Olivier Teytaud, Hui-Min Wang, Shi-Jim Yen:
T2FML-based adaptive assessment system for computer game of Go. FUZZ-IEEE 2013: 1-7 - [c73]Sandra Astete Morales, Jialin Liu, Olivier Teytaud:
Noisy optimization convergence rates. GECCO (Companion) 2013: 223-224 - [c72]David Auger, Adrien Couëtoux, Olivier Teytaud:
Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. ECML/PKDD (1) 2013: 194-209 - 2012
- [j22]Sylvain Gelly, Levente Kocsis, Marc Schoenauer, Michèle Sebag, David Silver, Csaba Szepesvári, Olivier Teytaud:
The grand challenge of computer Go: Monte Carlo tree search and extensions. Commun. ACM 55(3): 106-113 (2012) - [j21]Chang-Shing Lee, Olivier Teytaud, Mei-Hui Wang, Shi-Jim Yen:
Computational Intelligence Meets Game of Go @ IEEE WCCI 2012 [Society Briefs]. IEEE Comput. Intell. Mag. 7(4): 10-12 (2012) - [j20]Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Shi-Jim Yen:
Human vs. Machine Go Competition in IEEE WCCCI 2012. J. Int. Comput. Games Assoc. 35(4): 230-235 (2012) - [j19]David Auger, Olivier Teytaud:
The Frontier of Decidability in Partially Observable Recursive Games. Int. J. Found. Comput. Sci. 23(7): 1439-1450 (2012) - [j18]Chang-Shing Lee, Mei-Hui Wang, Yu-Jen Chen, Hani Hagras, Meng-Jhen Wu, Olivier Teytaud:
Genetic fuzzy markup language for game of NoGo. Knowl. Based Syst. 34: 64-80 (2012) - [j17]François-Michel De Rainville, Christian Gagné, Olivier Teytaud, Denis Laurendeau:
Evolutionary optimization of low-discrepancy sequences. ACM Trans. Model. Comput. Simul. 22(2): 9:1-9:25 (2012) - [c71]Michèle Sebag, Olivier Teytaud:
Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper. LION 2012: 220-234 - [c70]Adrien Couëtoux, Hassen Doghmen, Olivier Teytaud:
Improving the Exploration in Upper Confidence Trees. LION 2012: 366-371 - [c69]Cheng-Wei Chou, Ping-Chiang Chou, Chang-Shing Lee, David Lupien Saint-Pierre, Olivier Teytaud, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen:
Strategic Choices: Small Budgets and Simple Regret. TAAI 2012: 182-187 - 2011
- [j16]Hervé Fournier, Olivier Teytaud:
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59(3): 387-408 (2011) - [j15]Shi-Jim Yen, Cheng-Wei Chou, Chang-Shing Lee, Hassen Doghmen, Olivier Teytaud:
The IEEE SSCI 2011 Human vs. Computer Go Competition. J. Int. Comput. Games Assoc. 34(2): 106-107 (2011) - [j14]Shi-Jim Yen, Shih-Yuan Chiu, Cheng-Wei Chou, Chang-Shing Lee, Hassen Doghmen, Fabien Teytaud, Olivier Teytaud:
Human vs. Computer Go Competition in FUZZ-IEEE 2011. J. Int. Comput. Games Assoc. 34(4): 243-247 (2011) - [c68]Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen:
Towards a Solution of 7x7 Go with Meta-MCTS. ACG 2011: 84-95 - [c67]David Lupien St-Pierre, Quentin Louveaux, Olivier Teytaud:
Online Sparse Bandit for Card Games. ACG 2011: 295-305 - [c66]Marc Schoenauer, Fabien Teytaud, Olivier Teytaud:
A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize. Artificial Evolution 2011: 37-48 - [c65]Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Hui-Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen:
Computational and human intelligence in blind Go. CIG 2011: 235-242 - [c64]Fabien Teytaud, Olivier Teytaud:
Lemmas on partial observation, with application to phantom games. CIG 2011: 243-249 - [c63]Bernard Helmstetter, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Mei-Hui Wang, Shi-Jim Yen:
Random positions in Go. CIG 2011: 250-257 - [c62]Cheng-Wei Chou, Olivier Teytaud, Shi-Jim Yen:
Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo. EvoApplications (1) 2011: 73-82 - [c61]Olivier Teytaud, Sébastien Flory:
Upper Confidence Trees with Short Term Partial Information. EvoApplications (1) 2011: 153-162 - [c60]Rémi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud:
Handling expensive optimization with large noise. FOGA 2011: 61-68 - [c59]Marc Schoenauer, Fabien Teytaud, Olivier Teytaud:
Simple tools for multimodal optimization. GECCO (Companion) 2011: 267-268 - [c58]Olivier Teytaud:
Comparison-based complexity of multiobjective optimization. GECCO 2011: 801-806 - [c57]Nataliya Sokolovska, Olivier Teytaud, Mario Milone:
Q-Learning with Double Progressive Widening: Application to Robotics. ICONIP (3) 2011: 103-112 - [c56]Chang-Shing Lee, Olivier Teytaud:
Intelligent agents for games and computer Go. IEEE IA 2011: 1-2 - [c55]Adrien Couëtoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard:
Continuous Upper Confidence Trees. LION 2011: 433-445 - [c54]Adrien Couëtoux, Mario Milone, Mátyás Brendel, Hassen Doghmen, Michèle Sebag, Olivier Teytaud:
Continuous RAVE. ACML 2011: 19-31 - [p2]Olivier Teytaud:
Lower Bounds for Evolution Strategies. Theory of Randomized Search Heuristics 2011: 327-354 - 2010
- [j13]Anne Auger, Olivier Teytaud:
Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms. Algorithmica 57(1): 121-146 (2010) - [j12]Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Yuan-Liang Wang:
The Game of Go @ IEEE WCCI 2010 [Society Briefs]. IEEE Comput. Intell. Mag. 5(4): 6-7 (2010) - [j11]Jean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Mei-Hui Wang, Olivier Teytaud:
Intelligent Agents for the Game of Go. IEEE Comput. Intell. Mag. 5(4): 28-42 (2010) - [j10]Chang-Shing Lee, Martin Müller, Olivier Teytaud:
Special Issue on Monte Carlo Techniques and Computer Go. IEEE Trans. Comput. Intell. AI Games 2(4): 225-228 (2010) - [j9]Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, Shang-Rong Tsai:
Current Frontiers in Computer Go. IEEE Trans. Comput. Intell. AI Games 2(4): 229-238 (2010) - [c53]Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Hérault, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yut:
Scalability and Parallelization of Monte-Carlo Tree Search. Computers and Games 2010: 48-58 - [c52]Arpad Rimmel, Fabien Teytaud, Olivier Teytaud:
Biasing Monte-Carlo Simulations through RAVE Values. Computers and Games 2010: 59-68 - [c51]Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez, Nataliya Sokolovska, Olivier Teytaud:
A Principled Method for Exploiting Opening Books. Computers and Games 2010: 136-144 - [c50]Fabien Teytaud, Olivier Teytaud:
On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms. CIG 2010: 359-364 - [c49]Jean-Baptiste Hoock, Olivier Teytaud:
Bandit-Based Genetic Programming. EuroGP 2010: 268-277 - [c48]Philippe Rolet, Olivier Teytaud:
Adaptive Noisy Optimization. EvoApplications (1) 2010: 592-601 - [c47]Amine Bourki, Matthieu Coulm, Philippe Rolet, Olivier Teytaud, Paul Vayssière:
Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing. ICINCO (1) 2010: 169-173 - [c46]Philippe Rolet, Olivier Teytaud:
Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis. LION 2010: 97-110 - [c45]Vincent Berthier, Hassen Doghmen, Olivier Teytaud:
Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search. LION 2010: 111-124 - [c44]Philippe Rolet, Olivier Teytaud:
Complexity Bounds for Batch Active Learning in Classification. ECML/PKDD (3) 2010: 293-305 - [c43]Fabien Teytaud, Olivier Teytaud:
Log(lambda) Modifications for Optimal Parallelism. PPSN (1) 2010: 254-263
2000 – 2009
- 2009
- [j8]Guillaume Chaslot, L. Chatriot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud:
Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Apprentissage et MC. Rev. d'Intelligence Artif. 23(2-3): 203-220 (2009) - [j7]Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong:
The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Trans. Comput. Intell. AI Games 1(1): 73-89 (2009) - [c42]Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud:
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. ACG 2009: 1-13 - [c41]Fabien Teytaud, Olivier Teytaud:
Creating an Upper-Confidence-Tree Program for Havannah. ACG 2009: 65-74 - [c40]Guillaume Chaslot, Jean-Baptiste Hoock, Fabien Teytaud, Olivier Teytaud:
On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. ESANN 2009 - [c39]Nur Merve Amil, Nicolas Bredèche, Christian Gagné, Sylvain Gelly, Marc Schoenauer, Olivier Teytaud:
A Statistical Learning Perspective of Genetic Programming. EuroGP 2009: 327-338 - [c38]Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud:
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go. EvoWorkshops 2009: 323-332 - [c37]Fabien Teytaud, Olivier Teytaud:
On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies. EvoWorkshops 2009: 655-664 - [c36]Chang-Shing Lee, Mei-Hui Wang, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo:
A novel ontology for computer go knowledge management. FUZZ-IEEE 2009: 1056-1061 - [c35]Fabien Teytaud, Olivier Teytaud:
Why one must use reweighting in estimation of distribution algorithms. GECCO 2009: 453-460 - [c34]François-Michel De Rainville, Christian Gagné, Olivier Teytaud, Denis Laurendeau:
Optimizing low-discrepancy sequences with an evolutionary algorithm. GECCO 2009: 1491-1498 - [c33]Philippe Rolet, Michèle Sebag, Olivier Teytaud:
Optimal robust expensive optimization is tractable. GECCO 2009: 1951-1956 - [c32]Philippe Rolet, Michèle Sebag, Olivier Teytaud:
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. ECML/PKDD (2) 2009: 302-317 - 2008
- [c31]Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Y. Kalemkarian:
The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning. ICINCO-ICSO 2008: 244-249 - [c30]Olivier Teytaud, Hervé Fournier:
Lower Bounds for Evolution Strategies Using VC-Dimension. PPSN 2008: 102-111 - [c29]Olivier Teytaud:
When Does Quasi-random Work?. PPSN 2008: 325-336 - 2007
- [j6]Sylvain Gelly, Sylvie Ruette, Olivier Teytaud:
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime. Evol. Comput. 15(4): 411-434 (2007) - [j5]Olivier Teytaud:
On the Hardness of Offline Multi-objective Optimization. Evol. Comput. 15(4): 475-491 (2007) - [c28]Olivier Teytaud:
Conditioning, Halting Criteria and Choosing lambda. Artificial Evolution 2007: 196-206 - [c27]Olivier Teytaud, Anne Auger:
On the adaptation of noise level for stochastic optimization. IEEE Congress on Evolutionary Computation 2007: 3027-3034 - [c26]Anne Auger, Olivier Teytaud:
Continuous lunches are free! GECCO 2007: 916-922 - [c25]Olivier Teytaud, Sylvain Gelly:
DCMA: yet another derandomization in covariance-matrix-adaptation. GECCO 2007: 955-963 - [c24]Olivier Teytaud, Sylvain Gelly:
Nonlinear programming in approximate dynamic programming - bang-bang solutions, stock-management and unsmooth penalties. ICINCO-ICSO 2007: 47-54 - [c23]Olivier Teytaud, Sylvain Gelly, Jérémie Mary:
Active learning in regression, with application to stochastic dynamic programming. ICINCO-ICSO 2007: 198-205 - [c22]Olivier Teytaud:
Slightly Beyond Turing's Computability for Studying Genetic Programming. MCU 2007: 279-290 - [p1]Stéphane Lallich, Olivier Teytaud, Elie Prudhomme:
Association Rule Interestingness: Measure and Statistical Validation. Quality Measures in Data Mining 2007: 251-275 - 2006
- [j4]Sylvain Gelly, Olivier Teytaud:
Bayesian Networks: a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure Bayesian Networks Learning. Rev. d'Intelligence Artif. 20(6): 717-755 (2006) - [j3]Sylvain Gelly, Olivier Teytaud, Nicolas Bredèche, Marc Schoenauer:
Universal Consistency and Bloat in GP Some theoretical considerations about Genetic Programming from a Statistical Learning Theory viewpoint. Rev. d'Intelligence Artif. 20(6): 805-827 (2006) - [c21]Olivier Teytaud:
Why Simulation-Based Approachs with Combined Fitness are a Good Approach for Mining Spaces of Turing-equivalent Functions. IEEE Congress on Evolutionary Computation 2006: 283-290 - [c20]Sylvain Gelly, Olivier Teytaud, Christian Gagné:
Resource-Aware Parameterizations of EDA. IEEE Congress on Evolutionary Computation 2006: 2506-2512 - [c19]Sylvain Gelly, Jérémie Mary, Olivier Teytaud:
Learning for stochastic dynamic programming. ESANN 2006: 191-196 - [c18]Olivier Teytaud, Sylvain Gelly:
General Lower Bounds for Evolutionary Algorithms. PPSN 2006: 21-31 - [c17]Olivier Teytaud, Sylvain Gelly, Jérémie Mary:
On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy. PPSN 2006: 32-41 - [i1]Antoine Moreau, Olivier Teytaud, Jean-Pierre Bertoglio:
Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models. CoRR abs/physics/0606053 (2006) - 2005
- [j2]Frédéric Flin, Jean-Bruno Brzoska, David Coeurjolly, Romeu André Pieritz, Bernard Lesaffre, Cécile Coléou, Pascal Lamboley, Olivier Teytaud, Gérard Vignoles, Jean-François Delesse:
Adaptive estimation of normals and surface area for discrete 3-D objects: application to snow binary data from X-ray tomography. IEEE Trans. Image Process. 14(5): 585-596 (2005) - [c16]Anne Auger, Mohamed Jebalia, Olivier Teytaud:
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies. Artificial Evolution 2005: 296-307 - [c15]Nicolas Baskiotis, Michèle Sebag, Olivier Teytaud:
Systèmes inductifs-déductifs: une approche statistique. CAP 2005: 145-146 - [c14]Sylvain Gelly, Olivier Teytaud:
Statistical asymptotic and non-asymptotic consistency of bayesian networks: convergence to the right structure and consistent probability estimates. CAP 2005: 147-162 - [c13]Sylvain Gelly, Olivier Teytaud, Nicolas Bredèche, Marc Schoenauer:
Apprentissage statistique et programmation génétique: la croissance du code est-elle inévitable? CAP 2005: 163-178 - [c12]Sylvain Gelly, Jérémie Mary, Olivier Teytaud:
Taylor-based pseudo-metrics for random process fitting in dynamic programming: expected loss minimization and risk management. CAP 2005: 183-184 - [c11]Nicolas Tarrisson, Michèle Sebag, Olivier Teytaud, Julien Lefèvre, Sylvain Baillet:
Multi-objective Multi-modal Optimization for Mining Spatio-temporal Patterns. CAP 2005: 217-230 - [c10]Anne Auger, Marc Schoenauer, Olivier Teytaud:
Local and global order 3/2 convergence of a surrogate evolutionary algorithm. GECCO 2005: 857-864 - [c9]Sylvain Gelly, Olivier Teytaud, Nicolas Bredèche, Marc Schoenauer:
A statistical learning theory approach of bloat. GECCO 2005: 1783-1784 - [c8]Michèle Sebag, Nicolas Tarrisson, Olivier Teytaud, Julien Lefèvre, Sylvain Baillet:
A Multi-Objective Multi-Modal Optimization Approach for Mining Stable Spatio-Temporal Patterns. IJCAI 2005: 859-864 - 2004
- [c7]Stéphane Lallich, Elie Prudhomme, Olivier Teytaud:
Contrôle du risque multiple pour la sélection de règles d'association significatives. EGC 2004: 305-316 - 2002
- [c6]Gérald Gavin, Olivier Teytaud:
Lower Bounds for Training and Leave-One-Out Estimates of the Generalization Error. ICANN 2002: 583-588 - [c5]David Coeurjolly, Frédéric Flin, Olivier Teytaud, Laure Tougne:
Multigrid Convergence and Surface Area Estimation. Theoretical Foundations of Computer Vision 2002: 101-119 - 2001
- [j1]Olivier Teytaud:
Decidability of the halting problem for Matiyasevich deterministic machines. Theor. Comput. Sci. 257(1-2): 241-251 (2001) - [c4]Radwan Jalam, Olivier Teytaud:
Identification de la langue et catégorisation de textes basées sur les N-grammes. EGC 2001: 227-238 - [c3]Olivier Teytaud, Hélène Paugam-Moisy:
Bounds on the Generalization Ability of Bayesian Inference and Gibbs Algorithms. ICANN 2001: 265-270 - [c2]Olivier Teytaud, David Sarrut:
Kernel Based Image Classification. ICANN 2001: 369-375 - 2000
- [c1]David Coeurjolly, Isabelle Debled-Rennesson, Olivier Teytaud:
Segmentation and Length Estimation of 3D Discrete Curves. Digital and Image Geometry 2000: 299-317
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 2025-03-04 21:12 CET 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:
