◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Boyar

17 papers hereh-index 282.9k citations125 works total

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

author position
  • first author13
  • middle author3

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

fields
  • cs.DS13
  • cs.CC1
  • cs.CR1
  • cs.DC1
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20122026
most citedCancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators

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

collaborators
Showing 2012 · cs.CCShow all

1 paper · 2 filters

cs.CC2012★ 5 cited

Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators

Joan Boyar, Magnus Find

We continue to study the notion of cancellation-free linear circuits. We show that every matrix can be computed by a cancellation- free circuit, and almost all of these are at most…

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