51 citations · 94 across the 11 of their papers we have counts for
12 papers
Sampling and Certifying Symmetric Functions
Yuval Filmus, Itai Leigh, Artur Riazanov +1
A circuit samples a distribution with an error if the statistical distance between the output of on the uniform input and …
Top-Down Lower Bounds for Depth-Four Circuits
Mika Göös, Artur Riazanov, Anastasia Sofronova +1
We present a top-down lower-bound method for depth- boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth- cir…
Practical lowest distortion mapping
Vladimir Garanzha, Igor Kaporin, Liudmila Kudryavtseva +3
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minim…
Foldover-free maps in 50 lines of code
Vladimir Garanzha, Igor Kaporin, Liudmila Kudryavtseva +3
Mapping a triangulated surface to 2D space (or a tetrahedral mesh to 3D space) is the most fundamental problem in geometry processing.In computational physics, untangling plays an…
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
Susanna F. de Rezende, Jakob Nordström, Kilian Risse +1
We show exponential lower bounds on resolution proof length for pigeonhole principle (PHP) formulas and perfect matching formulas over highly unbalanced, sparse expander graphs, th…
Anti-aliasing for fused filament deposition
Hai-Chuan Song, Nicolas Ray, Dmitry Sokolov +1
Layered manufacturing inherently suffers from staircase defects along surfaces that are gently slopped with respect to the build direction. Reducing the slice thickness improves th…