Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRavi B. Boppana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j17]Ravi B. Boppana, Harrie Hendriks, Martien C. A. van Zuijlen:
Tomaszewski's Problem on Randomly Signed sums, Revisited. Electron. J. Comb. 28(2): 2 (2021)- 2020
- [j16]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and local independent set approximation. Theor. Comput. Sci. 846: 27-37 (2020) - 2019
- [j15]Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola:
Bounded Independence versus Symmetric Tests. ACM Trans. Comput. Theory 11(4): 21:1-21:27 (2019) - 2017
- [j14]Ravi B. Boppana, Ron Holzman:
Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier. Electron. J. Comb. 24(3): 3 (2017) - 2000
- [j13]Ravi B. Boppana, Babu O. Narayanan:
Perfect-Information Leader Election with Optimal Resilience. SIAM J. Comput. 29(4): 1304-1320 (2000) - 1997
- [j12]Ravi B. Boppana:
The Average Sensitivity of Bounded-Depth Circuits. Inf. Process. Lett. 63(5): 257-261 (1997) - 1996
- [j11]Ravi B. Boppana, Babu O. Narayanan:
The Biased Coin Problem. SIAM J. Discret. Math. 9(1): 29-36 (1996) - 1994
- [j10]Ravi B. Boppana:
The Decision-Tree Complexity of Element Distinctness. Inf. Process. Lett. 52(6): 329-331 (1994) - 1992
- [j9]Ravi B. Boppana, Magnús M. Halldórsson:
Approximating Maximum Independent Sets by Excluding Subgraphs. BIT 32(2): 180-196 (1992) - 1989
- [j8]Ravi B. Boppana, Rafael Hirschfeld:
Pseudorandom Generators and Complexity Classes. Adv. Comput. Res. 5: 1-26 (1989) - [j7]Ravi B. Boppana:
Amplification of Probabilistic Boolean Formulas. Adv. Comput. Res. 5: 27-45 (1989) - [j6]Ravi B. Boppana:
The Average-Case Parallel Complexity of Sorting. Inf. Process. Lett. 33(3): 145-146 (1989) - 1987
- [j5]Noga Alon, Ravi B. Boppana:
The monotone circuit complexity of Boolean functions. Comb. 7(1): 1-22 (1987) - [j4]Ravi B. Boppana, J. C. Lagarias:
One-Way Functions and Circuit Complexity. Inf. Comput. 74(3): 226-240 (1987) - [j3]Ravi B. Boppana, Johan Håstad
, Stathis Zachos:
Does co-NP Have Short Interactive Proofs? Inf. Process. Lett. 25(2): 127-132 (1987) - 1986
- [j2]Ravi B. Boppana:
Threshold Functions and Bounded Depth Monotone Circuits. J. Comput. Syst. Sci. 32(2): 222-229 (1986) - 1982
- [j1]Ravi B. Boppana, Azriel Rosenfeld:
Some properties of Hueckel-type edge operators. Pattern Recognit. Lett. 1(1): 25-29 (1982)
Conference and Workshop Papers
- 2018
- [c11]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Brief Announcement: Simple and Local Independent Set Approximation. PODC 2018: 163-165 - [c10]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. SIROCCO 2018: 88-101 - 2016
- [c9]Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola:
Bounded Independence vs. Moduli. APPROX-RANDOM 2016: 24:1-24:9 - 1995
- [c8]Ravi Bopu Boppana, Joel Spencer:
Smoothness laws for random ordered graphs. Logic and Random Structures 1995: 15-32 - 1993
- [c7]Ravi B. Boppana, Babu O. Narayanan:
The biased coin problem. STOC 1993: 252-257 - 1990
- [c6]Ravi B. Boppana, Magnús M. Halldórsson:
Approximating Maximum Independent Sets by Excluding Subgraphs. SWAT 1990: 13-25 - 1989
- [c5]Ravi B. Boppana:
Optimal Separations Between Concurrent-Write Parallel Machines. STOC 1989: 320-326 - 1987
- [c4]Ravi B. Boppana:
Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract). FOCS 1987: 280-285 - 1986
- [c3]Ravi B. Boppana, J. C. Lagarias:
One- Way Functions and Circuit Complexity. SCT 1986: 51-65 - 1985
- [c2]Ravi B. Boppana:
Amplification of Probabilistic Boolean Formulas. FOCS 1985: 20-29 - 1984
- [c1]Ravi B. Boppana:
Threshold Functions and Bounded Depth Monotone Circuits. STOC 1984: 475-479
Parts in Books or Collections
- 1990
- [p1]Ravi B. Boppana, Michael Sipser:
The Complexity of Finite Functions. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 757-804
Editorship
- 1997
- [e1]Ravi Bopu Boppana, James F. Lynch:
Logic and Random Structures, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 5-7, 1995. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33, DIMACS/AMS 1997, ISBN 978-0-8218-0578-7 [contents]
Informal and Other Publications
- 2023
- [i4]Ravi B. Boppana:
A Useful Inequality for the Binary Entropy Function. CoRR abs/2301.09664 (2023) - 2020
- [i3]Ravi B. Boppana, Joel Brewster Lewis:
The tree search game for two players. CoRR abs/2008.11543 (2020) - 2018
- [i2]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. CoRR abs/1803.00786 (2018) - 2016
- [i1]Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola:
Bounded independence vs. moduli. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 02:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
