default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSahan Liyanaarachchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Sahan Liyanaarachchi
, Sennur Ulukus:
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays. IEEE Trans. Inf. Theory 70(9): 6665-6678 (2024)- [c5]Sahan Liyanaarachchi, Sennur Ulukus:
Early Sampling: Sampling with Incomplete Queue State Information to Minimize the Age. CISS 2024: 1-6 - [c4]Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus:
Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems. INFOCOM (Workshops) 2024: 1-7 - [c3]Sahan Liyanaarachchi, Kanchana Thilakarathna, Sennur Ulukus:
CAFe: Cost and Age aware Federated Learning. MobiHoc 2024: 404-409 - [c2]Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar:
Hybrid Status Update Systems with Dedicated and Shared Servers. WiOpt 2024: 22-29 - [i9]Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus:
Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems. CoRR abs/2401.04904 (2024) - [i8]Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar:
Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers. CoRR abs/2401.12962 (2024) - [i7]Sahan Liyanaarachchi, Kanchana Thilakarathna, Sennur Ulukus:
CAFe: Cost and Age aware Federated Learning. CoRR abs/2405.15744 (2024) - [i6]Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar:
Cyclic Scheduler Design for Minimizing Age of Information in Massive Scale Networks Susceptible to Packet Errors. CoRR abs/2406.15541 (2024) - [i5]Sahan Liyanaarachchi, Stavros Mitrolaris, Purbesh Mitra, Sennur Ulukus:
6G at 1/6g: The Future of Cislunar Communications. CoRR abs/2407.16672 (2024) - [i4]Sahan Liyanaarachchi, Sennur Ulukus, Nail Akar:
Scheduling Policies in a Multi-Source Status Update System with Dedicated and Shared Servers. CoRR abs/2410.21246 (2024) - 2023
- [i3]Sahan Liyanaarachchi, Sennur Ulukus:
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays. CoRR abs/2308.07905 (2023) - 2020
- [c1]Sadeep Jayasumana, Kanchana Ranasinghe, Sahan Liyanaarachchi, Mayuka Jayawardhana, Harsha Ranasinghe, Sina Samangooei:
Bipartite Conditional Random Fields for Panoptic Segmentation. BMVC 2020
2010 – 2019
- 2019
- [i2]Sadeep Jayasumana, Kanchana Ranasinghe, Mayuka Jayawardhana, Sahan Liyanaarachchi, Harsha Ranasinghe:
Bipartite Conditional Random Fields for Panoptic Segmentation. CoRR abs/1912.05307 (2019) - [i1]Kanchana Ranasinghe, Sahan Liyanaarachchi, Harsha Ranasinghe, Mayuka Jayawardhana:
Extending Multi-Object Tracking systems to better exploit appearance and 3D information. CoRR abs/1912.11651 (2019)
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-01-09 13:25 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:
