Richard Beigel

Richard Beigel, Alexis Maciel, R. Beigel, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Nondeterministic Bounded Query Reducibilities

William I. Gasarch, Richard Beigel, James C. Owings, 1989, Ann. Pure Appl. Log..

An efficient algorithm for dynamic text indexing

Ming Gu, Richard Beigel, Martin Farach-Colton, 1994, SODA '94.

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph

Lane A. Hemaspaandra, Harald Hempel, Richard Beigel, 2002, Inf. Comput..

The Comlexity of OddAn

Frank Stephan, William I. Gasarch, Richard Beigel, 2000, J. Symb. Log..

An optimal procedure for gap closing in whole genome shotgun sequencing

Noga Alon, Lance Fortnow, Simon Kasif, 2001, RECOMB.

On the Query Complexity of Sets

Frank Stephan, William I. Gasarch, Richard Beigel, 1996, MFCS.

Design and evaluation of incremental data structures and algorithms for dynamic query interfaces

Ben Shneiderman, Richard Beigel, Egemen Tanin, 1997, Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium.

The power of local self-reductions

Howard Straubing, Richard Beigel, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

Probabilistic Polynomial Time is Closed under Parity Reductions

Lane A. Hemaspaandra, Gerd Wechsung, Richard Beigel, 1991, Inf. Process. Lett..

Locating faults in a constant number of parallel testing rounds

Richard Beigel, Gregory F. Sullivan, S. Rao Kosaraju, 1989, SPAA '89.

Some connections between bounded query classes and non-uniform complexity

Amihood Amir, William I. Gasarch, Richard Beigel, 2000, Inf. Comput..

Quantifying the Amount of Verboseness

Frank Stephan, Richard Beigel, Martin Kummer, 1992, Inf. Comput..

Frequency Computation and Bounded Queries

Efim B. Kinber, William I. Gasarch, Richard Beigel, 1996, Theor. Comput. Sci..

Modulo Information from Nonadaptive Queries to NP

Manindra Agrawal, Thomas Thierauf, Richard Beigel, 1996, Electron. Colloquium Comput. Complex..

3-Coloring in time O(1.3446n): A no-MIS Algorithm

David Eppstein, Richard Beigel, D. Eppstein, 1995, Electron. Colloquium Comput. Complex..

Are Cook and Karp ever the same?

Lance Fortnow, Richard Beigel, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

Approximable Sets

Frank Stephan, Richard Beigel, Martin Kummer, 1995, Inf. Comput..

Downward separation fails catastrophically for limited nondeterminism classes

Richard Beigel, Judy Goldsmith, J. Goldsmith, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

The Complexity of Modular Graph Automorphism

Vikraman Arvind, Richard Beigel, Antoni Lozano, 1998, STACS.

Commutative queries

Richard Chang, Richard Beigel, 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

Approximable sets

Frank Stephan, Richard Beigel, Martin Kummer, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

Languages that are easier than their proofs

Joan Feigenbaum, Mihir Bellare, Shafi Goldwasser, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

A Comparison of Resource-Bounded Molecular Computation Models

Bin Fu, Richard Beigel, 1999, Algorithmica.

On being incoherent without being very hard

Joan Feigenbaum, Richard Beigel, J. Feigenbaum, 2005, computational complexity.

Some connections between bounded query classes and nonuniform complexity

Amihood Amir, William I. Gasarch, Richard Beigel, 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

The polynomial method in circuit complexity

Richard Beigel, R. Beigel, 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

A tight lower bound for restricted pir protocols

Lance Fortnow, William I. Gasarch, Richard Beigel, 2006, computational complexity.

Downward separation fails catastrophically for limited nondeterminism classes

Richard Beigel, Judy Goldsmith, 1994, Computational Complexity Conference.

Circuits over PP and PL

Bin Fu, Richard Beigel, 2000, J. Comput. Syst. Sci..

A Note on the Polynomial Representation of Boolean Functions over GF(2)

Richard Beigel, Anna Bernasconi, 1999, Int. J. Found. Comput. Sci..

A structural theorem that depends quantitatively on the complexity of SAT

Richard Beigel, 1987, Computational Complexity Conference.

Nearly tight bounds for private information retrieval systems

Lance Fortnow, Richard Beigel, William Gasarch, 2002 .

Infinitely-Often Autoreducible Sets

Lance Fortnow, Frank Stephan, Richard Beigel, 2003, ISAAC.

On the relativized power of additional accepting paths

Richard Beigel, R. Beigel, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

OC1: A Randomized Induction of Oblique Decision Trees

Simon Kasif, Steven Salzberg, Richard Beigel, 1993, AAAI.

A relationship between difference hierarchies and relativized polynomial hierarchies

Mitsunori Ogihara, Richard Chang, Richard Beigel, 2005, Mathematical systems theory.

On ACC

Richard Beigel, Jun Tarui, R. Beigel, 1994, computational complexity.

Infinitely-Often Autoreducible Sets

Lance Fortnow, Frank Stephan, Richard Beigel, 2006, SIAM J. Comput..

On optimal scheduling of multiple mobile chargers in wireless sensor networks

Jie Wu, Huanyang Zheng, Richard Beigel, 2014, MSCC '14.

Bounded query classes and the difference hierarchy

William I. Gasarch, Richard Beigel, Louise Hay, 1989, Arch. Math. Log..

Quantifying the Amount of Verboseness

Frank Stephan, Richard Beigel, Martin Kummer, 1995, Inf. Comput..

When do extra majority gates help? Polylog (N) majority gates are equivalent to one

Richard Beigel, 2005, computational complexity.

Algorithms for four variants of the exact satisfiability problem

Peter Jonsson, Richard Beigel, Vilhelm Dahllöf, 2004, Theor. Comput. Sci..

PP Is Closed Under Intersection (Extended Abstract)

Daniel A. Spielman, Richard Beigel, Nick Reingold, 1991, STOC 1991.

Learning a Hidden Matching

Noga Alon, Benny Sudakov, Simon Kasif, 2004, SIAM J. Comput..

3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm

David Eppstein, Richard Beigel, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

The expressive power of voting polynomials

James Aspnes, Richard Beigel, Steven Rudich, 1991, STOC '91.

The Geometry of Browsing

Richard Beigel, Egemen Tanin, 1998, LATIN.

The Mapmaker's dilemma

William I. Gasarch, Richard Beigel, W. Gasarch, 1991, Discret. Appl. Math..

The perceptron strikes back

Daniel A. Spielman, Richard Beigel, Nick Reingold, 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

PP is closed under intersection

Daniel A. Spielman, Richard Beigel, Nick Reingold, 1991, STOC '91.

Unbounded Searching Slgorithms

Richard Beigel, 1990, SIAM J. Comput..

Molecular Computing, Bounded Nondeterminism, and Efficient Recursion

Bin Fu, Richard Beigel, 1997, ICALP.

Circuits over PP and PL

Bin Fu, Richard Beigel, R. Beigel, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Pinpointing Computation with Modular Queries in the Boolean Hierarchy

Manindra Agrawal, Thomas Thierauf, Richard Beigel, 1996, FSTTCS.

The complexity of oddan

Frank Stephan, Richard Beigel, Martin Kummer, 2000 .

Lower bounds for approximations by low degree polynomials over Z/sub m/

Noga Alon, Richard Beigel, N. Alon, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

The Complexity of Modular Graph Automorphism

Vikraman Arvind, Richard Beigel, Antoni Lozano, 2000, SIAM J. Comput..

On molecular approximation algorithms for NP optimization problem

Bin Fu, Richard Beigel, 1997, DNA Based Computers.

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

Bin Fu, Richard Beigel, R. Beigel, 2010, FAW-AAIM.

Counting Classes: Thresholds, Parity, Mods, and Fewness

John Gill, Richard Beigel, John Gill, 1990, Theor. Comput. Sci..

The expressive power of voting polynomials

James Aspnes, Richard Beigel, Steven Rudich, 1994, Comb..

On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case

William I. Gasarch, Richard Beigel, W. Gasarch, 1989, Ann. Pure Appl. Log..

The Language of Machines: an Introduction to Computability and Formal Languages

Robert W. Floyd, Richard Beigel, 1994 .

On ACC (circuit complexity)

Richard Beigel, Jun Tarui, R. Beigel, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case

William I. Gasarch, Richard Beigel, W. Gasarch, 1989, Ann. Pure Appl. Log..

Upper and lower bounds for some depth-3 circuit classes

Richard Beigel, Alexis Maciel, 2005, computational complexity.

PP is closed under intersection

Daniel A. Spielman, Richard Beigel, Nick Reingold, 1991, STOC '91.

Diagnosis in the Presence of Intermittent Faults

Bin Fu, Richard Beigel, 2004, ISAAC.

Closure properties of GapP and #P

Richard Beigel, 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

Fault diagnosis in a small constant number of parallel testing rounds

Daniel A. Spielman, Richard Beigel, Grigorii Margulis, 1993, SPAA '93.

Upper and lower bounds for some depth-3 circuit classes

Richard Beigel, Alexis Maciel, R. Beigel, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Counting Classes: Thresholds, Parity, Mods, and Fewness

John Gill, Richard Beigel, Ulrich Hertrampf, 1990, Theoretical Computer Science.

Gaps in bounded query hierarchies

Richard Beigel, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Finding maximum independent sets in sparse and general graphs

Richard Beigel, R. Beigel, 1999, SODA '99.

Terse, Superterse, and Verbose Sets

John Gill, William I. Gasarch, Richard Beigel, 1993, Inf. Comput..

A Nearly Tight Bound for Private Information Retrieval Protocols

Lance Fortnow, William I. Gasarch, Richard Beigel, 2003, Electron. Colloquium Comput. Complex..

A comparison of resource-bounded molecular computation models

Bin Fu, Richard Beigel, 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

On the sizes of DPDAs, PDAs, LBAs

William I. Gasarch, Richard Beigel, W. Gasarch, 2015, Theor. Comput. Sci..

Frequency computation and bounded queries

Efim B. Kinber, William I. Gasarch, Richard Beigel, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

Enumerations of the Kolmogorov function

Lance Fortnow, Frank Stephan, Harry Buhrman, 2006, Journal of Symbolic Logic.

On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP

Lane A. Hemaspaandra, Gerd Wechsung, Richard Beigel, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems

William I. Gasarch, Richard Beigel, James Glenn, 2006, MFCS.

Representing Boolean functions as polynomials modulo composite numbers

David A. Mix Barrington, Richard Beigel, Steven Rudich, 1994, computational complexity.

On Probabilistic ACC Circuits with an Exact-Threshold Output Gate

Richard Beigel, Seinosuke Toda, Jun Tarui, 1992, ISAAC.

Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces

Ben Shneiderman, Richard Beigel, Egemen Tanin, 1997, INFOVIS.

A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time

Eric Allender, Richard Beigel, Ulrich Hertrampf, 1990, STACS.

Learning a hidden matching

Noga Alon, Benny Sudakov, Simon Kasif, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Almost-Everywhere Complexity Hierarchies for Nondeterministic Time

Eric Allender, Richard Beigel, Ulrich Hertrampf, 1993, Theor. Comput. Sci..

Bi-Immunity Results for Cheatable Sets

Richard Beigel, R. Beigel, 1990, Theor. Comput. Sci..

Die Sprache der Maschinen

Robert W. Floyd, Richard Beigel, 1996, Informatik Lehrbuch-Reihe.

Perceptrons, PP, and the polynomial hierarchy

Richard Beigel, R. Beigel, 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

3-Coloring in Time O(1.3289^n)

David Eppstein, Richard Beigel, D. Eppstein, 2000, J. Algorithms.

Solving intractable problems with DNA computing

Bin Fu, Richard Beigel, R. Beigel, 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

NP might not be as easy as detecting unique solutions

Lance Fortnow, Harry Buhrman, Richard Beigel, 1997, STOC '98.

Representing Boolean functions as polynomials modulo composite numbers

David A. Mix Barrington, Richard Beigel, Steven Rudich, 1992, STOC '92.

A Partition-Based Group Testing Algorithm for Estimating the Number of Infected Individuals

Richard Beigel, Max J. Webber, 2021 .

A Nearly Tight Lower Bound for Private Information Retrieval Protocols

Lance Fortnow, Richard Beigel, William Gasarch, 2003 .

The complexity of ODDnA

Frank Stephan, Richard Beigel, Martin Kummer, 2000, Journal of Symbolic Logic.

Some Connections between Bounded Query Classes and Non-Uniform Complexity (Long Version)

Amihood Amir, Richard Beigel, William Gasarch, 2000 .

On the Power of Probabilistic Polynomial Time: (extended abstract)

Gerd Wechsung, Richard Beigel, Lane A. Hemachandra, 1989 .

Membership Comparable and p-Selective Sets

Lance Fortnow, Richard Beigel, A. Pavan, 2002 .

On the Power of Probabilistic Polynomial Time: P NP[log] subseteq PP.

Gerd Wechsung, Richard Beigel, Lane A. Hemachandra, 1989 .