Paths Problems in Symmetric Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Functions computable in polynomial space
Information and Computation
Space efficient algorithms for directed series-parallel graphs
Journal of Algorithms
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On Lower Bounds for Constant Width Arithmetic Circuits
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Functions computable in polynomial space
Information and Computation
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the power of algebraic branching programs of width two
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Succinct algebraic branching programs characterizing non-uniform complexity classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On the geometry of tensor network states
Quantum Information & Computation
Counting paths in planar width 2 branching programs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Hi-index | 0.00 |