A. Grigorescu
On the Computability of Channel Capacity
Princeton University
2024

A. Grigorescu, H. Boche, R.F. Schaefer, H.V. Poor
Capacity Region Continuity of the Compound Broadcast Channel with Confidential Messages
2014

A. Grigorescu, H. Boche, R.F. Schaefer, H.V. Poor
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties
2022

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
2023

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Algorithmic Computability of the Capacity of Gaussian Channels with Colored Noise
2023

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
On the Non-Computability of Convex Optimization Problems
IEEE International Symposium on Information Theory
ISIT2024
IEEE
2024

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Characterization of the Complexity of Computing the Capacity of Colored Gaussian Noise Channels
IEEE Transactions on Communications
2024
Early Access
Mar

H. Boche, A. Grigorescu, R. F. Schaefer and H. V. Poor
On the Solvability of Resource Allocation Problems for Wireless Systems on Digital Computers
2024 IEEE International Conference on Communications
ICC2024
IEEE
2024

H. Boche, A. Grigorescu, R. F. Schaefer and H. V. Poor
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
2024 IEEE International Conference on Communications
ICC2024
IEEE
2024

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Algorithmic Computability of the Capacity of Additive Colored Gaussian Noise Channels
4375-4380
2023 IEEE Global Communications Conference
GLOBECOM 2023
IEEE
2023