◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

K. M. Krishnan

11 papers hereh-index 6202 citations21 works total

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

author position
  • sole author1
  • first author2
  • middle author3
  • last author5

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

fields
  • cs.CC2
  • cs.DM2
  • cs.IT2
  • cs.LO2
  • cs.DS1
  • cs.OS1
same name
  • K. M. Krishnan — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052022
most citedOn the Complexity of finding Stopping Distance in Tanner Graphs

9 citations · 17 across the 9 of their papers we have counts for

collaborators
Showing 2008Show all

1 paper · 1 filter

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.