Author of the publication

Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy.

, and . MFCS, volume 272 of LIPIcs, page 85:1-85:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

Energy Complexity and Depth of Threshold Circuits., , and . FCT, volume 5699 of Lecture Notes in Computer Science, page 335-345. Springer, (2009)Energy and Fan-In of Threshold Circuits Computing Mod Functions., , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 154-163. Springer, (2011)Generalized Rainbow Connectivity of Graphs., , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 233-244. Springer, (2013)An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity., and . CCC, page 169-178. IEEE Computer Society, (2007)Lower Bounds for Linear Decision Trees with Bounded Weights., and . SOFSEM, volume 8939 of Lecture Notes in Computer Science, page 412-422. Springer, (2015)Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays., , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 248-259. Springer, (2013)Energy-Efficient Threshold Circuits Computing Mod Functions., , and . CATS, volume 119 of CRPIT, page 105-110. Australian Computer Society, (2011)Competitive Diffusion on Weighted Graphs., , , , , , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 422-433. Springer, (2015)Size, Depth and Energy of Threshold Circuits Computing Parity Function.. ISAAC, volume 181 of LIPIcs, page 54:1-54:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions., and . Theory Comput. Syst., 67 (3): 569-591 (June 2023)