◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Assaf Kartowsky

2 papers hereh-index 223 citations2 works total

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

author position
  • first author2

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

fields
  • cs.IT2

identity via Semantic Scholar / OpenAlex

most citedGreedy-Merge Degrading has Optimal Power-Law

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

collaborators

2 papers

cs.IT2017★ 3 cited

Greedy-Merge Degrading has Optimal Power-Law

Assaf Kartowsky, Ido Tal

Consider a channel with a given input alphabet size and a given input distribution. Our aim is to degrade or upgrade it to a channel with at most L output letters. The paper contai…

cs.IT2017

Greedy-Merge Degrading has Optimal Power-Law

Assaf Kartowsky, Ido Tal

Consider a channel with a given input distribution. Our aim is to degrade it to a channel with at most L output letters. One such degradation method is the so called "greedy-merge"…

◍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.