Keerthana Gurushankar

dblp:303/4881 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0004-4350-6906ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%
Computer networks
1 paper
Content delivery and video streaming · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
cache
0.912025
Latency Guarantees for Caching with Delayed Hits · INFOCOM 2025
Memory systems › cache
delayed hits
0.912025
Latency Guarantees for Caching with Delayed Hits · INFOCOM 2025
Content delivery and video streaming
caching
0.312025
Latency Guarantees for Caching with Delayed Hits · INFOCOM 2025
YearPublicationVenuePosition
2025 Latency Guarantees for Caching with Delayed Hits
Keerthana Gurushankar, Noah Singer, Bernardo Subercaseaux
INFOCOM1
2023 Capturing and Interpreting Unique Information
abstract
Partial information decompositions (PIDs), which quantify information interactions between three or more variables in terms of uniqueness, redundancy and synergy, are gaining traction in many application domains. However, our understanding of the operational interpretations of PIDs is still incomplete for many popular PID definitions. In this paper, we discuss the operational interpretations of unique information through the lens of two well-known PID definitions. We reexamine an interpretation from statistical decision theory showing how unique information upper bounds the risk in a decision problem. We then explore a new connection between the two PIDs, which allows us to develop an informal but appealing interpretation, and generalize the PID definitions using a common Lagrangian formulation. Finally, we provide a new PID definition that is able to capture the information that is unique. We also show that it has a straightforward interpretation and examine its properties.The full version of this paper is available online [1].
Praveen Venkatesh, Keerthana Gurushankar, Gabriel Schamberg
ISIT2
2023 What's in a Name? Linear Temporal Logic Literally Represents Time Lines
abstract
Linear Temporal Logic (LTL) is arguably the most popular specification language for formal verification of safety-critical systems. However, LTL formulas can be unintuitive and error- prone for human practitioners to specify and validate. Meanwhile, drawing timelines remains one of the most popular methods for specifying and validating requirements for indus-trial system designs, such as in aerospace operational concepts. Therefore, we provide a new timeline tool for visualizing LTL specifications as timelines, providing provably-correct, intuitive equivalents between these two specification formats. Our tool generates timeline visualizations by translating LTL formulas to intermediate representations as Buchi automata and then regular expressions, and finally simplifying and visualizing the expressions. We provide an algorithm for this visualization, a theoretical soundness analysis” and an implementation.
Runming Li, Keerthana Gurushankar, Marijn Heule, Kristin Y. Rozier
VISSOFT2