Author of the publication

Counting paths in planar width 2 branching programs.

, , and . CATS, volume 128 of CRPIT, page 59-68. Australian Computer Society, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)., , , , and . Dagstuhl Reports, 13 (3): 17-31 (March 2023)The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials., , , and . Theory Comput., 13 (1): 1-34 (2017)Shortest path length with bounded-alternation (min, +) formulas., , and . Electron. Colloquium Comput. Complex., (2018)On the Complexity of Rank and Rigidity., and . Electron. Colloquium Comput. Complex., (2006)Building above read-once polynomials: identity testing and hardness of representation., , and . Electron. Colloquium Comput. Complex., (2015)Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae., and . Electron. Colloquium Comput. Complex., (2008)Arithmetizing Classes Around NCNC1 and LL., , and . Theory Comput. Syst., 46 (3): 499-522 (2010)Block Sorting: A Characterization and some Heuristics., , and . Nord. J. Comput., 14 (1-2): 126-150 (2007)Towards Constructing Optimal Strip Move Sequences., , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 33-42. Springer, (2004)Determinant: Old Algorithms, New Insights (Extended Abstract)., and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 276-287. Springer, (1998)