The SCEAS System
Navigation Menu

Conferences in DBLP

Publications Resulting from Dagstuhl Seminars (dagstuhl)
2007 (conf/dagstuhl/2007P7411)


  1. Diagonal Circuit Identity Testing and Lower Bounds. [Citation Graph (, )][DBLP]


  2. Classical Simulation Complexity of Quantum Branching Programs. [Citation Graph (, )][DBLP]


  3. The Unique Games Conjecture with Entangled Provers is False. [Citation Graph (, )][DBLP]


  4. 07411 Executive Summary -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  5. Uniqueness of Optimal Mod 3 Circuits for Parity. [Citation Graph (, )][DBLP]


  6. 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  7. High Entropy Random Selection Protocols. [Citation Graph (, )][DBLP]

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