Statistics
Publications
14
Citations
315
H-Index
11
Active since
2001
Oded Lachish is an author at Birkbeck, University of London specializing in computer science, algorithms, and computing.
Publications per year
2001–2022
14
14
O(log log Rank) Competitive Ratio for the Matroid Secretary Problem
Oded Lachish · 2014 · 55 citations
Hole analysis for functional coverage data
Oded Lachish, Eitan Marcus, Shmuel Ur et al. · Proceedings - ACM IEEE Design Automation Conference · 2002 · 50 citations
Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits
Oded Lachish, Ran Raz · 2001 · 38 citations
Explicit lower bound of 4.5n - o(n) for Boolean circuits
Oded Lachish, Ran Raz · 2001 · 34 citations
1–5 of 14