The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2007, volume: 37, number: 1

  1. Frank Harary, Wolfgang Slany, Oleg Verbitsky
    On the Computational Complexity of the Forcing Chromatic Number. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:1-19 [Journal]
  2. Hartmut Klauck
    Lower Bounds for Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:20-46 [Journal]
  3. Dorit Aharonov, Amnon Ta-Shma
    Adiabatic Quantum State Generation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:47-82 [Journal]
  4. Phillip G. Bradford, Michael N. Katehakis
    A Probabilistic Study on Combinatorial Expanders and Hashing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:83-111 [Journal]
  5. Matthew Andrews, Lisa Zhang
    Hardness of the Undirected Congestion Minimization Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:112-131 [Journal]
  6. Florent R. Madelaine, Iain A. Stewart
    Constraint Satisfaction, Logic and Forbidden Patterns. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:132-163 [Journal]
  7. Dimitris Achlioptas, Vladlen Koltun
    Special Section on Foundations of Computer Science. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:165- [Journal]
  8. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
    Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:166-194 [Journal]
  9. Qi Cheng, Daqing Wan
    On the List and Bounded Distance Decodability of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:195-209 [Journal]
  10. Andris Ambainis
    Quantum Walk Algorithm for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:210-239 [Journal]
  11. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality - Almost. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:240-251 [Journal]
  12. Steve Chien, Alistair Sinclair
    Algebras with Polynomial Identities and Computing the Determinant. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:252-266 [Journal]
  13. Daniele Micciancio, Oded Regev
    Worst-Case to Average-Case Reductions Based on Gaussian Measures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:267-302 [Journal]
  14. Kamal Jain
    A Polynomial Time Algorithm for Computing an Arrow-Debreu Market Equilibrium for Linear Utilities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:303-318 [Journal]
  15. Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
    Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:319-357 [Journal]
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