Concepedia

Author

Richard Beigel

Yale University

Also Known As

(:Unkn) Unknown, Beigel, Richard, R. Beigel, RICHARD BEIGEL, Richard Beigel

142

Publications

3.4K

Citations

33

H-Index

102

Concepts

All Affiliations

Yale UniversityJohns Hopkins UniversityUniversity of Maryland, College ParkTemple UniversityUniversity of Illinois Chicago
RB

About

Richard Beigel is an author at Yale University specializing in engineering, computer science, and computational complexity.

Top Concepts

#ConceptH-IndexPublicationsCitations

1

Engineering

24

38

1.6K

2

Language Studies

2

2

82

3

Management

2

2

61

4

Medicine

2

2

59

5

Arts

1

1

160

Richard Beigel

×

58

Publications

3K

Citations

31

H-Index

YearCitations

The polynomial method in circuit complexity

Richard Beigel

2002

163

PP is closed under intersection

Richard Beigel, Nick Reingold, Daniel A. Spielman

1991

160

On ACC

Richard Beigel, Jun Tarui

Computational Complexity

1994

160

The expressive power of voting polynomials

James Aspnes, Richard Beigel, Merrick L. Furst,

COMBINATORICA

1994

159

3-coloring in time

Richard Beigel, David Eppstein

Journal of Algorithms

2004

155

OC1: randomized induction of oblique decision trees

Sreerama K. Murthy, Simon Kasif, Steven L. Salzberg,

1993

124

Counting classes: thresholds, parity, mods, and fewness

Richard Beigel, John Gill

Theoretical Computer Science

1992

123

Bounded queries to SAT and the Boolean hierarchy

Richard Beigel

Theoretical Computer Science

1991

114

Finding maximum independent sets in sparse and general graphs

Richard Beigel

1999

107

Representing Boolean functions as polynomials modulo composite numbers

David A. Mix Barrington, Richard Beigel, Steven Rudich

Computational Complexity

1994

105

Page 1