Dirk Oliver Theis

University of Tartu — EE

Computer Science · Physical Sciences

12h-index763citations93works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(51), graph theory and CDMA systems(20), Complexity and Algorithms in Graphs(19), Vehicle Routing Optimization Methods(18), Limits and Structures in Graph Theory(15)

Publications93 total

"Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions
Quantum·2023· 2 citedOpen Access
"Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions
arXiv (Cornell University)·2022Open Access
Optimality of Finite-Support Parameter Shift Rules for Derivatives of Variational Quantum Circuits
arXiv (Cornell University)·2021· 2 citedOpen Access
Partial Information Decomposition of Boolean Functions: a Fourier Analysis perspective
arXiv (Cornell University)·2020Open Access
Input Redundancy for Parameterized Quantum Circuits
Frontiers in Physics·2020· 63 citedOpen Access
Information content of queries in training Parameterized Quantum Circuits
arXiv (Cornell University)·2019Open Access
Input Redundancy for Parameterized Quantum Circuits
arXiv (Cornell University)·2019· 3 citedOpen Access
Attention manipulation in reinforcement learning agents
2019 Conference on Cognitive Computational Neuroscience·2019· 1 citedOpen Access
Calculus on parameterized quantum circuits
arXiv (Cornell University)·2018· 11 citedOpen Access
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs
Theoretical Computer Science·2018· 2 citedOpen Access
Note on (active-)QRAM-style data access as a quantum circuit
arXiv (Cornell University)·2018Open Access
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
Operations Research Letters·2018· 5 cited
Optimizing Bivariate Partial Information Decomposition
arXiv (Cornell University)·2018· 2 citedOpen Access
Analyzing Information Distribution in Complex Systems
Entropy·2017· 10 citedOpen Access
Short note on the number of 1-ascents in dispersed Dyck paths
Discrete Mathematics Algorithms and Applications·2017· 2 citedOpen Access
Fooling sets and the Spanning Tree polytope
Information Processing Letters·2017· 1 cited
Bivariate Partial Information Decomposition: The Optimization Perspective
Entropy·2017· 30 citedOpen Access
The Rectangle Covering Number of Random Boolean Matrices
The Electronic Journal of Combinatorics·2017Open Access
On the Combinatorial Lower Bound for the Extension Complexity of the\n Spanning Tree Polytope
arXiv (Cornell University)·2017Open Access
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
arXiv (Cornell University)·2017· 1 citedOpen Access
page 1 of 5Next →

Frequent Co-authors

Gerhard Reinelt(9), Troy Lee(6), Samuel Fiorini(5), Adam N. Letchford(4), Volker Kaibel(4), Kanstantsin Pashkovich(4), Mirjam Friesen(4), Kaveh Khoshkhah(4), Marcus Oswald(3), Gwenaël Joret(3), Abdullah Makkeh(3), Mozhgan Pourmoradnasseri(3), Marcin Kamiński(2), Raúl Vicente(2), Javier Gil Vidal(2), Hartmut Klauck(2), Gianpaolo Oriolo(2), Laura Sanità(2), Aya Hamed(2), Mehdi Khosravian Ghadikolaei(2)