---
_id: '40696'
author:
- first_name: S.
full_name: Smirnov, S.
last_name: Smirnov
- first_name: A.
full_name: Eguizabal, A.
last_name: Eguizabal
citation:
ama: 'Smirnov S, Eguizabal A. DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS.
In: 2018 IEEE International Conference on Metrology for Archaeology and Cultural
Heritage. ; 2018.'
apa: Smirnov, S., & Eguizabal, A. (2018). DEEP LEARNING FOR OBJECT DETECTION
IN FINE-ART PAINTINGS. 2018 IEEE International Conference on Metrology for
Archaeology and Cultural Heritage.
bibtex: '@inproceedings{Smirnov_Eguizabal_2018, title={DEEP LEARNING FOR OBJECT
DETECTION IN FINE-ART PAINTINGS}, booktitle={2018 IEEE International Conference
on Metrology for Archaeology and Cultural Heritage}, author={Smirnov, S. and Eguizabal,
A.}, year={2018} }'
chicago: Smirnov, S., and A. Eguizabal. “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART
PAINTINGS.” In 2018 IEEE International Conference on Metrology for Archaeology
and Cultural Heritage, 2018.
ieee: S. Smirnov and A. Eguizabal, “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART
PAINTINGS,” 2018.
mla: Smirnov, S., and A. Eguizabal. “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART
PAINTINGS.” 2018 IEEE International Conference on Metrology for Archaeology
and Cultural Heritage, 2018.
short: 'S. Smirnov, A. Eguizabal, in: 2018 IEEE International Conference on Metrology
for Archaeology and Cultural Heritage, 2018.'
date_created: 2023-01-30T11:51:38Z
date_updated: 2023-01-30T12:02:40Z
department:
- _id: '263'
publication: 2018 IEEE International Conference on Metrology for Archaeology and Cultural
Heritage
status: public
title: DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS
type: conference
user_id: '43497'
year: '2018'
...
---
_id: '40706'
author:
- first_name: Christian
full_name: Lameiro, Christian
last_name: Lameiro
- first_name: Ignacio
full_name: Santamaria, Ignacio
last_name: Santamaria
- first_name: Peter J.
full_name: Schreier, Peter J.
last_name: Schreier
citation:
ama: 'Lameiro C, Santamaria I, Schreier PJ. Performance analysis of maximally improper
signaling for multiple-antenna systems. In: Proc. IEEE Wireless Comm. Networking
Conf. (WCNC). ; 2018.'
apa: Lameiro, C., Santamaria, I., & Schreier, P. J. (2018). Performance analysis
of maximally improper signaling for multiple-antenna systems. Proc. IEEE Wireless
Comm. Networking Conf. (WCNC).
bibtex: '@inproceedings{Lameiro_Santamaria_Schreier_2018, place={Barcelona, Spain},
title={Performance analysis of maximally improper signaling for multiple-antenna
systems}, booktitle={Proc. IEEE Wireless Comm. Networking Conf. (WCNC)}, author={Lameiro,
Christian and Santamaria, Ignacio and Schreier, Peter J.}, year={2018} }'
chicago: Lameiro, Christian, Ignacio Santamaria, and Peter J. Schreier. “Performance
Analysis of Maximally Improper Signaling for Multiple-Antenna Systems.” In Proc.
IEEE Wireless Comm. Networking Conf. (WCNC). Barcelona, Spain, 2018.
ieee: C. Lameiro, I. Santamaria, and P. J. Schreier, “Performance analysis of maximally
improper signaling for multiple-antenna systems,” 2018.
mla: Lameiro, Christian, et al. “Performance Analysis of Maximally Improper Signaling
for Multiple-Antenna Systems.” Proc. IEEE Wireless Comm. Networking Conf. (WCNC),
2018.
short: 'C. Lameiro, I. Santamaria, P.J. Schreier, in: Proc. IEEE Wireless Comm.
Networking Conf. (WCNC), Barcelona, Spain, 2018.'
date_created: 2023-01-30T11:51:40Z
date_updated: 2023-01-30T12:03:17Z
department:
- _id: '263'
place: Barcelona, Spain
publication: Proc. IEEE Wireless Comm. Networking Conf. (WCNC)
status: public
title: Performance analysis of maximally improper signaling for multiple-antenna systems
type: conference
user_id: '43497'
year: '2018'
...
---
_id: '42214'
author:
- first_name: P. K.
full_name: Mishra, P. K.
last_name: Mishra
- first_name: D.
full_name: Chatterjee, D.
last_name: Chatterjee
- first_name: D. E.
full_name: Quevedo, D. E.
last_name: Quevedo
citation:
ama: Mishra PK, Chatterjee D, Quevedo DE. Sparse and constrained stochastic predictive
control for networked systems. Automatica. 2018;87(1):40–51.
apa: Mishra, P. K., Chatterjee, D., & Quevedo, D. E. (2018). Sparse and constrained
stochastic predictive control for networked systems. Automatica, 87(1),
40–51.
bibtex: '@article{Mishra_Chatterjee_Quevedo_2018, title={Sparse and constrained
stochastic predictive control for networked systems}, volume={87}, number={1},
journal={Automatica}, author={Mishra, P. K. and Chatterjee, D. and Quevedo, D.
E.}, year={2018}, pages={40–51} }'
chicago: 'Mishra, P. K., D. Chatterjee, and D. E. Quevedo. “Sparse and Constrained
Stochastic Predictive Control for Networked Systems.” Automatica 87, no.
1 (2018): 40–51.'
ieee: P. K. Mishra, D. Chatterjee, and D. E. Quevedo, “Sparse and constrained stochastic
predictive control for networked systems,” Automatica, vol. 87, no. 1,
pp. 40–51, 2018.
mla: Mishra, P. K., et al. “Sparse and Constrained Stochastic Predictive Control
for Networked Systems.” Automatica, vol. 87, no. 1, 2018, pp. 40–51.
short: P.K. Mishra, D. Chatterjee, D.E. Quevedo, Automatica 87 (2018) 40–51.
date_created: 2023-02-17T13:58:58Z
date_updated: 2023-02-17T14:01:27Z
department:
- _id: '57'
intvolume: ' 87'
issue: '1'
language:
- iso: eng
page: 40–51
publication: Automatica
status: public
title: Sparse and constrained stochastic predictive control for networked systems
type: journal_article
user_id: '238'
volume: 87
year: '2018'
...
---
_id: '42216'
author:
- first_name: A. M.
full_name: L\’opez, A. M.
last_name: L\’opez
- first_name: D. E.
full_name: Quevedo, D. E.
last_name: Quevedo
- first_name: R. P.
full_name: Aguilera, R. P.
last_name: Aguilera
- first_name: T.
full_name: Geyer, T.
last_name: Geyer
- first_name: N.
full_name: Oikonomou, N.
last_name: Oikonomou
citation:
ama: L\’opez AM, Quevedo DE, Aguilera RP, Geyer T, Oikonomou N. Limitations and
Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters.
Trans Power Electron. 2018;33(7):6292–6303.
apa: L\’opez, A. M., Quevedo, D. E., Aguilera, R. P., Geyer, T., & Oikonomou,
N. (2018). Limitations and Accuracy of a Continuous Reduced-Order Model for Modular
Multilevel Converters. Trans. Power Electron., 33(7), 6292–6303.
bibtex: '@article{L\’opez_Quevedo_Aguilera_Geyer_Oikonomou_2018, title={Limitations
and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters},
volume={33}, number={7}, journal={Trans. Power Electron.}, author={L\’opez, A.
M. and Quevedo, D. E. and Aguilera, R. P. and Geyer, T. and Oikonomou, N.}, year={2018},
pages={6292–6303} }'
chicago: 'L\’opez, A. M., D. E. Quevedo, R. P. Aguilera, T. Geyer, and N. Oikonomou.
“Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel
Converters.” Trans. Power Electron. 33, no. 7 (2018): 6292–6303.'
ieee: A. M. L\’opez, D. E. Quevedo, R. P. Aguilera, T. Geyer, and N. Oikonomou,
“Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel
Converters,” Trans. Power Electron., vol. 33, no. 7, pp. 6292–6303, 2018.
mla: L\’opez, A. M., et al. “Limitations and Accuracy of a Continuous Reduced-Order
Model for Modular Multilevel Converters.” Trans. Power Electron., vol.
33, no. 7, 2018, pp. 6292–6303.
short: A.M. L\’opez, D.E. Quevedo, R.P. Aguilera, T. Geyer, N. Oikonomou, Trans.
Power Electron. 33 (2018) 6292–6303.
date_created: 2023-02-17T14:34:07Z
date_updated: 2023-02-17T14:38:53Z
department:
- _id: '57'
intvolume: ' 33'
issue: '7'
language:
- iso: eng
page: 6292–6303
publication: Trans. Power Electron.
status: public
title: Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel
Converters
type: journal_article
user_id: '238'
volume: 33
year: '2018'
...
---
_id: '42219'
author:
- first_name: B.
full_name: Demirel, B.
last_name: Demirel
- first_name: E.
full_name: Ghadimi, E.
last_name: Ghadimi
- first_name: D. E.
full_name: Quevedo, D. E.
last_name: Quevedo
- first_name: M.
full_name: Johansson, M.
last_name: Johansson
citation:
ama: 'Demirel B, Ghadimi E, Quevedo DE, Johansson M. Optimal control of linear systems
with limited control actions: threshold-based event-triggered control. Trans
Contr Network Syst. 2018;5(3):1275–1286.'
apa: 'Demirel, B., Ghadimi, E., Quevedo, D. E., & Johansson, M. (2018). Optimal
control of linear systems with limited control actions: threshold-based event-triggered
control. Trans. Contr. Network Syst., 5(3), 1275–1286.'
bibtex: '@article{Demirel_Ghadimi_Quevedo_Johansson_2018, title={Optimal control
of linear systems with limited control actions: threshold-based event-triggered
control}, volume={5}, number={3}, journal={Trans. Contr. Network Syst.}, author={Demirel,
B. and Ghadimi, E. and Quevedo, D. E. and Johansson, M.}, year={2018}, pages={1275–1286}
}'
chicago: 'Demirel, B., E. Ghadimi, D. E. Quevedo, and M. Johansson. “Optimal Control
of Linear Systems with Limited Control Actions: Threshold-Based Event-Triggered
Control.” Trans. Contr. Network Syst. 5, no. 3 (2018): 1275–1286.'
ieee: 'B. Demirel, E. Ghadimi, D. E. Quevedo, and M. Johansson, “Optimal control
of linear systems with limited control actions: threshold-based event-triggered
control,” Trans. Contr. Network Syst., vol. 5, no. 3, pp. 1275–1286, 2018.'
mla: 'Demirel, B., et al. “Optimal Control of Linear Systems with Limited Control
Actions: Threshold-Based Event-Triggered Control.” Trans. Contr. Network Syst.,
vol. 5, no. 3, 2018, pp. 1275–1286.'
short: B. Demirel, E. Ghadimi, D.E. Quevedo, M. Johansson, Trans. Contr. Network
Syst. 5 (2018) 1275–1286.
date_created: 2023-02-17T14:34:41Z
date_updated: 2023-02-17T14:38:43Z
department:
- _id: '57'
intvolume: ' 5'
issue: '3'
language:
- iso: eng
page: 1275–1286
publication: Trans. Contr. Network Syst.
status: public
title: 'Optimal control of linear systems with limited control actions: threshold-based
event-triggered control'
type: journal_article
user_id: '238'
volume: 5
year: '2018'
...
---
_id: '42218'
author:
- first_name: B.
full_name: Demirel, B.
last_name: Demirel
- first_name: A.
full_name: Ramaswamy, A.
last_name: Ramaswamy
- first_name: D. E.
full_name: Quevedo, D. E.
last_name: Quevedo
- first_name: H.
full_name: Karl, H.
last_name: Karl
citation:
ama: 'Demirel B, Ramaswamy A, Quevedo DE, Karl H. DeepCAS: A Deep Reinforcement
Learning Algorithm for Control-Aware Scheduling. IEEE Contr Syst Lett.
2018;2(4):737–742.'
apa: 'Demirel, B., Ramaswamy, A., Quevedo, D. E., & Karl, H. (2018). DeepCAS:
A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. IEEE
Contr. Syst. Lett., 2(4), 737–742.'
bibtex: '@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={DeepCAS: A Deep Reinforcement
Learning Algorithm for Control-Aware Scheduling}, volume={2}, number={4}, journal={IEEE
Contr. Syst. Lett.}, author={Demirel, B. and Ramaswamy, A. and Quevedo, D. E.
and Karl, H.}, year={2018}, pages={737–742} }'
chicago: 'Demirel, B., A. Ramaswamy, D. E. Quevedo, and H. Karl. “DeepCAS: A Deep
Reinforcement Learning Algorithm for Control-Aware Scheduling.” IEEE Contr.
Syst. Lett. 2, no. 4 (2018): 737–742.'
ieee: 'B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement
Learning Algorithm for Control-Aware Scheduling,” IEEE Contr. Syst. Lett.,
vol. 2, no. 4, pp. 737–742, 2018.'
mla: 'Demirel, B., et al. “DeepCAS: A Deep Reinforcement Learning Algorithm for
Control-Aware Scheduling.” IEEE Contr. Syst. Lett., vol. 2, no. 4, 2018,
pp. 737–742.'
short: B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Contr. Syst. Lett.
2 (2018) 737–742.
date_created: 2023-02-17T14:34:32Z
date_updated: 2023-02-17T14:38:46Z
department:
- _id: '57'
intvolume: ' 2'
issue: '4'
language:
- iso: eng
page: 737–742
publication: IEEE Contr. Syst. Lett.
status: public
title: 'DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling'
type: journal_article
user_id: '238'
volume: 2
year: '2018'
...
---
_id: '42217'
author:
- first_name: A.
full_name: Leong, A.
last_name: Leong
- first_name: S.
full_name: Dey, S.
last_name: Dey
- first_name: D. E.
full_name: Quevedo, D. E.
last_name: Quevedo
citation:
ama: Leong A, Dey S, Quevedo DE. Transmission scheduling for remote state estimation
and control with an energy harvesting sensor. Automatica. 2018;91(5):54–60.
apa: Leong, A., Dey, S., & Quevedo, D. E. (2018). Transmission scheduling for
remote state estimation and control with an energy harvesting sensor. Automatica,
91(5), 54–60.
bibtex: '@article{Leong_Dey_Quevedo_2018, title={Transmission scheduling for remote
state estimation and control with an energy harvesting sensor}, volume={91}, number={5},
journal={Automatica}, author={Leong, A. and Dey, S. and Quevedo, D. E.}, year={2018},
pages={54–60} }'
chicago: 'Leong, A., S. Dey, and D. E. Quevedo. “Transmission Scheduling for Remote
State Estimation and Control with an Energy Harvesting Sensor.” Automatica
91, no. 5 (2018): 54–60.'
ieee: A. Leong, S. Dey, and D. E. Quevedo, “Transmission scheduling for remote state
estimation and control with an energy harvesting sensor,” Automatica, vol.
91, no. 5, pp. 54–60, 2018.
mla: Leong, A., et al. “Transmission Scheduling for Remote State Estimation and
Control with an Energy Harvesting Sensor.” Automatica, vol. 91, no. 5,
2018, pp. 54–60.
short: A. Leong, S. Dey, D.E. Quevedo, Automatica 91 (2018) 54–60.
date_created: 2023-02-17T14:34:20Z
date_updated: 2023-02-17T14:38:50Z
department:
- _id: '57'
intvolume: ' 91'
issue: '5'
language:
- iso: eng
page: 54–60
publication: Automatica
status: public
title: Transmission scheduling for remote state estimation and control with an energy
harvesting sensor
type: journal_article
user_id: '238'
volume: 91
year: '2018'
...
---
_id: '42215'
author:
- first_name: S.
full_name: Liu, S.
last_name: Liu
- first_name: L.
full_name: Xie, L.
last_name: Xie
- first_name: D. E.
full_name: Quevedo, D. E.
last_name: Quevedo
citation:
ama: Liu S, Xie L, Quevedo DE. Event-Triggered Quantized Communication-Based Distributed
Convex Optimization. Trans Contr Network Syst. 2018;5(1):167–178.
apa: Liu, S., Xie, L., & Quevedo, D. E. (2018). Event-Triggered Quantized Communication-Based
Distributed Convex Optimization. Trans. Contr. Network Syst., 5(1),
167–178.
bibtex: '@article{Liu_Xie_Quevedo_2018, title={Event-Triggered Quantized Communication-Based
Distributed Convex Optimization}, volume={5}, number={1}, journal={Trans. Contr.
Network Syst.}, author={Liu, S. and Xie, L. and Quevedo, D. E.}, year={2018},
pages={167–178} }'
chicago: 'Liu, S., L. Xie, and D. E. Quevedo. “Event-Triggered Quantized Communication-Based
Distributed Convex Optimization.” Trans. Contr. Network Syst. 5, no. 1
(2018): 167–178.'
ieee: S. Liu, L. Xie, and D. E. Quevedo, “Event-Triggered Quantized Communication-Based
Distributed Convex Optimization,” Trans. Contr. Network Syst., vol. 5,
no. 1, pp. 167–178, 2018.
mla: Liu, S., et al. “Event-Triggered Quantized Communication-Based Distributed
Convex Optimization.” Trans. Contr. Network Syst., vol. 5, no. 1, 2018,
pp. 167–178.
short: S. Liu, L. Xie, D.E. Quevedo, Trans. Contr. Network Syst. 5 (2018) 167–178.
date_created: 2023-02-17T14:33:58Z
date_updated: 2023-02-17T14:38:57Z
department:
- _id: '57'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
page: 167–178
publication: Trans. Contr. Network Syst.
status: public
title: Event-Triggered Quantized Communication-Based Distributed Convex Optimization
type: journal_article
user_id: '238'
volume: 5
year: '2018'
...
---
_id: '8162'
abstract:
- lang: eng
text: 'The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are
canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively,
where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT
has been well-studied for special tractable cases, as well as from a parameterized
complexity perspective, much less is known in similar settings for k-QSAT. Here,
we study the open problem of computing satisfying assignments to k-QSAT instances
which have a "matching" or "dimer covering"; this is an NP problem whose decision
variant is trivial, but whose search complexity remains open. Our results fall
into three directions, all of which relate to the "matching" setting: (1) We give
a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most
two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a
certain non-trivial class, which allows us to obtain exponential speedups over
brute force methods in some cases by reducing the problem to solving for a single
root of a single univariate polynomial. (3) We conduct a structural graph theoretic
study of 3-QSAT interaction graphs which have a "matching". We remark that the
results of (2), in particular, introduce a number of new tools to the study of
Quantum SAT, including graph theoretic concepts such as transfer filtrations and
blow-ups from algebraic geometry; we hope these prove useful elsewhere.'
author:
- first_name: Marco
full_name: Aldi, Marco
last_name: Aldi
- first_name: Niel
full_name: de Beaudrap, Niel
last_name: de Beaudrap
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Seyran
full_name: Saeedi, Seyran
last_name: Saeedi
citation:
ama: 'Aldi M, de Beaudrap N, Gharibian S, Saeedi S. On Efficiently Solvable Cases
of Quantum k-SAT. In: Potapov I, Spirakis P, Worrell J, eds. 43rd International
Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Vol
117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
- Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:10.4230/LIPIcs.MFCS.2018.38'
apa: Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018). On Efficiently
Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, & J. Worrell
(Eds.), 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018) (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.38
bibtex: '@inproceedings{Aldi_de Beaudrap_Gharibian_Saeedi_2018, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={On Efficiently Solvable Cases of Quantum k-SAT}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.38},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
author={Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran},
editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={38:1-38:16},
collection={Leibniz International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On
Efficiently Solvable Cases of Quantum K-SAT.” In 43rd International Symposium
on Mathematical Foundations of Computer Science (MFCS 2018), edited by Igor
Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.38.'
ieee: 'M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable
Cases of Quantum k-SAT,” in 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018), Liverpool, UK, 2018, vol. 117, p. 38:1-38:16,
doi: 10.4230/LIPIcs.MFCS.2018.38.'
mla: Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” 43rd
International Symposium on Mathematical Foundations of Computer Science (MFCS
2018), edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2018, p. 38:1-38:16, doi:10.4230/LIPIcs.MFCS.2018.38.
short: 'M. Aldi, N. de Beaudrap, S. Gharibian, S. Saeedi, in: I. Potapov, P. Spirakis,
J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany, 2018, p. 38:1-38:16.'
conference:
location: Liverpool, UK
name: 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS 2018)
date_created: 2019-03-01T11:34:41Z
date_updated: 2023-02-28T11:01:16Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.MFCS.2018.38
editor:
- first_name: Igor
full_name: Potapov, Igor
last_name: Potapov
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
- first_name: James
full_name: Worrell, James
last_name: Worrell
external_id:
arxiv:
- '1712.09617'
intvolume: ' 117'
keyword:
- search complexity
- local Hamiltonian
- Quantum SAT
- algebraic geometry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/volltexte/2018/9620/
oa: '1'
page: 38:1-38:16
place: Dagstuhl, Germany
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)
publication_identifier:
unknown:
- 978-3-95977-086-6
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: On Efficiently Solvable Cases of Quantum k-SAT
type: conference
user_id: '71541'
volume: 117
year: '2018'
...
---
_id: '8161'
abstract:
- lang: eng
text: The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing
separations in computational complexity theory (modulo standard conjectures such
as PH does not collapse). Here, we study whether two quantum generalizations of
PH can similarly prove separations in the quantum setting. The first generalization,
QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the
former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem.
For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid
Method for efficiently solving semidefinite programs. These results yield two
implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled
proofs, a complexity class whose characterization has proven difficult. First,
if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to
make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting
Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e.,
alternating quantifiers do not help in the presence of "unentanglement"), QMA(2)
is strictly contained in NEXP.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Miklos
full_name: Santha, Miklos
last_name: Santha
- first_name: Jamie
full_name: Sikora, Jamie
last_name: Sikora
- first_name: Aarthi
full_name: Sundaram, Aarthi
last_name: Sundaram
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
ama: 'Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis
P, Worrell J, eds. 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018). Vol 117. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16.
doi:10.4230/LIPIcs.MFCS.2018.58'
apa: Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018).
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).
In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium
on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, p.
58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
bibtex: '@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Quantum Generalizations of the Polynomial Hierarchy with Applications to
QMA(2)}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.58},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi
and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James},
year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin
Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications
to QMA(2).” In 43rd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James
Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs).
Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.58.'
ieee: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2),” in 43rd International
Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool,
UK, 2018, vol. 117, p. 58:1-58:16, doi: 10.4230/LIPIcs.MFCS.2018.58.'
mla: Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy
with Applications to QMA(2).” 43rd International Symposium on Mathematical
Foundations of Computer Science (MFCS 2018), edited by Igor Potapov et al.,
vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16,
doi:10.4230/LIPIcs.MFCS.2018.58.
short: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov,
P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany, 2018, p. 58:1-58:16.'
conference:
location: Liverpool, UK
name: 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS 2018)
date_created: 2019-03-01T11:29:44Z
date_updated: 2023-02-28T11:01:03Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.MFCS.2018.58
editor:
- first_name: Igor
full_name: Potapov, Igor
last_name: Potapov
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
- first_name: James
full_name: Worrell, James
last_name: Worrell
external_id:
arxiv:
- '1805.11139'
intvolume: ' 117'
keyword:
- Complexity Theory
- Quantum Computing
- Polynomial Hierarchy
- Semidefinite Programming
- QMA(2)
- Quantum Complexity
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640
oa: '1'
page: 58:1-58:16
place: Dagstuhl, Germany
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)
publication_identifier:
unknown:
- 978-3-95977-086-6
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)
type: conference
user_id: '71541'
volume: 117
year: '2018'
...
---
_id: '8160'
abstract:
- lang: eng
text: An important task in quantum physics is the estimation of local quantities
for ground states of local Hamiltonians. Recently, Ambainis defined the complexity
class P^QMA[log], and motivated its study by showing that the physical task of
estimating the expectation value of a local observable against the ground state
of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the
study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness
result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We
show that simulating even a single qubit measurement on ground states of 5-local
Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We
formalize the complexity theoretic study of estimating two-point correlation functions
against ground states, and show that this task is similarly P^QMA[log]-complete.
P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally
by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung
to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP
from Kitaev and Watrous. A central theme of this work is the subtlety involved
in the study of oracle classes in which the oracle solves a promise problem. In
this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness
proof for estimating spectral gaps of local Hamiltonians. By introducing a "query
validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness
for estimating spectral gaps under polynomial-time Turing reductions.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
ama: 'Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum
Systems. In: Wilde M, ed. 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017). Vol 73. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17.
doi:10.4230/LIPIcs.TQC.2017.2'
apa: Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements
on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum
Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17).
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2
bibtex: '@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating
Local Measurements on Quantum Systems}, volume={73}, DOI={10.4230/LIPIcs.TQC.2017.2},
booktitle={12th Conference on the Theory of Quantum Computation, Communication
and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark},
year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in
Informatics (LIPIcs)} }'
chicago: 'Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local
Measurements on Quantum Systems.” In 12th Conference on the Theory of Quantum
Computation, Communication and Cryptography (TQC 2017), edited by Mark Wilde,
73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.TQC.2017.2.'
ieee: 'S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements
on Quantum Systems,” in 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017), Paris, France, 2018, vol. 73, p.
2:1-2:17, doi: 10.4230/LIPIcs.TQC.2017.2.'
mla: Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements
on Quantum Systems.” 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017), edited by Mark Wilde, vol. 73,
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:10.4230/LIPIcs.TQC.2017.2.
short: 'S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory
of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl
- Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.'
conference:
location: Paris, France
name: 12th Conference on the Theory of Quantum Computation, Communication and Cryptography
(TQC 2017)
date_created: 2019-03-01T11:25:27Z
date_updated: 2023-02-28T11:00:48Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.TQC.2017.2
editor:
- first_name: Mark
full_name: Wilde, Mark
last_name: Wilde
external_id:
arxiv:
- '1606.05626'
intvolume: ' 73'
keyword:
- Complexity theory
- Quantum Merlin Arthur (QMA)
- local Hamiltonian
- local measurement
- spectral gap
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577
oa: '1'
page: 2:1-2:17
place: Dagstuhl, Germany
publication: 12th Conference on the Theory of Quantum Computation, Communication and
Cryptography (TQC 2017)
publication_identifier:
unknown:
- 978-3-95977-034-7
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Complexity of Simulating Local Measurements on Quantum Systems
type: conference
user_id: '71541'
volume: 73
year: '2018'
...
---
_id: '8167'
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Jamie
full_name: Sikora, Jamie
last_name: Sikora
citation:
ama: Gharibian S, Sikora J. Ground State Connectivity of Local Hamiltonians. ACM
Transactions on Computation Theory (TOCT). 2018;10(2):8:1-8:28. doi:10.1145/3186587
apa: Gharibian, S., & Sikora, J. (2018). Ground State Connectivity of Local
Hamiltonians. ACM Transactions on Computation Theory (TOCT), 10(2),
8:1-8:28. https://doi.org/10.1145/3186587
bibtex: '@article{Gharibian_Sikora_2018, title={Ground State Connectivity of Local
Hamiltonians}, volume={10}, DOI={10.1145/3186587},
number={2}, journal={ACM Transactions on Computation Theory (TOCT)}, publisher={ACM},
author={Gharibian, Sevag and Sikora, Jamie}, year={2018}, pages={8:1-8:28} }'
chicago: 'Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local
Hamiltonians.” ACM Transactions on Computation Theory (TOCT) 10, no. 2
(2018): 8:1-8:28. https://doi.org/10.1145/3186587.'
ieee: 'S. Gharibian and J. Sikora, “Ground State Connectivity of Local Hamiltonians,”
ACM Transactions on Computation Theory (TOCT), vol. 10, no. 2, p. 8:1-8:28,
2018, doi: 10.1145/3186587.'
mla: Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.”
ACM Transactions on Computation Theory (TOCT), vol. 10, no. 2, ACM, 2018,
p. 8:1-8:28, doi:10.1145/3186587.
short: S. Gharibian, J. Sikora, ACM Transactions on Computation Theory (TOCT) 10
(2018) 8:1-8:28.
date_created: 2019-03-01T11:49:31Z
date_updated: 2023-02-28T11:01:36Z
department:
- _id: '623'
- _id: '7'
doi: 10.1145/3186587
external_id:
arxiv:
- '1409.3182'
intvolume: ' 10'
issue: '2'
keyword:
- Local Hamiltonian
- ground state connectivity
- quantum Hamiltonian complexity
- reconfiguration problem
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.3182
oa: '1'
page: 8:1-8:28
publication: ACM Transactions on Computation Theory (TOCT)
publication_identifier:
issn:
- 1942-3454
publication_status: published
publisher: ACM
status: public
title: Ground State Connectivity of Local Hamiltonians
type: journal_article
user_id: '71541'
volume: 10
year: '2018'
...
---
_id: '34843'
abstract:
- lang: eng
text: "A polynomial time algorithm to find generators of the lattice of all subfields
of a given number field was given in van Hoeij et al. (2013).\r\n\r\nThis article
reports on a massive speedup of this algorithm. This is primary achieved by our
new concept of Galois-generating subfields. In general this is a very small set
of subfields that determine all other subfields in a group-theoretic way. We compute
them by targeted calls to the method from van Hoeij et al. (2013). For an early
termination of these calls, we give a list of criteria that imply that further
calls will not result in additional subfields.\r\n\r\nFinally, we explain how
we use subfields to get a good starting group for the computation of Galois groups."
author:
- first_name: Andreas-Stephan
full_name: Elsenhans, Andreas-Stephan
last_name: Elsenhans
- first_name: Jürgen
full_name: Klüners, Jürgen
id: '21202'
last_name: Klüners
citation:
ama: Elsenhans A-S, Klüners J. Computing subfields of number fields and applications
to Galois group computations. Journal of Symbolic Computation. 2018;93:1-20.
doi:10.1016/j.jsc.2018.04.013
apa: Elsenhans, A.-S., & Klüners, J. (2018). Computing subfields of number fields
and applications to Galois group computations. Journal of Symbolic Computation,
93, 1–20. https://doi.org/10.1016/j.jsc.2018.04.013
bibtex: '@article{Elsenhans_Klüners_2018, title={Computing subfields of number fields
and applications to Galois group computations}, volume={93}, DOI={10.1016/j.jsc.2018.04.013},
journal={Journal of Symbolic Computation}, publisher={Elsevier BV}, author={Elsenhans,
Andreas-Stephan and Klüners, Jürgen}, year={2018}, pages={1–20} }'
chicago: 'Elsenhans, Andreas-Stephan, and Jürgen Klüners. “Computing Subfields of
Number Fields and Applications to Galois Group Computations.” Journal of Symbolic
Computation 93 (2018): 1–20. https://doi.org/10.1016/j.jsc.2018.04.013.'
ieee: 'A.-S. Elsenhans and J. Klüners, “Computing subfields of number fields and
applications to Galois group computations,” Journal of Symbolic Computation,
vol. 93, pp. 1–20, 2018, doi: 10.1016/j.jsc.2018.04.013.'
mla: Elsenhans, Andreas-Stephan, and Jürgen Klüners. “Computing Subfields of Number
Fields and Applications to Galois Group Computations.” Journal of Symbolic
Computation, vol. 93, Elsevier BV, 2018, pp. 1–20, doi:10.1016/j.jsc.2018.04.013.
short: A.-S. Elsenhans, J. Klüners, Journal of Symbolic Computation 93 (2018) 1–20.
date_created: 2022-12-22T10:52:18Z
date_updated: 2023-03-06T09:05:51Z
department:
- _id: '102'
doi: 10.1016/j.jsc.2018.04.013
external_id:
arxiv:
- '1610.06837 '
intvolume: ' 93'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 1-20
publication: Journal of Symbolic Computation
publication_identifier:
issn:
- 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Computing subfields of number fields and applications to Galois group computations
type: journal_article
user_id: '93826'
volume: 93
year: '2018'
...
---
_id: '39898'
alternative_title:
- Grundlagen mikroelektronischer Integrationstechnik
author:
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
id: '20179'
last_name: Hilleringmann
citation:
ama: Hilleringmann U. Silizium-Halbleitertechnologie. Springer Fachmedien
Wiesbaden; 2018. doi:10.1007/978-3-658-23444-7
apa: Hilleringmann, U. (2018). Silizium-Halbleitertechnologie. Springer Fachmedien
Wiesbaden. https://doi.org/10.1007/978-3-658-23444-7
bibtex: '@book{Hilleringmann_2018, place={Wiesbaden}, title={Silizium-Halbleitertechnologie},
DOI={10.1007/978-3-658-23444-7},
publisher={Springer Fachmedien Wiesbaden}, author={Hilleringmann, Ulrich}, year={2018}
}'
chicago: 'Hilleringmann, Ulrich. Silizium-Halbleitertechnologie. Wiesbaden:
Springer Fachmedien Wiesbaden, 2018. https://doi.org/10.1007/978-3-658-23444-7.'
ieee: 'U. Hilleringmann, Silizium-Halbleitertechnologie. Wiesbaden: Springer
Fachmedien Wiesbaden, 2018.'
mla: Hilleringmann, Ulrich. Silizium-Halbleitertechnologie. Springer Fachmedien
Wiesbaden, 2018, doi:10.1007/978-3-658-23444-7.
short: U. Hilleringmann, Silizium-Halbleitertechnologie, Springer Fachmedien Wiesbaden,
Wiesbaden, 2018.
date_created: 2023-01-25T09:19:59Z
date_updated: 2023-03-21T09:54:10Z
department:
- _id: '59'
doi: 10.1007/978-3-658-23444-7
language:
- iso: eng
place: Wiesbaden
publication_identifier:
isbn:
- '9783658234430'
- '9783658234447'
publication_status: published
publisher: Springer Fachmedien Wiesbaden
status: public
title: Silizium-Halbleitertechnologie
type: book
user_id: '20179'
year: '2018'
...
---
_id: '39428'
author:
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
id: '20179'
last_name: Hilleringmann
citation:
ama: 'Hilleringmann U. Ätztechnik. In: Silizium-Halbleitertechnologie. Springer
Fachmedien Wiesbaden; 2018. doi:10.1007/978-3-658-23444-7_5'
apa: Hilleringmann, U. (2018). Ätztechnik. In Silizium-Halbleitertechnologie.
Springer Fachmedien Wiesbaden. https://doi.org/10.1007/978-3-658-23444-7_5
bibtex: '@inbook{Hilleringmann_2018, place={Wiesbaden}, title={Ätztechnik}, DOI={10.1007/978-3-658-23444-7_5},
booktitle={Silizium-Halbleitertechnologie}, publisher={Springer Fachmedien Wiesbaden},
author={Hilleringmann, Ulrich}, year={2018} }'
chicago: 'Hilleringmann, Ulrich. “Ätztechnik.” In Silizium-Halbleitertechnologie.
Wiesbaden: Springer Fachmedien Wiesbaden, 2018. https://doi.org/10.1007/978-3-658-23444-7_5.'
ieee: 'U. Hilleringmann, “Ätztechnik,” in Silizium-Halbleitertechnologie,
Wiesbaden: Springer Fachmedien Wiesbaden, 2018.'
mla: Hilleringmann, Ulrich. “Ätztechnik.” Silizium-Halbleitertechnologie,
Springer Fachmedien Wiesbaden, 2018, doi:10.1007/978-3-658-23444-7_5.
short: 'U. Hilleringmann, in: Silizium-Halbleitertechnologie, Springer Fachmedien
Wiesbaden, Wiesbaden, 2018.'
date_created: 2023-01-24T10:42:26Z
date_updated: 2023-03-21T10:10:52Z
department:
- _id: '59'
doi: 10.1007/978-3-658-23444-7_5
language:
- iso: eng
place: Wiesbaden
publication: Silizium-Halbleitertechnologie
publication_identifier:
isbn:
- '9783658234430'
- '9783658234447'
publication_status: published
publisher: Springer Fachmedien Wiesbaden
status: public
title: Ätztechnik
type: book_chapter
user_id: '20179'
year: '2018'
...
---
_id: '39436'
author:
- first_name: Thales E.
full_name: Becker, Thales E.
last_name: Becker
- first_name: Fabio F.
full_name: Vidor, Fabio F.
last_name: Vidor
- first_name: Gilson I.
full_name: Wirth, Gilson I.
last_name: Wirth
- first_name: Thorsten
full_name: Meyers, Thorsten
last_name: Meyers
- first_name: Julia
full_name: Reker, Julia
last_name: Reker
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
id: '20179'
last_name: Hilleringmann
citation:
ama: 'Becker TE, Vidor FF, Wirth GI, Meyers T, Reker J, Hilleringmann U. Time domain
electrical characterization in zinc oxide nanoparticle thin-film transistors.
In: 2018 IEEE 19th Latin-American Test Symposium (LATS). IEEE; 2018. doi:10.1109/latw.2018.8349695'
apa: Becker, T. E., Vidor, F. F., Wirth, G. I., Meyers, T., Reker, J., & Hilleringmann,
U. (2018). Time domain electrical characterization in zinc oxide nanoparticle
thin-film transistors. 2018 IEEE 19th Latin-American Test Symposium (LATS).
https://doi.org/10.1109/latw.2018.8349695
bibtex: '@inproceedings{Becker_Vidor_Wirth_Meyers_Reker_Hilleringmann_2018, title={Time
domain electrical characterization in zinc oxide nanoparticle thin-film transistors},
DOI={10.1109/latw.2018.8349695},
booktitle={2018 IEEE 19th Latin-American Test Symposium (LATS)}, publisher={IEEE},
author={Becker, Thales E. and Vidor, Fabio F. and Wirth, Gilson I. and Meyers,
Thorsten and Reker, Julia and Hilleringmann, Ulrich}, year={2018} }'
chicago: Becker, Thales E., Fabio F. Vidor, Gilson I. Wirth, Thorsten Meyers, Julia
Reker, and Ulrich Hilleringmann. “Time Domain Electrical Characterization in Zinc
Oxide Nanoparticle Thin-Film Transistors.” In 2018 IEEE 19th Latin-American
Test Symposium (LATS). IEEE, 2018. https://doi.org/10.1109/latw.2018.8349695.
ieee: 'T. E. Becker, F. F. Vidor, G. I. Wirth, T. Meyers, J. Reker, and U. Hilleringmann,
“Time domain electrical characterization in zinc oxide nanoparticle thin-film
transistors,” 2018, doi: 10.1109/latw.2018.8349695.'
mla: Becker, Thales E., et al. “Time Domain Electrical Characterization in Zinc
Oxide Nanoparticle Thin-Film Transistors.” 2018 IEEE 19th Latin-American Test
Symposium (LATS), IEEE, 2018, doi:10.1109/latw.2018.8349695.
short: 'T.E. Becker, F.F. Vidor, G.I. Wirth, T. Meyers, J. Reker, U. Hilleringmann,
in: 2018 IEEE 19th Latin-American Test Symposium (LATS), IEEE, 2018.'
date_created: 2023-01-24T10:50:35Z
date_updated: 2023-03-21T10:15:23Z
department:
- _id: '59'
doi: 10.1109/latw.2018.8349695
language:
- iso: eng
publication: 2018 IEEE 19th Latin-American Test Symposium (LATS)
publication_status: published
publisher: IEEE
status: public
title: Time domain electrical characterization in zinc oxide nanoparticle thin-film
transistors
type: conference
user_id: '20179'
year: '2018'
...
---
_id: '39437'
author:
- first_name: Thales E.
full_name: Becker, Thales E.
last_name: Becker
- first_name: Fabio F.
full_name: Vidor, Fabio F.
last_name: Vidor
- first_name: Gilson I.
full_name: Wirth, Gilson I.
last_name: Wirth
- first_name: Thorsten
full_name: Meyers, Thorsten
last_name: Meyers
- first_name: Julia
full_name: Reker, Julia
last_name: Reker
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
id: '20179'
last_name: Hilleringmann
citation:
ama: 'Becker TE, Vidor FF, Wirth GI, Meyers T, Reker J, Hilleringmann U. Time domain
electrical characterization in zinc oxide nanoparticle thin-film transistors.
In: 2018 IEEE 19th Latin-American Test Symposium (LATS). IEEE; 2018. doi:10.1109/latw.2018.8349695'
apa: Becker, T. E., Vidor, F. F., Wirth, G. I., Meyers, T., Reker, J., & Hilleringmann,
U. (2018). Time domain electrical characterization in zinc oxide nanoparticle
thin-film transistors. 2018 IEEE 19th Latin-American Test Symposium (LATS).
https://doi.org/10.1109/latw.2018.8349695
bibtex: '@inproceedings{Becker_Vidor_Wirth_Meyers_Reker_Hilleringmann_2018, title={Time
domain electrical characterization in zinc oxide nanoparticle thin-film transistors},
DOI={10.1109/latw.2018.8349695},
booktitle={2018 IEEE 19th Latin-American Test Symposium (LATS)}, publisher={IEEE},
author={Becker, Thales E. and Vidor, Fabio F. and Wirth, Gilson I. and Meyers,
Thorsten and Reker, Julia and Hilleringmann, Ulrich}, year={2018} }'
chicago: Becker, Thales E., Fabio F. Vidor, Gilson I. Wirth, Thorsten Meyers, Julia
Reker, and Ulrich Hilleringmann. “Time Domain Electrical Characterization in Zinc
Oxide Nanoparticle Thin-Film Transistors.” In 2018 IEEE 19th Latin-American
Test Symposium (LATS). IEEE, 2018. https://doi.org/10.1109/latw.2018.8349695.
ieee: 'T. E. Becker, F. F. Vidor, G. I. Wirth, T. Meyers, J. Reker, and U. Hilleringmann,
“Time domain electrical characterization in zinc oxide nanoparticle thin-film
transistors,” 2018, doi: 10.1109/latw.2018.8349695.'
mla: Becker, Thales E., et al. “Time Domain Electrical Characterization in Zinc
Oxide Nanoparticle Thin-Film Transistors.” 2018 IEEE 19th Latin-American Test
Symposium (LATS), IEEE, 2018, doi:10.1109/latw.2018.8349695.
short: 'T.E. Becker, F.F. Vidor, G.I. Wirth, T. Meyers, J. Reker, U. Hilleringmann,
in: 2018 IEEE 19th Latin-American Test Symposium (LATS), IEEE, 2018.'
date_created: 2023-01-24T10:51:28Z
date_updated: 2023-03-22T10:16:54Z
department:
- _id: '59'
doi: 10.1109/latw.2018.8349695
language:
- iso: eng
publication: 2018 IEEE 19th Latin-American Test Symposium (LATS)
publication_status: published
publisher: IEEE
status: public
title: Time domain electrical characterization in zinc oxide nanoparticle thin-film
transistors
type: conference
user_id: '20179'
year: '2018'
...
---
_id: '39429'
author:
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
id: '20179'
last_name: Hilleringmann
citation:
ama: 'Hilleringmann U. Oxidation des Siliziums. In: Silizium-Halbleitertechnologie.
Springer Fachmedien Wiesbaden; 2018. doi:10.1007/978-3-658-23444-7_3'
apa: Hilleringmann, U. (2018). Oxidation des Siliziums. In Silizium-Halbleitertechnologie.
Springer Fachmedien Wiesbaden. https://doi.org/10.1007/978-3-658-23444-7_3
bibtex: '@inbook{Hilleringmann_2018, place={Wiesbaden}, title={Oxidation des Siliziums},
DOI={10.1007/978-3-658-23444-7_3},
booktitle={Silizium-Halbleitertechnologie}, publisher={Springer Fachmedien Wiesbaden},
author={Hilleringmann, Ulrich}, year={2018} }'
chicago: 'Hilleringmann, Ulrich. “Oxidation Des Siliziums.” In Silizium-Halbleitertechnologie.
Wiesbaden: Springer Fachmedien Wiesbaden, 2018. https://doi.org/10.1007/978-3-658-23444-7_3.'
ieee: 'U. Hilleringmann, “Oxidation des Siliziums,” in Silizium-Halbleitertechnologie,
Wiesbaden: Springer Fachmedien Wiesbaden, 2018.'
mla: Hilleringmann, Ulrich. “Oxidation Des Siliziums.” Silizium-Halbleitertechnologie,
Springer Fachmedien Wiesbaden, 2018, doi:10.1007/978-3-658-23444-7_3.
short: 'U. Hilleringmann, in: Silizium-Halbleitertechnologie, Springer Fachmedien
Wiesbaden, Wiesbaden, 2018.'
date_created: 2023-01-24T10:43:06Z
date_updated: 2023-03-22T10:29:51Z
department:
- _id: '59'
doi: 10.1007/978-3-658-23444-7_3
language:
- iso: eng
place: Wiesbaden
publication: Silizium-Halbleitertechnologie
publication_identifier:
isbn:
- '9783658234430'
- '9783658234447'
publication_status: published
publisher: Springer Fachmedien Wiesbaden
status: public
title: Oxidation des Siliziums
type: book_chapter
user_id: '20179'
year: '2018'
...
---
_id: '42788'
abstract:
- lang: eng
text: We classify all one-class genera of admissible lattice chains of length at
least 2 in hermitian spaces over number fields. If L is a lattice in the chain
and p the prime ideal dividing the index of the lattices in the chain, then the
{p}-arithmetic group Aut(L{p}) acts chamber transitively on the corresponding
Bruhat-Tits building. So our classification provides a step forward to a complete
classification of these chamber transitive groups which has been announced 1987
(without a detailed proof) by Kantor, Liebler and Tits. In fact we find all their
groups over number fields and one additional building with a discrete chamber
transitive group.
author:
- first_name: Markus
full_name: Kirschmer, Markus
id: '82258'
last_name: Kirschmer
- first_name: Gabriele
full_name: Nebe, Gabriele
last_name: Nebe
citation:
ama: 'Kirschmer M, Nebe G. One Class Genera of Lattice Chains Over Number Fields.
In: Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory.
Springer International Publishing; 2018. doi:10.1007/978-3-319-70566-8_22'
apa: Kirschmer, M., & Nebe, G. (2018). One Class Genera of Lattice Chains Over
Number Fields. In Algorithmic and Experimental Methods in Algebra, Geometry,
and Number Theory. Springer International Publishing. https://doi.org/10.1007/978-3-319-70566-8_22
bibtex: '@inbook{Kirschmer_Nebe_2018, place={Cham}, title={One Class Genera of Lattice
Chains Over Number Fields}, DOI={10.1007/978-3-319-70566-8_22},
booktitle={Algorithmic and Experimental Methods in Algebra, Geometry, and Number
Theory}, publisher={Springer International Publishing}, author={Kirschmer, Markus
and Nebe, Gabriele}, year={2018} }'
chicago: 'Kirschmer, Markus, and Gabriele Nebe. “One Class Genera of Lattice Chains
Over Number Fields.” In Algorithmic and Experimental Methods in Algebra, Geometry,
and Number Theory. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-70566-8_22.'
ieee: 'M. Kirschmer and G. Nebe, “One Class Genera of Lattice Chains Over Number
Fields,” in Algorithmic and Experimental Methods in Algebra, Geometry, and
Number Theory, Cham: Springer International Publishing, 2018.'
mla: Kirschmer, Markus, and Gabriele Nebe. “One Class Genera of Lattice Chains Over
Number Fields.” Algorithmic and Experimental Methods in Algebra, Geometry,
and Number Theory, Springer International Publishing, 2018, doi:10.1007/978-3-319-70566-8_22.
short: 'M. Kirschmer, G. Nebe, in: Algorithmic and Experimental Methods in Algebra,
Geometry, and Number Theory, Springer International Publishing, Cham, 2018.'
date_created: 2023-03-07T08:23:48Z
date_updated: 2023-04-04T09:08:19Z
department:
- _id: '102'
doi: 10.1007/978-3-319-70566-8_22
extern: '1'
language:
- iso: eng
place: Cham
publication: Algorithmic and Experimental Methods in Algebra, Geometry, and Number
Theory
publication_identifier:
isbn:
- '9783319705651'
- '9783319705668'
publication_status: published
publisher: Springer International Publishing
status: public
title: One Class Genera of Lattice Chains Over Number Fields
type: book_chapter
user_id: '93826'
year: '2018'
...
---
_id: '42790'
abstract:
- lang: eng
text: We show that exceptional algebraic groups over number fields do not admit
one-class genera of parahoric groups, except in the case G₂ . For the group G₂,
we enumerate all such one-class genera for the usual seven-dimensional representation.
author:
- first_name: Markus
full_name: Kirschmer, Markus
id: '82258'
last_name: Kirschmer
citation:
ama: Kirschmer M. One-class genera of exceptional groups over number fields. Journal
de Théorie des Nombres de Bordeaux. 2018;30(3):847-857. doi:10.5802/jtnb.1052
apa: Kirschmer, M. (2018). One-class genera of exceptional groups over number fields.
Journal de Théorie Des Nombres de Bordeaux, 30(3), 847–857. https://doi.org/10.5802/jtnb.1052
bibtex: '@article{Kirschmer_2018, title={One-class genera of exceptional groups
over number fields}, volume={30}, DOI={10.5802/jtnb.1052},
number={3}, journal={Journal de Théorie des Nombres de Bordeaux}, publisher={Cellule
MathDoc/CEDRAM}, author={Kirschmer, Markus}, year={2018}, pages={847–857} }'
chicago: 'Kirschmer, Markus. “One-Class Genera of Exceptional Groups over Number
Fields.” Journal de Théorie Des Nombres de Bordeaux 30, no. 3 (2018): 847–57.
https://doi.org/10.5802/jtnb.1052.'
ieee: 'M. Kirschmer, “One-class genera of exceptional groups over number fields,”
Journal de Théorie des Nombres de Bordeaux, vol. 30, no. 3, pp. 847–857,
2018, doi: 10.5802/jtnb.1052.'
mla: Kirschmer, Markus. “One-Class Genera of Exceptional Groups over Number Fields.”
Journal de Théorie Des Nombres de Bordeaux, vol. 30, no. 3, Cellule MathDoc/CEDRAM,
2018, pp. 847–57, doi:10.5802/jtnb.1052.
short: M. Kirschmer, Journal de Théorie Des Nombres de Bordeaux 30 (2018) 847–857.
date_created: 2023-03-07T08:27:36Z
date_updated: 2023-04-04T09:07:32Z
department:
- _id: '102'
doi: 10.5802/jtnb.1052
extern: '1'
intvolume: ' 30'
issue: '3'
keyword:
- Algebra and Number Theory
language:
- iso: eng
page: 847-857
publication: Journal de Théorie des Nombres de Bordeaux
publication_identifier:
issn:
- 1246-7405
- 2118-8572
publication_status: published
publisher: Cellule MathDoc/CEDRAM
status: public
title: One-class genera of exceptional groups over number fields
type: journal_article
user_id: '93826'
volume: 30
year: '2018'
...