219 citations to https://www.mathnet.ru/rus/mzm4883
  1. Kristoffer Arnsfelt Hansen, Lecture Notes in Computer Science, 5675, Computer Science - Theory and Applications, 2009, 117  crossref
  2. Kristoffer Arnsfelt Hansen, Michal Koucký, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 27  crossref
  3. Vladimir V. Podolskii, Lecture Notes in Computer Science, 5010, Computer Science – Theory and Applications, 2008, 261  crossref
  4. Yael Tauman Kalai, Ran Raz, Lecture Notes in Computer Science, 5126, Automata, Languages and Programming, 2008, 536  crossref
  5. Parikshit Gopalan, “Query-Efficient Algorithms for Polynomial Interpolation over Composites”, SIAM J. Comput., 38:3 (2008), 1033  crossref
  6. Pavel Pudlák, Lecture Notes in Computer Science, 5010, Computer Science – Theory and Applications, 2008, 13  crossref
  7. Omer Barkol, Yuval Ishai, Enav Weinreb, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 661  crossref
  8. Kristoffer Arnsfelt Hansen, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 92  crossref
  9. Ran Raz, Amir Yehudayoff, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 128  crossref
  10. Rahul Santhanam, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 275  crossref
Предыдущая
1
10
11
12
13
14
15
16
22
Следующая