Melih Bastopcu

Orcid: 0000-0001-5122-0642

According to our database1, Melih Bastopcu authored at least 41 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Timely Cache Updating in Parallel Multi-Relay Networks.
IEEE Trans. Wirel. Commun., January, 2024

The Role of Gossiping in Information Dissemination over a Network of Agents.
Entropy, January, 2024

Age of Coded Updates In Gossip Networks Under Memory and Memoryless Schemes.
CoRR, 2024

Semantic Communication in Multi-team Dynamic Games: A Mean Field Perspective.
CoRR, 2024

How to Make Money From Fresh Data: Subscription Strategies in Age-Based Systems.
CoRR, 2024

A Mean Field Game Model for Timely Computation in Edge Computing Systems.
CoRR, 2024

Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games.
CoRR, 2024

Age of (k, n)-Threshold Signature Scheme on a Gossip Network.
CoRR, 2024

Optimizing Profitability in Timely Gossip Networks.
Proceedings of the 25th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2024

Modeling Interfering Sources in Shared Queues for Timely Computations in Edge Computing Systems.
Proceedings of the Twenty-fifth International Symposium on Theory, 2024

Learning How to Strategically Disclose Information.
Proceedings of the American Control Conference, 2024

2023
Weighted Age of Information-Based Scheduling for Large Population Games on Networks.
IEEE J. Sel. Areas Inf. Theory, 2023

Online and Offline Dynamic Influence Maximization Games Over Social Networks.
CoRR, 2023

Value of Information in Games with Multiple Strategic Information Providers.
CoRR, 2023

Large Population Games on Constrained Unreliable Networks.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

Strategic Information Design in Quadratic Multidimensional Persuasion Games with Two Senders.
Proceedings of the American Control Conference, 2023

Large Population Games with Timely Scheduling over Constrained Networks.
Proceedings of the American Control Conference, 2023

2022
Version Age of Information in Clustered Gossip Networks.
IEEE J. Sel. Areas Inf. Theory, 2022

Using Timeliness in Tracking Infections.
Entropy, 2022

The Role of Gossiping for Information Dissemination over Networked Agents.
CoRR, 2022

The Dissemination of Time-Varying Information over Networked Agents with Gossiping.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Age of Information Optimization for Timeliness in Communication Networks.
PhD thesis, 2021

Information Freshness in Cache Updating Systems.
IEEE Trans. Wirel. Commun., 2021

Age of Information for Updates With Distortion: Constant and Age-Dependent Distortion Constraints.
IEEE/ACM Trans. Netw., 2021

Selective Encoding Policies for Maximizing Information Freshness.
IEEE Trans. Commun., 2021

Age of Gossip in Networks with Community Structure.
Proceedings of the 22nd IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2021

Freshness Based Cache Updating in Parallel Relay Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Timely Tracking of Infection Status of Individuals in a Population.
Proceedings of the 2021 IEEE Conference on Computer Communications Workshops, 2021

Gossiping with Binary Freshness Metric.
Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

Cache Freshness in Information Updating Systems.
Proceedings of the 55th Annual Conference on Information Sciences and Systems, 2021

Timely Group Updating.
Proceedings of the 55th Annual Conference on Information Sciences and Systems, 2021

2020
Information Freshness in Cache Updating Systems with Limited Cache Storage Capacity.
CoRR, 2020

Optimal Selective Encoding for Timely Updates with Empty Symbol.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Partial Updates: Losing Information for Freshness.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Who Should Google Scholar Update More Often?
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Optimal Selective Encoding for Timely Updates.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

Maximizing Information Freshness in Caching Systems with Limited Cache Storage Capacity.
Proceedings of the 54th Asilomar Conference on Signals, Systems, and Computers, 2020

2019
Minimizing age of information with soft updates.
J. Commun. Networks, 2019

Age of Information for Updates with Distortion.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

2018
Age of Information with Soft Updates.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

Scheduling a Human Channel.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018


  Loading...