[{"intvolume":"        17","date_updated":"2023-01-30T12:03:02Z","author":[{"full_name":"Pries, Aaron","first_name":"Aaron","last_name":"Pries"},{"last_name":"Ramírez","first_name":"David","full_name":"Ramírez, David"},{"last_name":"Schreier","first_name":"Peter J.","full_name":"Schreier, Peter J."}],"year":"2018","status":"public","title":"LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure","volume":17,"user_id":"43497","_id":"40701","page":"6321–6334","citation":{"bibtex":"@article{Pries_Ramírez_Schreier_2018, title={LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure}, volume={17}, number={9}, journal={IEEE Trans. Wirel. Commun.}, author={Pries, Aaron and Ramírez, David and Schreier, Peter J.}, year={2018}, pages={6321–6334} }","ama":"Pries A, Ramírez D, Schreier PJ. LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure. <i>IEEE Trans Wirel Commun</i>. 2018;17(9):6321–6334.","mla":"Pries, Aaron, et al. “LMPIT-Inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure.” <i>IEEE Trans. Wirel. Commun.</i>, vol. 17, no. 9, 2018, pp. 6321–6334.","short":"A. Pries, D. Ramírez, P.J. Schreier, IEEE Trans. Wirel. Commun. 17 (2018) 6321–6334.","chicago":"Pries, Aaron, David Ramírez, and Peter J. Schreier. “LMPIT-Inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure.” <i>IEEE Trans. Wirel. Commun.</i> 17, no. 9 (2018): 6321–6334.","ieee":"A. Pries, D. Ramírez, and P. J. Schreier, “LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure,” <i>IEEE Trans. Wirel. Commun.</i>, vol. 17, no. 9, pp. 6321–6334, 2018.","apa":"Pries, A., Ramírez, D., &#38; Schreier, P. J. (2018). LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure. <i>IEEE Trans. Wirel. Commun.</i>, <i>17</i>(9), 6321–6334."},"publication":"IEEE Trans. Wirel. Commun.","issue":"9","department":[{"_id":"263"}],"type":"journal_article","date_created":"2023-01-30T11:51:39Z"},{"department":[{"_id":"263"}],"type":"journal_article","date_created":"2023-01-30T11:51:39Z","citation":{"bibtex":"@article{Rezaee_Schreier_2018, title={A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT}, volume={17}, number={8}, journal={IEEE Trans. Wireless Comm.}, author={Rezaee, Mohsen and Schreier, Peter J.}, year={2018}, pages={5397–5408} }","short":"M. Rezaee, P.J. Schreier, IEEE Trans. Wireless Comm. 17 (2018) 5397–5408.","ama":"Rezaee M, Schreier PJ. A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT. <i>IEEE Trans Wireless Comm</i>. 2018;17(8):5397–5408.","chicago":"Rezaee, Mohsen, and Peter J. Schreier. “A Degrees-of-Freedom-Achieving Scheme for the Temporally Correlated MIMO Interference Channel with Delayed CSIT.” <i>IEEE Trans. Wireless Comm.</i> 17, no. 8 (2018): 5397–5408.","ieee":"M. Rezaee and P. J. Schreier, “A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT,” <i>IEEE Trans. Wireless Comm.</i>, vol. 17, no. 8, pp. 5397–5408, 2018.","apa":"Rezaee, M., &#38; Schreier, P. J. (2018). A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT. <i>IEEE Trans. Wireless Comm.</i>, <i>17</i>(8), 5397–5408.","mla":"Rezaee, Mohsen, and Peter J. Schreier. “A Degrees-of-Freedom-Achieving Scheme for the Temporally Correlated MIMO Interference Channel with Delayed CSIT.” <i>IEEE Trans. Wireless Comm.</i>, vol. 17, no. 8, 2018, pp. 5397–5408."},"issue":"8","publication":"IEEE Trans. Wireless Comm.","volume":17,"user_id":"43497","_id":"40703","page":"5397–5408","intvolume":"        17","date_updated":"2023-01-30T12:03:00Z","author":[{"full_name":"Rezaee, Mohsen","last_name":"Rezaee","first_name":"Mohsen"},{"first_name":"Peter J.","last_name":"Schreier","full_name":"Schreier, Peter J."}],"status":"public","title":"A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT","year":"2018"},{"publication":"Proc. European Signal Process. Conf. (EUSIPCO)","citation":{"short":"T. Marrinan, T. Hasija, C. Lameiro, P.J. Schreier, in: Proc. European Signal Process. Conf. (EUSIPCO), 2018, pp. 1082–1086.","chicago":"Marrinan, T., Tanuj Hasija, C. Lameiro, and P. J. Schreier. “Complete Model Selection in Multiset Canonical Correlation Analysis.” In <i>Proc. European Signal Process. Conf. (EUSIPCO)</i>, 1082–1086, 2018.","ieee":"T. Marrinan, T. Hasija, C. Lameiro, and P. J. Schreier, “Complete Model Selection in Multiset Canonical Correlation Analysis,” in <i>Proc. European Signal Process. Conf. (EUSIPCO)</i>, 2018, pp. 1082–1086.","apa":"Marrinan, T., Hasija, T., Lameiro, C., &#38; Schreier, P. J. (2018). Complete Model Selection in Multiset Canonical Correlation Analysis. <i>Proc. European Signal Process. Conf. (EUSIPCO)</i>, 1082–1086.","bibtex":"@inproceedings{Marrinan_Hasija_Lameiro_Schreier_2018, title={Complete Model Selection in Multiset Canonical Correlation Analysis}, booktitle={Proc. European Signal Process. Conf. (EUSIPCO)}, author={Marrinan, T. and Hasija, Tanuj and Lameiro, C. and Schreier, P. J.}, year={2018}, pages={1082–1086} }","ama":"Marrinan T, Hasija T, Lameiro C, Schreier PJ. Complete Model Selection in Multiset Canonical Correlation Analysis. In: <i>Proc. European Signal Process. Conf. (EUSIPCO)</i>. ; 2018:1082–1086.","mla":"Marrinan, T., et al. “Complete Model Selection in Multiset Canonical Correlation Analysis.” <i>Proc. European Signal Process. Conf. (EUSIPCO)</i>, 2018, pp. 1082–1086."},"type":"conference","department":[{"_id":"263"}],"date_created":"2023-01-30T11:51:39Z","date_updated":"2023-01-30T12:07:14Z","status":"public","title":"Complete Model Selection in Multiset Canonical Correlation Analysis","year":"2018","author":[{"full_name":"Marrinan, T.","first_name":"T.","last_name":"Marrinan"},{"id":"43497","first_name":"Tanuj","last_name":"Hasija","full_name":"Hasija, Tanuj"},{"first_name":"C.","last_name":"Lameiro","full_name":"Lameiro, C."},{"first_name":"P. J.","last_name":"Schreier","full_name":"Schreier, P. J."}],"user_id":"43497","page":"1082–1086","_id":"40702","language":[{"iso":"eng"}]},{"publication_status":"published","date_updated":"2023-01-26T17:19:39Z","intvolume":"       291","year":"2018","title":"Space‐time fractional Dirichlet problems","author":[{"last_name":"Baeumer","first_name":"Boris","full_name":"Baeumer, Boris"},{"full_name":"Luks, Tomasz","last_name":"Luks","first_name":"Tomasz","id":"58312"},{"last_name":"Meerschaert","first_name":"Mark M.","full_name":"Meerschaert, Mark M."}],"publication_identifier":{"issn":["0025-584X","1522-2616"]},"doi":"10.1002/mana.201700111","language":[{"iso":"eng"}],"issue":"17-18","publication":"Mathematische Nachrichten","type":"journal_article","keyword":["General Mathematics"],"department":[{"_id":"555"}],"date_created":"2023-01-25T15:11:01Z","status":"public","user_id":"58312","volume":291,"page":"2516-2535","_id":"40050","publisher":"Wiley","citation":{"ieee":"B. Baeumer, T. Luks, and M. M. Meerschaert, “Space‐time fractional Dirichlet problems,” <i>Mathematische Nachrichten</i>, vol. 291, no. 17–18, pp. 2516–2535, 2018, doi: <a href=\"https://doi.org/10.1002/mana.201700111\">10.1002/mana.201700111</a>.","apa":"Baeumer, B., Luks, T., &#38; Meerschaert, M. M. (2018). Space‐time fractional Dirichlet problems. <i>Mathematische Nachrichten</i>, <i>291</i>(17–18), 2516–2535. <a href=\"https://doi.org/10.1002/mana.201700111\">https://doi.org/10.1002/mana.201700111</a>","mla":"Baeumer, Boris, et al. “Space‐time Fractional Dirichlet Problems.” <i>Mathematische Nachrichten</i>, vol. 291, no. 17–18, Wiley, 2018, pp. 2516–35, doi:<a href=\"https://doi.org/10.1002/mana.201700111\">10.1002/mana.201700111</a>.","bibtex":"@article{Baeumer_Luks_Meerschaert_2018, title={Space‐time fractional Dirichlet problems}, volume={291}, DOI={<a href=\"https://doi.org/10.1002/mana.201700111\">10.1002/mana.201700111</a>}, number={17–18}, journal={Mathematische Nachrichten}, publisher={Wiley}, author={Baeumer, Boris and Luks, Tomasz and Meerschaert, Mark M.}, year={2018}, pages={2516–2535} }","short":"B. Baeumer, T. Luks, M.M. Meerschaert, Mathematische Nachrichten 291 (2018) 2516–2535.","ama":"Baeumer B, Luks T, Meerschaert MM. Space‐time fractional Dirichlet problems. <i>Mathematische Nachrichten</i>. 2018;291(17-18):2516-2535. doi:<a href=\"https://doi.org/10.1002/mana.201700111\">10.1002/mana.201700111</a>","chicago":"Baeumer, Boris, Tomasz Luks, and Mark M. Meerschaert. “Space‐time Fractional Dirichlet Problems.” <i>Mathematische Nachrichten</i> 291, no. 17–18 (2018): 2516–35. <a href=\"https://doi.org/10.1002/mana.201700111\">https://doi.org/10.1002/mana.201700111</a>."}},{"publication":"Proc. IEEE Statistical Signal Processing Workshop (SSP)","citation":{"mla":"Soleymani, Mohammad, et al. “Improper Signaling for OFDM Underlay Cognitive Radio Systems.” <i>Proc. IEEE Statistical Signal Processing Workshop (SSP)</i>, 2018, pp. 722–726, doi:<a href=\"https://doi.org/10.1109/SSP.2018.8450843\">10.1109/SSP.2018.8450843</a>.","ama":"Soleymani M, Lameiro C, Schreier PJ, Santamaría I. Improper Signaling for OFDM Underlay Cognitive Radio Systems. In: <i>Proc. IEEE Statistical Signal Processing Workshop (SSP)</i>. ; 2018:722–726. doi:<a href=\"https://doi.org/10.1109/SSP.2018.8450843\">10.1109/SSP.2018.8450843</a>","bibtex":"@inproceedings{Soleymani_Lameiro_Schreier_Santamaría_2018, place={Freiburg, Germany}, title={Improper Signaling for OFDM Underlay Cognitive Radio Systems}, DOI={<a href=\"https://doi.org/10.1109/SSP.2018.8450843\">10.1109/SSP.2018.8450843</a>}, booktitle={Proc. IEEE Statistical Signal Processing Workshop (SSP)}, author={Soleymani, Mohammad and Lameiro, Christian and Schreier, Peter J. and Santamaría, Ignacio}, year={2018}, pages={722–726} }","apa":"Soleymani, M., Lameiro, C., Schreier, P. J., &#38; Santamaría, I. (2018). Improper Signaling for OFDM Underlay Cognitive Radio Systems. <i>Proc. IEEE Statistical Signal Processing Workshop (SSP)</i>, 722–726. <a href=\"https://doi.org/10.1109/SSP.2018.8450843\">https://doi.org/10.1109/SSP.2018.8450843</a>","ieee":"M. Soleymani, C. Lameiro, P. J. Schreier, and I. Santamaría, “Improper Signaling for OFDM Underlay Cognitive Radio Systems,” in <i>Proc. IEEE Statistical Signal Processing Workshop (SSP)</i>, 2018, pp. 722–726, doi: <a href=\"https://doi.org/10.1109/SSP.2018.8450843\">10.1109/SSP.2018.8450843</a>.","short":"M. Soleymani, C. Lameiro, P.J. Schreier, I. Santamaría, in: Proc. IEEE Statistical Signal Processing Workshop (SSP), Freiburg, Germany, 2018, pp. 722–726.","chicago":"Soleymani, Mohammad, Christian Lameiro, Peter J. Schreier, and Ignacio Santamaría. “Improper Signaling for OFDM Underlay Cognitive Radio Systems.” In <i>Proc. IEEE Statistical Signal Processing Workshop (SSP)</i>, 722–726. Freiburg, Germany, 2018. <a href=\"https://doi.org/10.1109/SSP.2018.8450843\">https://doi.org/10.1109/SSP.2018.8450843</a>."},"place":"Freiburg, Germany","date_created":"2023-01-30T11:51:40Z","type":"conference","department":[{"_id":"263"}],"year":"2018","title":"Improper Signaling for OFDM Underlay Cognitive Radio Systems","status":"public","author":[{"full_name":"Soleymani, Mohammad","first_name":"Mohammad","last_name":"Soleymani"},{"last_name":"Lameiro","first_name":"Christian","full_name":"Lameiro, Christian"},{"last_name":"Schreier","first_name":"Peter J.","full_name":"Schreier, Peter J."},{"full_name":"Santamaría, Ignacio","first_name":"Ignacio","last_name":"Santamaría"}],"date_updated":"2023-01-30T12:01:49Z","page":"722–726","_id":"40705","doi":"10.1109/SSP.2018.8450843","user_id":"43497"},{"year":"2018","title":"Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection","status":"public","author":[{"full_name":"Tong, J.","first_name":"J.","last_name":"Tong"},{"last_name":"Guo","first_name":"Q.","full_name":"Guo, Q."},{"first_name":"J.","last_name":"Xi","full_name":"Xi, J."},{"last_name":"Yu","first_name":"Y.","full_name":"Yu, Y."},{"first_name":"P. J.","last_name":"Schreier","full_name":"Schreier, P. J."}],"date_updated":"2023-01-30T12:01:47Z","_id":"40704","user_id":"43497","publication":"Proc. IEEE Workshop on Statistical Signal Processing","citation":{"short":"J. Tong, Q. Guo, J. Xi, Y. Yu, P.J. Schreier, in: Proc. IEEE Workshop on Statistical Signal Processing, Freiburg, Germany, 2018.","ama":"Tong J, Guo Q, Xi J, Yu Y, Schreier PJ. Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection. In: <i>Proc. IEEE Workshop on Statistical Signal Processing</i>. ; 2018.","chicago":"Tong, J., Q. Guo, J. Xi, Y. Yu, and P. J. Schreier. “Regularized Lattice Reduction-Aided Ordered Successive Interference Cancellation for MIMO Detection.” In <i>Proc. IEEE Workshop on Statistical Signal Processing</i>. Freiburg, Germany, 2018.","bibtex":"@inproceedings{Tong_Guo_Xi_Yu_Schreier_2018, place={Freiburg, Germany}, title={Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection}, booktitle={Proc. IEEE Workshop on Statistical Signal Processing}, author={Tong, J. and Guo, Q. and Xi, J. and Yu, Y. and Schreier, P. J.}, year={2018} }","mla":"Tong, J., et al. “Regularized Lattice Reduction-Aided Ordered Successive Interference Cancellation for MIMO Detection.” <i>Proc. IEEE Workshop on Statistical Signal Processing</i>, 2018.","apa":"Tong, J., Guo, Q., Xi, J., Yu, Y., &#38; Schreier, P. J. (2018). Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection. <i>Proc. IEEE Workshop on Statistical Signal Processing</i>.","ieee":"J. Tong, Q. Guo, J. Xi, Y. Yu, and P. J. Schreier, “Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection,” 2018."},"date_created":"2023-01-30T11:51:40Z","place":"Freiburg, Germany","type":"conference","department":[{"_id":"263"}]},{"issue":"3","publication":"IEEE Transactions on Communications","citation":{"mla":"Lameiro, Christian, et al. “Improper Gaussian Signaling for Multiple-Access Channels in Underlay Cognitive Radio.” <i>IEEE Transactions on Communications</i>, vol. 67, no. 3, IEEE, 2018, pp. 1817–1830.","bibtex":"@article{Lameiro_Santamaría_Schreier_2018, title={Improper Gaussian signaling for multiple-access channels in underlay cognitive radio}, volume={67}, number={3}, journal={IEEE Transactions on Communications}, publisher={IEEE}, author={Lameiro, Christian and Santamaría, Ignacio and Schreier, Peter J.}, year={2018}, pages={1817–1830} }","ama":"Lameiro C, Santamaría I, Schreier PJ. Improper Gaussian signaling for multiple-access channels in underlay cognitive radio. <i>IEEE Transactions on Communications</i>. 2018;67(3):1817–1830.","ieee":"C. Lameiro, I. Santamaría, and P. J. Schreier, “Improper Gaussian signaling for multiple-access channels in underlay cognitive radio,” <i>IEEE Transactions on Communications</i>, vol. 67, no. 3, pp. 1817–1830, 2018.","apa":"Lameiro, C., Santamaría, I., &#38; Schreier, P. J. (2018). Improper Gaussian signaling for multiple-access channels in underlay cognitive radio. <i>IEEE Transactions on Communications</i>, <i>67</i>(3), 1817–1830.","short":"C. Lameiro, I. Santamaría, P.J. Schreier, IEEE Transactions on Communications 67 (2018) 1817–1830.","chicago":"Lameiro, Christian, Ignacio Santamaría, and Peter J. Schreier. “Improper Gaussian Signaling for Multiple-Access Channels in Underlay Cognitive Radio.” <i>IEEE Transactions on Communications</i> 67, no. 3 (2018): 1817–1830."},"type":"journal_article","department":[{"_id":"263"}],"date_created":"2023-01-30T11:51:38Z","date_updated":"2023-01-30T12:02:44Z","intvolume":"        67","status":"public","year":"2018","title":"Improper Gaussian signaling for multiple-access channels in underlay cognitive radio","author":[{"full_name":"Lameiro, Christian","first_name":"Christian","last_name":"Lameiro"},{"first_name":"Ignacio","last_name":"Santamaría","full_name":"Santamaría, Ignacio"},{"full_name":"Schreier, Peter J.","last_name":"Schreier","first_name":"Peter J."}],"user_id":"43497","volume":67,"page":"1817–1830","publisher":"IEEE","_id":"40695"},{"citation":{"mla":"Xiao, Y. .. H., et al. “Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar.” <i>IEEE Transactions on Vehicular Technology</i>, vol. 67, no. 7, 2018, pp. 5868–5882.","ama":"Xiao Y-. H, Huang L, Zhang J-. K, Xie J, So HC. Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar. <i>IEEE Transactions on Vehicular Technology</i>. 2018;67(7):5868–5882.","bibtex":"@article{Xiao_Huang_Zhang_Xie_So_2018, title={Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar}, volume={67}, number={7}, journal={IEEE Transactions on Vehicular Technology}, author={Xiao, Y-.H. and Huang, L. and Zhang, J-.K. and Xie, J. and So, H. C.}, year={2018}, pages={5868–5882} }","apa":"Xiao, Y.-. H., Huang, L., Zhang, J.-. K., Xie, J., &#38; So, H. C. (2018). Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar. <i>IEEE Transactions on Vehicular Technology</i>, <i>67</i>(7), 5868–5882.","ieee":"Y.-. H. Xiao, L. Huang, J.-. K. Zhang, J. Xie, and H. C. So, “Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar,” <i>IEEE Transactions on Vehicular Technology</i>, vol. 67, no. 7, pp. 5868–5882, 2018.","chicago":"Xiao, Y-.H., L. Huang, J-.K. Zhang, J. Xie, and H. C. So. “Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar.” <i>IEEE Transactions on Vehicular Technology</i> 67, no. 7 (2018): 5868–5882.","short":"Y.-. H. Xiao, L. Huang, J.-. K. Zhang, J. Xie, H.C. So, IEEE Transactions on Vehicular Technology 67 (2018) 5868–5882."},"publication":"IEEE Transactions on Vehicular Technology","issue":"7","date_created":"2023-01-30T11:51:39Z","department":[{"_id":"263"}],"type":"journal_article","author":[{"first_name":"Y-.H.","last_name":"Xiao","full_name":"Xiao, Y-.H."},{"full_name":"Huang, L.","first_name":"L.","last_name":"Huang"},{"full_name":"Zhang, J-.K.","first_name":"J-.K.","last_name":"Zhang"},{"full_name":"Xie, J.","last_name":"Xie","first_name":"J."},{"last_name":"So","first_name":"H. C.","full_name":"So, H. C."}],"title":"Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar","year":"2018","status":"public","intvolume":"        67","date_updated":"2023-01-30T12:02:55Z","_id":"40698","page":"5868–5882","volume":67,"user_id":"43497"},{"intvolume":"        20","date_updated":"2023-01-30T12:02:53Z","author":[{"full_name":"Santamaria, Ignacio","first_name":"Ignacio","last_name":"Santamaria"},{"full_name":"Crespo, Pedro M.","first_name":"Pedro M.","last_name":"Crespo"},{"first_name":"Christian","last_name":"Lameiro","full_name":"Lameiro, Christian"},{"last_name":"Schreier","first_name":"Peter J.","full_name":"Schreier, Peter J."}],"status":"public","title":"Information-Theoretic Analysis of a Family of Improper Discrete Constellations","year":"2018","volume":20,"user_id":"43497","doi":"10.3390/e20010045","_id":"40697","citation":{"apa":"Santamaria, I., Crespo, P. M., Lameiro, C., &#38; Schreier, P. J. (2018). Information-Theoretic Analysis of a Family of Improper Discrete Constellations. <i>Entropy</i>, <i>20</i>(1). <a href=\"https://doi.org/10.3390/e20010045\">https://doi.org/10.3390/e20010045</a>","ieee":"I. Santamaria, P. M. Crespo, C. Lameiro, and P. J. Schreier, “Information-Theoretic Analysis of a Family of Improper Discrete Constellations,” <i>Entropy</i>, vol. 20, no. 1, 2018, doi: <a href=\"https://doi.org/10.3390/e20010045\">10.3390/e20010045</a>.","short":"I. Santamaria, P.M. Crespo, C. Lameiro, P.J. Schreier, Entropy 20 (2018).","chicago":"Santamaria, Ignacio, Pedro M. Crespo, Christian Lameiro, and Peter J. Schreier. “Information-Theoretic Analysis of a Family of Improper Discrete Constellations.” <i>Entropy</i> 20, no. 1 (2018). <a href=\"https://doi.org/10.3390/e20010045\">https://doi.org/10.3390/e20010045</a>.","mla":"Santamaria, Ignacio, et al. “Information-Theoretic Analysis of a Family of Improper Discrete Constellations.” <i>Entropy</i>, vol. 20, no. 1, 2018, doi:<a href=\"https://doi.org/10.3390/e20010045\">10.3390/e20010045</a>.","ama":"Santamaria I, Crespo PM, Lameiro C, Schreier PJ. Information-Theoretic Analysis of a Family of Improper Discrete Constellations. <i>Entropy</i>. 2018;20(1). doi:<a href=\"https://doi.org/10.3390/e20010045\">10.3390/e20010045</a>","bibtex":"@article{Santamaria_Crespo_Lameiro_Schreier_2018, title={Information-Theoretic Analysis of a Family of Improper Discrete Constellations}, volume={20}, DOI={<a href=\"https://doi.org/10.3390/e20010045\">10.3390/e20010045</a>}, number={1}, journal={Entropy}, author={Santamaria, Ignacio and Crespo, Pedro M. and Lameiro, Christian and Schreier, Peter J.}, year={2018} }"},"issue":"1","publication":"Entropy","department":[{"_id":"263"}],"type":"journal_article","date_created":"2023-01-30T11:51:39Z"},{"page":"1–6","_id":"40694","user_id":"43497","doi":"10.1109/MLSP.2018.8516941","title":"MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS","year":"2018","status":"public","author":[{"full_name":"Eguizabal, A.","first_name":"A.","last_name":"Eguizabal"},{"full_name":"Schreier, P. J.","last_name":"Schreier","first_name":"P. J."},{"last_name":"Ramírez","first_name":"D.","full_name":"Ramírez, D."}],"date_updated":"2023-01-30T12:02:42Z","date_created":"2023-01-30T11:51:38Z","type":"conference","department":[{"_id":"263"}],"publication":"2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)","citation":{"ieee":"A. Eguizabal, P. J. Schreier, and D. Ramírez, “MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS,” in <i>2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)</i>, 2018, pp. 1–6, doi: <a href=\"https://doi.org/10.1109/MLSP.2018.8516941\">10.1109/MLSP.2018.8516941</a>.","apa":"Eguizabal, A., Schreier, P. J., &#38; Ramírez, D. (2018). MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS. <i>2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)</i>, 1–6. <a href=\"https://doi.org/10.1109/MLSP.2018.8516941\">https://doi.org/10.1109/MLSP.2018.8516941</a>","chicago":"Eguizabal, A., P. J. Schreier, and D. Ramírez. “MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS.” In <i>2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)</i>, 1–6, 2018. <a href=\"https://doi.org/10.1109/MLSP.2018.8516941\">https://doi.org/10.1109/MLSP.2018.8516941</a>.","short":"A. Eguizabal, P.J. Schreier, D. Ramírez, in: 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP), 2018, pp. 1–6.","mla":"Eguizabal, A., et al. “MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS.” <i>2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)</i>, 2018, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/MLSP.2018.8516941\">10.1109/MLSP.2018.8516941</a>.","bibtex":"@inproceedings{Eguizabal_Schreier_Ramírez_2018, title={MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS}, DOI={<a href=\"https://doi.org/10.1109/MLSP.2018.8516941\">10.1109/MLSP.2018.8516941</a>}, booktitle={2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)}, author={Eguizabal, A. and Schreier, P. J. and Ramírez, D.}, year={2018}, pages={1–6} }","ama":"Eguizabal A, Schreier PJ, Ramírez D. MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS. In: <i>2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)</i>. ; 2018:1–6. doi:<a href=\"https://doi.org/10.1109/MLSP.2018.8516941\">10.1109/MLSP.2018.8516941</a>"}},{"year":"2018","status":"public","title":"DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS","author":[{"full_name":"Smirnov, S.","last_name":"Smirnov","first_name":"S."},{"last_name":"Eguizabal","first_name":"A.","full_name":"Eguizabal, A."}],"date_updated":"2023-01-30T12:02:40Z","_id":"40696","user_id":"43497","publication":"2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage","citation":{"ieee":"S. Smirnov and A. Eguizabal, “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS,” 2018.","apa":"Smirnov, S., &#38; Eguizabal, A. (2018). DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS. <i>2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage</i>.","short":"S. Smirnov, A. Eguizabal, in: 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage, 2018.","chicago":"Smirnov, S., and A. Eguizabal. “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS.” In <i>2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage</i>, 2018.","mla":"Smirnov, S., and A. Eguizabal. “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS.” <i>2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage</i>, 2018.","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} }","ama":"Smirnov S, Eguizabal A. DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS. In: <i>2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage</i>. ; 2018."},"date_created":"2023-01-30T11:51:38Z","type":"conference","department":[{"_id":"263"}]},{"citation":{"short":"C. Lameiro, I. Santamaria, P.J. Schreier, in: Proc. IEEE Wireless Comm. Networking Conf. (WCNC), Barcelona, Spain, 2018.","chicago":"Lameiro, Christian, Ignacio Santamaria, and Peter J. Schreier. “Performance Analysis of Maximally Improper Signaling for Multiple-Antenna Systems.” In <i>Proc. IEEE Wireless Comm. Networking Conf. (WCNC)</i>. Barcelona, Spain, 2018.","ieee":"C. Lameiro, I. Santamaria, and P. J. Schreier, “Performance analysis of maximally improper signaling for multiple-antenna systems,” 2018.","apa":"Lameiro, C., Santamaria, I., &#38; Schreier, P. J. (2018). Performance analysis of maximally improper signaling for multiple-antenna systems. <i>Proc. IEEE Wireless Comm. Networking Conf. (WCNC)</i>.","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} }","ama":"Lameiro C, Santamaria I, Schreier PJ. Performance analysis of maximally improper signaling for multiple-antenna systems. In: <i>Proc. IEEE Wireless Comm. Networking Conf. (WCNC)</i>. ; 2018.","mla":"Lameiro, Christian, et al. “Performance Analysis of Maximally Improper Signaling for Multiple-Antenna Systems.” <i>Proc. IEEE Wireless Comm. Networking Conf. (WCNC)</i>, 2018."},"publication":"Proc. IEEE Wireless Comm. Networking Conf. (WCNC)","date_created":"2023-01-30T11:51:40Z","place":"Barcelona, Spain","department":[{"_id":"263"}],"type":"conference","author":[{"full_name":"Lameiro, Christian","first_name":"Christian","last_name":"Lameiro"},{"full_name":"Santamaria, Ignacio","last_name":"Santamaria","first_name":"Ignacio"},{"last_name":"Schreier","first_name":"Peter J.","full_name":"Schreier, Peter J."}],"year":"2018","title":"Performance analysis of maximally improper signaling for multiple-antenna systems","status":"public","date_updated":"2023-01-30T12:03:17Z","_id":"40706","user_id":"43497"},{"department":[{"_id":"57"}],"type":"journal_article","date_created":"2023-02-17T13:58:58Z","citation":{"apa":"Mishra, P. K., Chatterjee, D., &#38; Quevedo, D. E. (2018). Sparse and constrained stochastic predictive control for networked systems. <i>Automatica</i>, <i>87</i>(1), 40–51.","ieee":"P. K. Mishra, D. Chatterjee, and D. E. Quevedo, “Sparse and constrained stochastic predictive control for networked systems,” <i>Automatica</i>, vol. 87, no. 1, pp. 40–51, 2018.","short":"P.K. Mishra, D. Chatterjee, D.E. Quevedo, Automatica 87 (2018) 40–51.","chicago":"Mishra, P. K., D. Chatterjee, and D. E. Quevedo. “Sparse and Constrained Stochastic Predictive Control for Networked Systems.” <i>Automatica</i> 87, no. 1 (2018): 40–51.","mla":"Mishra, P. K., et al. “Sparse and Constrained Stochastic Predictive Control for Networked Systems.” <i>Automatica</i>, vol. 87, no. 1, 2018, pp. 40–51.","ama":"Mishra PK, Chatterjee D, Quevedo DE. Sparse and constrained stochastic predictive control for networked systems. <i>Automatica</i>. 2018;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} }"},"publication":"Automatica","issue":"1","volume":87,"user_id":"238","language":[{"iso":"eng"}],"_id":"42214","page":"40–51","intvolume":"        87","date_updated":"2023-02-17T14:01:27Z","author":[{"last_name":"Mishra","first_name":"P. K.","full_name":"Mishra, P. K."},{"full_name":"Chatterjee, D.","last_name":"Chatterjee","first_name":"D."},{"last_name":"Quevedo","first_name":"D. E.","full_name":"Quevedo, D. E."}],"status":"public","year":"2018","title":"Sparse and constrained stochastic predictive control for networked systems"},{"publication":"Trans. Power Electron.","issue":"7","citation":{"apa":"L\\’opez, A. M., Quevedo, D. E., Aguilera, R. P., Geyer, T., &#38; Oikonomou, N. (2018). Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters. <i>Trans. Power Electron.</i>, <i>33</i>(7), 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,” <i>Trans. Power Electron.</i>, vol. 33, no. 7, pp. 6292–6303, 2018.","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.” <i>Trans. Power Electron.</i> 33, no. 7 (2018): 6292–6303.","short":"A.M. L\\’opez, D.E. Quevedo, R.P. Aguilera, T. Geyer, N. Oikonomou, Trans. Power Electron. 33 (2018) 6292–6303.","mla":"L\\’opez, A. M., et al. “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters.” <i>Trans. Power Electron.</i>, vol. 33, no. 7, 2018, pp. 6292–6303.","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. <i>Trans Power Electron</i>. 2018;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} }"},"date_created":"2023-02-17T14:34:07Z","type":"journal_article","department":[{"_id":"57"}],"year":"2018","title":"Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters","status":"public","author":[{"full_name":"L\\’opez, A. M.","last_name":"L\\’opez","first_name":"A. M."},{"first_name":"D. E.","last_name":"Quevedo","full_name":"Quevedo, D. E."},{"full_name":"Aguilera, R. P.","first_name":"R. P.","last_name":"Aguilera"},{"full_name":"Geyer, T.","first_name":"T.","last_name":"Geyer"},{"last_name":"Oikonomou","first_name":"N.","full_name":"Oikonomou, N."}],"date_updated":"2023-02-17T14:38:53Z","intvolume":"        33","page":"6292–6303","language":[{"iso":"eng"}],"_id":"42216","user_id":"238","volume":33},{"department":[{"_id":"57"}],"type":"journal_article","date_created":"2023-02-17T14:34:41Z","citation":{"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,” <i>Trans. Contr. Network Syst.</i>, 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.” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 3, 2018, pp. 1275–1286.","apa":"Demirel, B., Ghadimi, E., Quevedo, D. E., &#38; Johansson, M. (2018). Optimal control of linear systems with limited control actions: threshold-based event-triggered control. <i>Trans. Contr. Network Syst.</i>, <i>5</i>(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.” <i>Trans. Contr. Network Syst.</i> 5, no. 3 (2018): 1275–1286.","ama":"Demirel B, Ghadimi E, Quevedo DE, Johansson M. Optimal control of linear systems with limited control actions: threshold-based event-triggered control. <i>Trans Contr Network Syst</i>. 2018;5(3):1275–1286.","short":"B. Demirel, E. Ghadimi, D.E. Quevedo, M. Johansson, Trans. Contr. Network Syst. 5 (2018) 1275–1286."},"publication":"Trans. Contr. Network Syst.","issue":"3","volume":5,"user_id":"238","language":[{"iso":"eng"}],"_id":"42219","page":"1275–1286","intvolume":"         5","date_updated":"2023-02-17T14:38:43Z","author":[{"full_name":"Demirel, B.","first_name":"B.","last_name":"Demirel"},{"last_name":"Ghadimi","first_name":"E.","full_name":"Ghadimi, E."},{"full_name":"Quevedo, D. E.","first_name":"D. E.","last_name":"Quevedo"},{"full_name":"Johansson, M.","last_name":"Johansson","first_name":"M."}],"year":"2018","title":"Optimal control of linear systems with limited control actions: threshold-based event-triggered control","status":"public"},{"department":[{"_id":"57"}],"type":"journal_article","date_created":"2023-02-17T14:34:32Z","citation":{"mla":"Demirel, B., et al. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Contr. Syst. Lett.</i>, vol. 2, no. 4, 2018, pp. 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} }","ama":"Demirel B, Ramaswamy A, Quevedo DE, Karl H. DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. <i>IEEE Contr Syst Lett</i>. 2018;2(4):737–742.","ieee":"B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,” <i>IEEE Contr. Syst. Lett.</i>, vol. 2, no. 4, pp. 737–742, 2018.","apa":"Demirel, B., Ramaswamy, A., Quevedo, D. E., &#38; Karl, H. (2018). DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. <i>IEEE Contr. Syst. Lett.</i>, <i>2</i>(4), 737–742.","chicago":"Demirel, B., A. Ramaswamy, D. E. Quevedo, and H. Karl. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Contr. Syst. Lett.</i> 2, no. 4 (2018): 737–742.","short":"B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Contr. Syst. Lett. 2 (2018) 737–742."},"issue":"4","publication":"IEEE Contr. Syst. Lett.","volume":2,"user_id":"238","language":[{"iso":"eng"}],"_id":"42218","page":"737–742","intvolume":"         2","date_updated":"2023-02-17T14:38:46Z","author":[{"first_name":"B.","last_name":"Demirel","full_name":"Demirel, B."},{"full_name":"Ramaswamy, A.","first_name":"A.","last_name":"Ramaswamy"},{"full_name":"Quevedo, D. E.","last_name":"Quevedo","first_name":"D. E."},{"full_name":"Karl, H.","first_name":"H.","last_name":"Karl"}],"status":"public","year":"2018","title":"DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling"},{"page":"54–60","_id":"42217","language":[{"iso":"eng"}],"user_id":"238","volume":91,"status":"public","year":"2018","title":"Transmission scheduling for remote state estimation and control with an energy harvesting sensor","author":[{"full_name":"Leong, A.","first_name":"A.","last_name":"Leong"},{"full_name":"Dey, S.","first_name":"S.","last_name":"Dey"},{"full_name":"Quevedo, D. E.","last_name":"Quevedo","first_name":"D. E."}],"date_updated":"2023-02-17T14:38:50Z","intvolume":"        91","date_created":"2023-02-17T14:34:20Z","type":"journal_article","department":[{"_id":"57"}],"publication":"Automatica","issue":"5","citation":{"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} }","ama":"Leong A, Dey S, Quevedo DE. Transmission scheduling for remote state estimation and control with an energy harvesting sensor. <i>Automatica</i>. 2018;91(5):54–60.","mla":"Leong, A., et al. “Transmission Scheduling for Remote State Estimation and Control with an Energy Harvesting Sensor.” <i>Automatica</i>, vol. 91, no. 5, 2018, pp. 54–60.","chicago":"Leong, A., S. Dey, and D. E. Quevedo. “Transmission Scheduling for Remote State Estimation and Control with an Energy Harvesting Sensor.” <i>Automatica</i> 91, no. 5 (2018): 54–60.","short":"A. Leong, S. Dey, D.E. Quevedo, Automatica 91 (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,” <i>Automatica</i>, vol. 91, no. 5, pp. 54–60, 2018.","apa":"Leong, A., Dey, S., &#38; Quevedo, D. E. (2018). Transmission scheduling for remote state estimation and control with an energy harvesting sensor. <i>Automatica</i>, <i>91</i>(5), 54–60."}},{"department":[{"_id":"57"}],"type":"journal_article","date_created":"2023-02-17T14:33:58Z","citation":{"chicago":"Liu, S., L. Xie, and D. E. Quevedo. “Event-Triggered Quantized Communication-Based Distributed Convex Optimization.” <i>Trans. Contr. Network Syst.</i> 5, no. 1 (2018): 167–178.","short":"S. Liu, L. Xie, D.E. Quevedo, Trans. Contr. Network Syst. 5 (2018) 167–178.","apa":"Liu, S., Xie, L., &#38; Quevedo, D. E. (2018). Event-Triggered Quantized Communication-Based Distributed Convex Optimization. <i>Trans. Contr. Network Syst.</i>, <i>5</i>(1), 167–178.","ieee":"S. Liu, L. Xie, and D. E. Quevedo, “Event-Triggered Quantized Communication-Based Distributed Convex Optimization,” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 1, pp. 167–178, 2018.","ama":"Liu S, Xie L, Quevedo DE. Event-Triggered Quantized Communication-Based Distributed Convex Optimization. <i>Trans Contr Network Syst</i>. 2018;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} }","mla":"Liu, S., et al. “Event-Triggered Quantized Communication-Based Distributed Convex Optimization.” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 1, 2018, pp. 167–178."},"publication":"Trans. Contr. Network Syst.","issue":"1","volume":5,"user_id":"238","_id":"42215","language":[{"iso":"eng"}],"page":"167–178","intvolume":"         5","date_updated":"2023-02-17T14:38:57Z","author":[{"last_name":"Liu","first_name":"S.","full_name":"Liu, S."},{"last_name":"Xie","first_name":"L.","full_name":"Xie, L."},{"full_name":"Quevedo, D. E.","last_name":"Quevedo","first_name":"D. E."}],"year":"2018","status":"public","title":"Event-Triggered Quantized Communication-Based Distributed Convex Optimization"},{"intvolume":"       117","date_updated":"2023-02-28T11:01:16Z","publication_status":"published","author":[{"full_name":"Aldi, Marco","first_name":"Marco","last_name":"Aldi"},{"full_name":"de Beaudrap, Niel","first_name":"Niel","last_name":"de Beaudrap"},{"id":"71541","orcid":"0000-0002-9992-3379","first_name":"Sevag","last_name":"Gharibian","full_name":"Gharibian, Sevag"},{"full_name":"Saeedi, Seyran","last_name":"Saeedi","first_name":"Seyran"}],"publication_identifier":{"unknown":["978-3-95977-086-6"]},"year":"2018","title":"On Efficiently Solvable Cases of Quantum k-SAT","doi":"10.4230/LIPIcs.MFCS.2018.38","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2018/9620/","open_access":"1"}],"abstract":[{"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.","lang":"eng"}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","department":[{"_id":"623"},{"_id":"7"}],"keyword":["search complexity","local Hamiltonian","Quantum SAT","algebraic geometry"],"type":"conference","date_created":"2019-03-01T11:34:41Z","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"status":"public","editor":[{"first_name":"Igor","last_name":"Potapov","full_name":"Potapov, Igor"},{"first_name":"Paul","last_name":"Spirakis","full_name":"Spirakis, Paul"},{"full_name":"Worrell, James","first_name":"James","last_name":"Worrell"}],"volume":117,"user_id":"71541","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8162","page":"38:1-38:16","citation":{"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={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>}, 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)} }","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. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>","mla":"Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 38:1-38:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","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.","chicago":"Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, 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. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>.","ieee":"M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable Cases of Quantum k-SAT,” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 38:1-38:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","apa":"Aldi, M., de Beaudrap, N., Gharibian, S., &#38; Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>"},"oa":"1","place":"Dagstuhl, Germany","external_id":{"arxiv":["1712.09617"]}},{"page":"58:1-58:16","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8161","user_id":"71541","volume":117,"editor":[{"full_name":"Potapov, Igor","first_name":"Igor","last_name":"Potapov"},{"first_name":"Paul","last_name":"Spirakis","full_name":"Spirakis, Paul"},{"last_name":"Worrell","first_name":"James","full_name":"Worrell, James"}],"status":"public","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"external_id":{"arxiv":["1805.11139"]},"place":"Dagstuhl, Germany","oa":"1","citation":{"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={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>}, 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)} }","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. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, 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. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>.","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.","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>"},"main_file_link":[{"url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640","open_access":"1"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.MFCS.2018.58","year":"2018","title":"Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)","publication_identifier":{"unknown":["978-3-95977-086-6"]},"author":[{"id":"71541","full_name":"Gharibian, Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag"},{"full_name":"Santha, Miklos","first_name":"Miklos","last_name":"Santha"},{"full_name":"Sikora, Jamie","last_name":"Sikora","first_name":"Jamie"},{"first_name":"Aarthi","last_name":"Sundaram","full_name":"Sundaram, Aarthi"},{"full_name":"Yirka, Justin","last_name":"Yirka","first_name":"Justin"}],"publication_status":"published","date_updated":"2023-02-28T11:01:03Z","intvolume":"       117","date_created":"2019-03-01T11:29:44Z","keyword":["Complexity Theory","Quantum Computing","Polynomial Hierarchy","Semidefinite Programming","QMA(2)","Quantum Complexity"],"type":"conference","department":[{"_id":"623"},{"_id":"7"}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","abstract":[{"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.","lang":"eng"}]}]