Ayfer Özgür

According to our database1, Ayfer Özgür authored at least 103 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity.
IEEE Trans. Inf. Theory, 2020

Sparse Combinatorial Group Testing.
IEEE Trans. Inf. Theory, 2020

Asymptotic Convergence of Thompson Sampling.
CoRR, 2020

Strong Privacy and Utility Guarantee: Over-the-Air Statistical Estimation.
CoRR, 2020

Breaking the Communication-Privacy-Accuracy Trilemma.
CoRR, 2020

Lower Bounds and a Near-Optimal Shrinkage Estimator for Least Squares using Random Projections.
CoRR, 2020

Global Multiclass Classification from Heterogeneous Local Models.
CoRR, 2020

Fisher information under local differential privacy.
CoRR, 2020

rTop-k: A Statistical Estimation Approach to Distributed SGD.
CoRR, 2020

An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit Setting.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Strongly Explicit and Efficiently Decodable Probabilistic Group Testing.
Proceedings of the IEEE International Symposium on Information Theory, 2020

The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are Equivalent.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
"The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case.
IEEE Trans. Inf. Theory, 2019

On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing.
IEEE Trans. Inf. Theory, 2019

Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information.
IEEE Trans. Inf. Theory, 2019

Advances and Open Problems in Federated Learning.
CoRR, 2019

Minimax Bounds for Distributed Logistic Regression.
CoRR, 2019

Learning Distributions from their Samples under Communication Constraints.
CoRR, 2019

New Upper Bounds on the Capacity of Primitive Diamond Relay Channels.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

New Converses for the Relay Channel via Reverse Hypercontractivity.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Group Testing Approach to Random Access for Short-Packet Communication.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Fisher Information for Distributed Estimation under a Blackboard Communication Protocol.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Cut-Set Bound is Loose for Gaussian Relay Networks.
IEEE Trans. Inf. Theory, 2018

A Communication Channel With Random Battery Recharges.
IEEE Trans. Inf. Theory, 2018

Online Power Control for Block i.i.d. Energy Harvesting Channels.
IEEE Trans. Inf. Theory, 2018

Capacity of the Energy Harvesting Gaussian MAC.
IEEE Trans. Inf. Theory, 2018

On Achievable Rates of AWGN Energy-Harvesting Channels With Block Energy Arrival and Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2018

Communication With Crystal-Free Radios.
IEEE Trans. Commun., 2018

An Isoperimetric Result on High-Dimensional Spheres.
CoRR, 2018

Minimax Learning for Remote Prediction.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Energy-limited Massive Random Access via Noisy Group Testing.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Distributed Statistical Estimation of High-Dimensional and Nonparametric Distributions.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints.
Proceedings of the Conference On Learning Theory, 2018

A Geometric Characterization of Fisher Information from Quantized Samples with Applications to Distributed Statistical Estimation.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets.
IEEE Trans. Inf. Theory, 2017

Capacity of Remotely Powered Communication.
IEEE Trans. Inf. Theory, 2017

Sparse Combinatorial Group Testing for Low-Energy Massive Random Access.
CoRR, 2017

Approximately optimal policies for a class of Markov decision problems with applications to energy harvesting.
Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Online Power Control for Block i.i.d. Bernoulli Energy Harvesting Channels.
Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops, 2017

The geometry of the relay channel.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Can full-duplex more than double the capacity of wireless networks?
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Sparse group testing codes for low-energy massive random access.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

A solution to cover's problem for the binary symmetric relay channel: Geometry of sets on the hamming sphere.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Capacity of the Energy-Harvesting Channel With a Finite Battery.
IEEE Trans. Inf. Theory, 2016

Channel Diversity Needed for Vector Space Interference Alignment.
IEEE Trans. Inf. Theory, 2016

Multicoding Schemes for Interference Channels.
IEEE Trans. Inf. Theory, 2016

Cooperative Binning for Semideterministic Channels.
IEEE Trans. Inf. Theory, 2016

Achieving Full DoF in Heterogeneous Parallel Broadcast Channels With Outdated CSIT.
IEEE Trans. Inf. Theory, 2016

On the Complexity of Scheduling in Half-Duplex Diamond Networks.
IEEE Trans. Inf. Theory, 2016

STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks.
IEEE J. Sel. Areas Commun., 2016

Universally Near Optimal Online Power Control for Energy Harvesting Nodes.
IEEE J. Sel. Areas Commun., 2016

Phase Retrieval via Incremental Truncated Wirtinger Flow.
CoRR, 2016

Online power control for the energy harvesting multiple access channel.
Proceedings of the 14th International Symposium on Modeling and Optimization in Mobile, 2016

Improving on the cut-set bound for general primitive relay channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Cover's open problem: "The Capacity of the Relay Channel".
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Capacity Approximations for Gaussian Relay Networks.
IEEE Trans. Inf. Theory, 2015

When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?
IEEE Trans. Inf. Theory, 2015

On Feedback in Gaussian Multihop Networks.
IEEE Trans. Inf. Theory, 2015

Near Optimal Energy Control and Approximate Capacity of Energy Harvesting Communication.
IEEE J. Sel. Areas Commun., 2015

Optimal online strategies for an energy harvesting system with Bernoulli energy recharges.
Proceedings of the 13th International Symposium on Modeling and Optimization in Mobile, 2015

Can feedback increase the capacity of the energy harvesting channel?
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Upper bounds on the capacity of symmetric primitive relay channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Capacity of the AWGN channel with random battery recharges.
Proceedings of the IEEE International Symposium on Information Theory, 2015

State-dependent multiple-access channels with partially cribbing encoders.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Approximate capacity of Gaussian relay networks: Is a sublinear gap to the cutset bound plausible?
Proceedings of the IEEE International Symposium on Information Theory, 2015

Degrees of freedom of the MIMO interference channel with parallel multicasting.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Wireless Network Simplification: The Gaussian \(N\) -Relay Diamond Network.
IEEE Trans. Inf. Theory, 2014

Achieving the Capacity of the $N$ -Relay Gaussian Diamond Network Within log $N$ Bits.
IEEE Trans. Inf. Theory, 2014

On feedback in Gaussian multi-hop networks.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Channel diversity needed for vector interference alignment.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The capacity region of a class of deterministic state-dependent Z-interference channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Approximate capacity of energy harvesting communication with finite battery.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Outdated CSIT can achieve full DoF in heterogeneous parallel channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Deterministic Z-interference channels with unidirectional partial cribbing.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

Fast near-optimal subnetwork selection in layered relay networks.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Feedback through overhearing.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes.
IEEE Trans. Inf. Theory, 2013

Spatial Degrees of Freedom of Large Distributed MIMO Systems and Wireless Ad Hoc Networks.
IEEE J. Sel. Areas Commun., 2013

Improved capacity approximations for Gaussian relay networks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On information flow and feedback in relay networks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

A scaling law approach to wireless relay networks.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Telescopic beamforming for large wireless networks.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Generalized diversity-multiplexing tradeoff of half-duplex relay networks.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the structure of approximately optimal schedules for half-duplex diamond networks.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Achieving the capacity of the N-relay Gaussian diamond network within logn bits.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Dynamic QMF for half-duplex relay networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Hierarchical beamforming for large one-dimensional wireless networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Simple schedules for half-duplex networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Operating Regimes of Large Wireless Networks.
Found. Trends Netw., 2011

Graph-based codes for Quantize-Map-and-Forward relaying.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Network Simplification: The Gaussian diamond network with multiple antennas.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Throughput-delay tradeoff for hierarchical cooperation in ad hoc wireless networks.
IEEE Trans. Inf. Theory, 2010

Information-theoretic operating regimes of large wireless networks.
IEEE Trans. Inf. Theory, 2010

Linear capacity scaling in wireless networks: Beyond physical limits?
Proceedings of the Information Theory and Applications Workshop, 2010

Approximately achieving Gaussian relay network capacity with lattice codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Beyond Multi-Hop: Optimal Cooperation in Large Wireless Networks.
Proceedings of the 19th International Conference on Computer Communications and Networks, 2010

2009
Achieving linear scaling with interference alignment.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Throughput-delay trade-off for hierarchical cooperation in ad hoc wireless networks.
Proceedings of the 2008 International Conference on Telecommunications, 2008

2007
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks.
IEEE Trans. Inf. Theory, 2007

Scaling Laws for One- and Two-Dimensional Random Wireless Networks in the Low-Attenuation Regime.
IEEE Trans. Inf. Theory, 2007

Exact Capacity Scaling of Extended Wireless Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Hierarchical Cooperation Achieves Linear Capacity Scaling in Ad Hoc Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007


  Loading...