Ravi B. Boppana - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2021

Tomaszewski's Problem on Randomly Signed sums, RevisitedRavi B. Boppana, Harrie Hendriks, Martien C. A. van Zuijlen. combinatorics, 28(2):2, 2021. [doi]

2020

Simple and local independent set approximationRavi B. Boppana, Magnús M. Halldórsson, Dror Rawitz. TCS, 846:27-37, 2020. [doi]

2019

Bounded Independence versus Symmetric TestsRavi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola. toct, 11(4), 2019. [doi]

2018

Brief Announcement: Simple and Local Independent Set ApproximationRavi B. Boppana, Magnús M. Halldórsson, Dror Rawitz. podc 2018: 163-165 [doi]

Simple and Local Independent Set ApproximationRavi B. Boppana, Magnús M. Halldórsson, Dror Rawitz. sirocco 2018: 88-101 [doi]

2017

Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 BarrierRavi B. Boppana, Ron Holzman. combinatorics, 24(3):3, 2017. [doi]

2016

Bounded independence vs. moduliRavi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola. eccc, 23:102, 2016. [doi]

Bounded Independence vs. ModuliRavi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola. approx 2016: [doi]

2000

Perfect-Information Leader Election with Optimal ResilienceRavi B. Boppana, Babu O. Narayanan. SICOMP, 29(4):1304-1320, 2000.

1997

The Average Sensitivity of Bounded-Depth CircuitsRavi B. Boppana. ipl, 63(5):257-261, 1997. [doi]

1996

The Biased Coin ProblemRavi B. Boppana, Babu O. Narayanan. siamdm, 9(1):29-36, 1996. [doi]

1994

The Decision-Tree Complexity of Element DistinctnessRavi B. Boppana. ipl, 52(6):329-331, 1994.

1993

The biased coin problemRavi B. Boppana, Babu O. Narayanan. stoc 1993: 252-257 [doi]

1992

Approximating Maximum Independent Sets by Excluding SubgraphsRavi B. Boppana, Magnús M. Halldórsson. bit, 32(2):180-196, 1992.

1990

The Complexity of Finite FunctionsRavi B. Boppana, Michael Sipser. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). pages 757-804, 1990.

Approximating Maximum Independent Sets by Excluding SubgraphsRavi B. Boppana, Magnús M. Halldórsson. swat 1990: 13-25

1989

Optimal Separations Between Concurrent-Write Parallel MachinesRavi B. Boppana. stoc 1989: 320-326

The Average-Case Parallel Complexity of SortingRavi B. Boppana. ipl, 33(3):145-146, 1989.

Pseudorandom Generators and Complexity ClassesRavi B. Boppana, Rafael Hirschfeld. acr, 5:1-26, 1989.

Amplification of Probabilistic Boolean FormulasRavi B. Boppana. acr, 5:27-45, 1989.

1987

The monotone circuit complexity of Boolean functionsNoga Alon, Ravi B. Boppana. combinatorica, 7(1):1-22, 1987.

One-Way Functions and Circuit ComplexityRavi B. Boppana, J. C. Lagarias. iandc, 74(3):226-240, September 1987.

Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract)Ravi B. Boppana. focs 1987: 280-285

Does co-NP Have Short Interactive Proofs?Ravi B. Boppana, Johan Håstad, Stathis Zachos. ipl, 25(2):127-132, 1987.

1986

One- Way Functions and Circuit ComplexityRavi B. Boppana, J. C. Lagarias. cocoon 1986: 51-65

Threshold Functions and Bounded Depth Monotone CircuitsRavi B. Boppana. jcss, 32(2):222-229, 1986.

1985

Amplification of Probabilistic Boolean FormulasRavi B. Boppana. focs 1985: 20-29

1984

Threshold Functions and Bounded Depth Monotone CircuitsRavi B. Boppana. stoc 1984: 475-479

1982

Some properties of Hueckel-type edge operatorsRavi B. Boppana, Azriel Rosenfeld. prl, 1(1):25-29, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL