The SCEAS System
| |||||||

## Search the dblp DataBase
Andrej Bogdanov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - Andrej Bogdanov, Elitza N. Maneva, Samantha Riesenfeld
**Power-aware base station positioning for sensor networks.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2004, pp:- [Conf] - Andrej Bogdanov
**Pseudorandom generators for low degree polynomials.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:21-30 [Conf] - 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] - 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] - Andrej Bogdanov, Luca Trevisan
**Average-Case Complexity**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **The Complexity of Distinguishing Markov Random Fields.**[Citation Graph (, )][DBLP]**On the Security of Goldreich's One-Way Function.**[Citation Graph (, )][DBLP]**Hardness Amplification for Errorless Heuristics.**[Citation Graph (, )][DBLP]**Pseudorandom Bits for Polynomials.**[Citation Graph (, )][DBLP]**Hard Instances for Satisfiability and Quasi-one-way Functions.**[Citation Graph (, )][DBLP]**The Computational Complexity of Estimating Convergence Time**[Citation Graph (, )][DBLP]**On extracting common random bits from correlated sources**[Citation Graph (, )][DBLP]**Pseudorandom bits for polynomials.**[Citation Graph (, )][DBLP]**Hardness amplification for errorless heuristics.**[Citation Graph (, )][DBLP]**Average-Case Complexity.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |