◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

K. M. Krishnan

4 papers hereh-index 6202 citations21 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • last author2

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.IT2
  • cs.CC1
  • cs.LO1

identity via Semantic Scholar / OpenAlex

activity
20052011
most citedLower Bound for the Communication Complexity of the Russian Cards Problem

8 citations · 8 across the 3 of their papers we have counts for

collaborators
Showing 2008 · cs.LOShow all

1 paper · 2 filters

cs.LO2008★ 8 cited

Lower Bound for the Communication Complexity of the Russian Cards Problem

Aiswarya Cyriac, K. Murali Krishnan

In this paper it is shown that no public announcement scheme that can be modeled in Dynamic Epistemic Logic (DEL) can solve the Russian Cards Problem (RCP) in one announcement. Sin…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.