Andreas Bärtschi
Andreas Bärtschi
Потвърден имейл адрес: lanl.gov
Заглавие
Позовавания
Позовавания
Година
Quantum Algorithm Implementations for Beginners
J Abhijith, A Adedoyin, J Ambrosiano, P Anisimov, A Bärtschi, W Casper, ...
arXiv preprint arXiv:1804.03719v2, 2020
84*2020
Collaborative delivery with energy-constrained mobile robots
A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ...
Theoretical Computer Science 810, 2-14, 2020
24*2020
Conflict-Free Chromatic Art Gallery Coverage
A Bärtschi, S Suri
Algorithmica 68 (1), 265-283, 2014
222014
Conflict-free Chromatic Art Gallery Coverage
A Bärtschi, S Suri
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
222012
Energy-Efficient Delivery by Heterogeneous Mobile Agents
A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, 10:1 …, 2017
212017
Collaborative delivery with energy-constrained mobile robots
A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ...
23rd International Colloquium on Structural Information and Communication …, 2016
192016
Improved bounds for the conflict-free chromatic art gallery problem
A Bärtschi, SK Ghosh, M Mihalák, T Tschager, P Widmayer
30th Annual Symposium on Computational Geometry, SoCG 2014, 144-153, 2014
132014
Deterministic Preparation of Dicke States
A Bärtschi, S Eidenbenz
22nd International Symposium on Fundamentals of Computation Theory, FCT 2019 …, 2019
82019
Energy-Efficient Fast Delivery by Mobile Agents
A Bärtschi, T Tschager
21st International Symposium on Fundamentals of Computation Theory, FCT 2017 …, 2017
82017
Truthful Mechanisms for Delivery with Agents
A Bärtschi, D Graf, P Penna
17th Workshop on Algorithmic Approaches for Transportation Modelling …, 2017
8*2017
Collective Fast Delivery by Energy-Efficient Agents
A Bärtschi, D Graf, M Mihalák
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
72018
On Conflict-Free Multi-coloring
A Bärtschi, F Grandoni
14th International Workshop on Algorithms and Data Structures, WADS 2015 …, 2015
72015
Efficient Delivery with Mobile Agents
A Bärtschi
ETH Zürich, Department of Computer Science, 2017
52017
On Computing the Total Displacement Number via Weighted Motzkin Paths
A Bärtschi, B Geissmann, D Graf, T Hruz, P Penna, T Tschager
27th International Workshop on Combinatorial Algorithms, IWOCA 2016, 423-434, 2016
42016
The Quantum Alternating Operator Ansatz on Max-k Vertex Cover
J Cook, S Eidenbenz, A Bärtschi
IEEE International Conference on Quantum Computing and Engineering, QCE'20 …, 2020
32020
Coloring Variations of the Art Gallery Problem
A Bärtschi
ETH Zürich, Department of Mathematics, 2011
22011
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies
S Zbinden, A Bärtschi, H Djidjev, S Eidenbenz
International Conference on High Performance Computing, ISC HPC'20, 187-206, 2020
12020
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
A Bärtschi, S Eidenbenz
IEEE International Conference on Quantum Computing and Engineering, QCE'20 …, 2020
12020
Near-gathering of energy-constrained mobile agents
A Bärtschi, E Bampas, J Chalopin, S Das, C Karousatou, M Mihalák
26th International Colloquium on Structural Information and Communication …, 2019
2019
Spieltheorie
A Bärtschi
EducETH - Unterrichtsmaterialien Mathematik, 2011
2011
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20