default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMelih Bastopcu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i32]Shubham Aggarwal, Melih Bastopcu, Muhammad Aneeq uz Zaman, Tamer Basar, Sennur Ulukus, Nail Akar:
Fully Decentralized Computation Offloading in Priority-Driven Edge Computing Systems. CoRR abs/2501.05660 (2025)- 2024
- [j9]Melih Bastopcu
, Seyed Rasoul Etesami, Tamer Basar:
The Role of Gossiping in Information Dissemination over a Network of Agents. Entropy 26(1): 9 (2024) - [j8]Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus:
Timely Cache Updating in Parallel Multi-Relay Networks. IEEE Trans. Wirel. Commun. 23(1): 2-15 (2024) - [c21]Raj Kiriti Velicheti, Melih Bastopcu, S. Rasoul Etesami, Tamer Basar:
Learning How to Strategically Disclose Information. ACC 2024: 1604-1609 - [c20]Nail Akar, Melih Bastopcu, Sennur Ulukus, Tamer Basar:
Modeling Interfering Sources in Shared Queues for Timely Computations in Edge Computing Systems. MobiHoc 2024: 387-391 - [c19]Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus, S. Rasoul Etesami, Tamer Basar:
Optimizing Profitability in Timely Gossip Networks. SPAWC 2024: 806-810 - [i31]Erkan Bayram, Melih Bastopcu, Mohamed-Ali Belabbas, Tamer Basar:
Age of (k, n)-Threshold Signature Scheme on a Gossip Network. CoRR abs/2402.11462 (2024) - [i30]Raj Kiriti Velicheti, Melih Bastopcu, S. Rasoul Etesami, Tamer Basar:
Learning How to Strategically Disclose Information. CoRR abs/2403.08741 (2024) - [i29]Muhammad Aneeq uz Zaman, Shubham Aggarwal, Melih Bastopcu, Tamer Basar:
Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games. CoRR abs/2404.00045 (2024) - [i28]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Sennur Ulukus, Tamer Basar:
A Mean Field Game Model for Timely Computation in Edge Computing Systems. CoRR abs/2404.02898 (2024) - [i27]Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus, S. Rasoul Etesami, Tamer Basar:
How to Make Money From Fresh Data: Subscription Strategies in Age-Based Systems. CoRR abs/2404.16009 (2024) - [i26]Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus, S. Rasoul Etesami, Tamer Basar:
Optimizing Profitability in Timely Gossip Networks. CoRR abs/2405.00665 (2024) - [i25]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Semantic Communication in Multi-team Dynamic Games: A Mean Field Perspective. CoRR abs/2407.06528 (2024) - [i24]Nail Akar, Melih Bastopcu, Sennur Ulukus, Tamer Basar:
Modeling Interfering Sources in Shared Queues for Timely Computations in Edge Computing Systems. CoRR abs/2408.01327 (2024) - [i23]Erkan Bayram, Melih Bastopcu, Mohamed-Ali Belabbas, Tamer Basar:
Age of Coded Updates In Gossip Networks Under Memory and Memoryless Schemes. CoRR abs/2410.19696 (2024) - [i22]Atahan Dokme, Raj Kiriti Velicheti, Melih Bastopcu, Tamer Basar:
Remote Estimation Games with Random Walk Processes: Stackelberg Equilibrium. CoRR abs/2412.00679 (2024) - 2023
- [j7]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Weighted Age of Information-Based Scheduling for Large Population Games on Networks. IEEE J. Sel. Areas Inf. Theory 4: 682-697 (2023) - [c18]Raj Kiriti Velicheti, Melih Bastopcu, Tamer Basar:
Strategic Information Design in Quadratic Multidimensional Persuasion Games with Two Senders. ACC 2023: 1716-1722 - [c17]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Large Population Games with Timely Scheduling over Constrained Networks. ACC 2023: 4772-4778 - [c16]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Large Population Games on Constrained Unreliable Networks. CDC 2023: 3480-3485 - [i21]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Large Population Games on Constrained Unreliable Networks. CoRR abs/2303.09515 (2023) - [i20]Raj Kiriti Velicheti, Melih Bastopcu, Tamer Basar:
Value of Information in Games with Multiple Strategic Information Providers. CoRR abs/2306.14886 (2023) - [i19]Melih Bastopcu, S. Rasoul Etesami, Tamer Basar:
Online and Offline Dynamic Influence Maximization Games Over Social Networks. CoRR abs/2309.14317 (2023) - 2022
- [j6]Melih Bastopcu, Sennur Ulukus:
Using Timeliness in Tracking Infections. Entropy 24(6): 779 (2022) - [j5]Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus:
Version Age of Information in Clustered Gossip Networks. IEEE J. Sel. Areas Inf. Theory 3(1): 85-97 (2022) - [c15]Melih Bastopcu, S. Rasoul Etesami, Tamer Basar:
The Dissemination of Time-Varying Information over Networked Agents with Gossiping. ISIT 2022: 934-939 - [i18]Melih Bastopcu, S. Rasoul Etesami, Tamer Basar:
The Role of Gossiping for Information Dissemination over Networked Agents. CoRR abs/2201.08365 (2022) - [i17]Melih Bastopcu, Sennur Ulukus:
Using Timeliness in Tracking Infections. CoRR abs/2203.03602 (2022) - [i16]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Weighted Age of Information based Scheduling for Large Population Games on Networks. CoRR abs/2209.12888 (2022) - 2021
- [b1]Melih Bastopcu:
Age of Information Optimization for Timeliness in Communication Networks. University of Maryland, College Park, MD, USA, 2021 - [j4]Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus:
Selective Encoding Policies for Maximizing Information Freshness. IEEE Trans. Commun. 69(9): 5714-5726 (2021) - [j3]Melih Bastopcu, Sennur Ulukus:
Age of Information for Updates With Distortion: Constant and Age-Dependent Distortion Constraints. IEEE/ACM Trans. Netw. 29(6): 2425-2438 (2021) - [j2]Melih Bastopcu, Sennur Ulukus:
Information Freshness in Cache Updating Systems. IEEE Trans. Wirel. Commun. 20(3): 1861-1874 (2021) - [c14]Melih Bastopcu, Sennur Ulukus:
Timely Group Updating. CISS 2021: 1-6 - [c13]Melih Bastopcu, Sennur Ulukus:
Cache Freshness in Information Updating Systems. CISS 2021: 1-6 - [c12]Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus:
Gossiping with Binary Freshness Metric. GLOBECOM (Workshops) 2021: 1-6 - [c11]Melih Bastopcu, Sennur Ulukus:
Timely Tracking of Infection Status of Individuals in a Population. INFOCOM Workshops 2021: 1-7 - [c10]Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus:
Freshness Based Cache Updating in Parallel Relay Networks. ISIT 2021: 3355-3360 - [c9]Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus:
Age of Gossip in Networks with Community Structure. SPAWC 2021: 326-330 - [i15]Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus:
Age of Gossip in Networks with Community Structure. CoRR abs/2105.02867 (2021) - [i14]Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus:
Freshness Based Cache Updating in Parallel Relay Networks. CoRR abs/2105.05237 (2021) - [i13]Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus:
Gossiping with Binary Freshness Metric. CoRR abs/2107.14218 (2021) - [i12]Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus:
Version Age of Information in Clustered Gossip Networks. CoRR abs/2109.08669 (2021) - 2020
- [c8]Melih Bastopcu, Sennur Ulukus:
Maximizing Information Freshness in Caching Systems with Limited Cache Storage Capacity. ACSSC 2020: 423-427 - [c7]Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus:
Optimal Selective Encoding for Timely Updates. CISS 2020: 1-6 - [c6]Melih Bastopcu, Sennur Ulukus:
Who Should Google Scholar Update More Often? INFOCOM Workshops 2020: 696-701 - [c5]Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus:
Optimal Selective Encoding for Timely Updates with Empty Symbol. ISIT 2020: 1794-1799 - [c4]Melih Bastopcu, Sennur Ulukus:
Partial Updates: Losing Information for Freshness. ISIT 2020: 1800-1805 - [i11]Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus:
Optimal Selective Encoding for Timely Updates. CoRR abs/2001.09975 (2020) - [i10]Melih Bastopcu, Sennur Ulukus:
Partial Updates: Losing Information for Freshness. CoRR abs/2001.11014 (2020) - [i9]Melih Bastopcu, Sennur Ulukus:
Who Should Google Scholar Update More Often? CoRR abs/2001.11500 (2020) - [i8]Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus:
Selective Encoding Policies for Maximizing Information Freshness. CoRR abs/2004.06091 (2020) - [i7]Melih Bastopcu, Sennur Ulukus:
Information Freshness in Cache Updating Systems. CoRR abs/2004.09475 (2020) - [i6]Melih Bastopcu, Sennur Ulukus:
Information Freshness in Cache Updating Systems with Limited Cache Storage Capacity. CoRR abs/2005.10683 (2020) - [i5]Melih Bastopcu, Sennur Ulukus:
Timely Group Updating. CoRR abs/2011.15114 (2020) - [i4]Melih Bastopcu, Sennur Ulukus:
Timely Tracking of Infection Status of Individuals in a Population. CoRR abs/2012.13393 (2020)
2010 – 2019
- 2019
- [j1]Melih Bastopcu, Sennur Ulukus:
Minimizing age of information with soft updates. J. Commun. Networks 21(3): 233-243 (2019) - [c3]Melih Bastopcu, Sennur Ulukus:
Age of Information for Updates with Distortion. ITW 2019: 1-5 - [i3]Melih Bastopcu, Sennur Ulukus:
Age of Information for Updates with Distortion: Constant and Age-Dependent Distortion Constraints. CoRR abs/1912.13493 (2019) - 2018
- [c2]Melih Bastopcu, Sennur Ulukus:
Scheduling a Human Channel. ACSSC 2018: 1475-1479 - [c1]Melih Bastopcu, Sennur Ulukus:
Age of Information with Soft Updates. Allerton 2018: 378-385 - [i2]Melih Bastopcu, Sennur Ulukus:
Scheduling a Human Channel. CoRR abs/1812.03156 (2018) - [i1]Melih Bastopcu, Sennur Ulukus:
Minimizing Age of Information with Soft Updates. CoRR abs/1812.08148 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
