◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Pippenger

30 papers hereh-index 427k citations181 works total

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

author position
  • sole author6
  • first author1
  • last author23

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

fields
  • math.PR14
  • math.CO6
  • cs.CC4
  • cs.DM1
  • cs.DS1
  • cs.IT1

identity via Semantic Scholar / OpenAlex

activity
19982022
most citedCharacterizations of 1-Way Quantum Finite Automata

14 citations · 48 across the 28 of their papers we have counts for

collaborators
Showing 2003 · cs.DMShow all

1 paper · 2 filters

cs.DM2003★ 13 cited

The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function

Alex Brodsky, Nicholas Pippenger

Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of va…

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