The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ravi B. Boppana: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ravi B. Boppana
    Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    FOCS, 1987, pp:280-285 [Conf]
  2. Ravi B. Boppana, Johan Håstad, Stathis Zachos
    Does co-NP Have Short Interactive Proofs? [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:2, pp:127-132 [Journal]
  3. Ravi B. Boppana, J. C. Lagarias
    One- Way Functions and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:51-65 [Conf]
  4. Ravi B. Boppana
    Amplification of Probabilistic Boolean Formulas [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:20-29 [Conf]
  5. Ravi B. Boppana
    Threshold Functions and Bounded Depth Monotone Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:475-479 [Conf]
  6. Ravi B. Boppana
    Optimal Separations Between Concurrent-Write Parallel Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:320-326 [Conf]
  7. Ravi B. Boppana, Babu O. Narayanan
    The biased coin problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:252-257 [Conf]
  8. Ravi B. Boppana, Magnús M. Halldórsson
    Approximating Maximum Independent Sets by Excluding Subgraphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:13-25 [Conf]
  9. Ravi B. Boppana, Magnús M. Halldórsson
    Approximating Maximum Independent Sets by Excluding Subgraphs. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:180-196 [Journal]
  10. Noga Alon, Ravi B. Boppana
    The monotone circuit complexity of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:1-22 [Journal]
  11. Ravi B. Boppana, J. C. Lagarias
    One-Way Functions and Circuit Complexity [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:74, n:3, pp:226-240 [Journal]
  12. Ravi B. Boppana
    The Average-Case Parallel Complexity of Sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:3, pp:145-146 [Journal]
  13. Ravi B. Boppana
    The Decision-Tree Complexity of Element Distinctness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:6, pp:329-331 [Journal]
  14. Ravi B. Boppana
    The Average Sensitivity of Bounded-Depth Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:5, pp:257-261 [Journal]
  15. Ravi B. Boppana
    Threshold Functions and Bounded Depth Monotone Circuits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:2, pp:222-229 [Journal]
  16. Ravi B. Boppana, Babu O. Narayanan
    Perfect-Information Leader Election with Optimal Resilience. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1304-1320 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002