The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrej Bogdanov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrej Bogdanov, Hoeteck Wee
    A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:298-309 [Conf]
  2. Andrej Bogdanov, Luca Trevisan
    Lower Bounds for Testing Bipartiteness in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:75-81 [Conf]
  3. Andrej Bogdanov, Hoeteck Wee
    More on Noncommutative Polynomial Identity Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:92-99 [Conf]
  4. Andrej Bogdanov, Kenji Obata, Luca Trevisan
    A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:93-102 [Conf]
  5. Andrej Bogdanov, Luca Trevisan
    On Worst-Case to Average-Case Reductions for NP Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:308-317 [Conf]
  6. Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch
    Mechanical Translation of I/O Automaton Specifications into First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FORTE, 2002, pp:364-368 [Conf]
  7. Andrej Bogdanov, Elitza N. Maneva, Samantha Riesenfeld
    Power-aware base station positioning for sensor networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  8. Andrej Bogdanov
    Pseudorandom generators for low degree polynomials. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:21-30 [Conf]
  9. Andrej Bogdanov, Luca Trevisan
    On Worst-Case to Average-Case Reductions for NP Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:015, pp:- [Journal]
  10. Andrej Bogdanov, Luca Trevisan
    On Worst-Case to Average-Case Reductions for NP Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1119-1159 [Journal]
  11. Andrej Bogdanov, Luca Trevisan
    Average-Case Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  12. The Complexity of Distinguishing Markov Random Fields. [Citation Graph (, )][DBLP]


  13. On the Security of Goldreich's One-Way Function. [Citation Graph (, )][DBLP]


  14. Hardness Amplification for Errorless Heuristics. [Citation Graph (, )][DBLP]


  15. Pseudorandom Bits for Polynomials. [Citation Graph (, )][DBLP]


  16. Hard Instances for Satisfiability and Quasi-one-way Functions. [Citation Graph (, )][DBLP]


  17. The Computational Complexity of Estimating Convergence Time [Citation Graph (, )][DBLP]


  18. On extracting common random bits from correlated sources [Citation Graph (, )][DBLP]


  19. Pseudorandom bits for polynomials. [Citation Graph (, )][DBLP]


  20. Hardness amplification for errorless heuristics. [Citation Graph (, )][DBLP]


  21. Average-Case Complexity. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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