Trading uninitialized space for time
Information Processing Letters
Diagnosers and diagnosability of succinct transition systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The complexity of problems on implicitly represented inputs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
The complexity of discretionary access control
IWSEC'06 Proceedings of the 1st international conference on Security
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
Hi-index | 0.00 |