Longest paths in Planar DAGs in Unambiguous Logspace

Low Ambiguity in Strong, Total, Associative, One-Way Functions

Low-level dichotomy for Quantified Constraint Satisfaction Problems

Lower bound for deterministic semantic-incremental branching programs solving GEN

Lower Bound on Weights of Large Degree Threshold Functions

Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes

Lower bounds for adaptive linearity tests

Lower Bounds for Matrix Product

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

Lower bounds for predecessor searching in the cell probe model

Lower bounds on information complexity via zero-communication protocols and applications

Lower Bounds on Signatures from Symmetric Primitives

Lower Bounds on Testing Functions of Low Fourier Degree

Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps

Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance

Lp Computable Functions and Fourier Series

LSM is not generated by binary functions