Oded Lachish - RankMe

79 papers A* 8A 5B 10C 2Journal 44Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	A Practical Algorithm for 3-Admissibility. SOFSEM Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2026	B	`conf`	Counting Large Patterns in Degenerate Graphs. SOFSEM Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2026	B	`conf`	Efficient Trace Frequency Queries in Sparse Graphs. SOFSEM Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2025	B	`conf`	A Practical Algorithm for 2-Admissibility. SEA Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	A practical algorithm for 2-admissibility. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	A practical algorithm for 3-admissibility. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl
2025	J	`jnl`	Counting large patterns in degenerate graphs. CoRR Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	Efficient Trace Frequency Queries in Sparse Graphs. CoRR Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2025	J	`jnl`	Minimizers in Semi-Dynamic Strings. CoRR Wiktor Zuba, Oded Lachish, Solon P. Pissis
2025	B	`conf`	Minimizers in Semi-dynamic Strings. FCT Wiktor Zuba, Oded Lachish, Solon P. Pissis
2025	A	`conf`	Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. STACS Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025	B	`conf`	Shortest Undirected Paths in de Bruijn Graphs. CPM Wiktor Zuba, Oded Lachish, Solon P. Pissis
2025	A*	`conf`	Testing C_k-Freeness in Bounded Admissibility Graphs. ICALP Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl
2025	C	`conf`	Testing Quasiperiodicity. SPIRE Christine Awofeso, Ben Bals, Oded Lachish, Solon P. Pissis
2025	J	`jnl`	Testing Quasiperiodicity. CoRR Christine Awofeso, Ben Bals, Oded Lachish, Solon P. Pissis
2023	J	`jnl`	A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification. SIAM J. Comput. Marcel Dall'Agnol, Tom Gur, Oded Lachish
2022	J	`jnl`	Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version). CoRR Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen
2022	J	`jnl`	Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs. Proc. VLDB Endow. Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen
2022	—	`conf`	When You Come at the King You Best Not Miss. FSTTCS Oded Lachish, Felix Reidl, Chhaya Trehan
2022	J	`jnl`	When you come at the kings you best not miss. CoRR Oded Lachish, Felix Reidl, Chhaya Trehan
2021	A*	`conf`	A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. SODA Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish
2021	J	`jnl`	On the Power of Relaxed Local Decoding Algorithms. SIAM J. Comput. Tom Gur, Oded Lachish
2020	J	`jnl`	A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. CoRR Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish
2020	J	`jnl`	A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. Electron. Colloquium Comput. Complex. Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish
2020	A*	`conf`	On the Power of Relaxed Local Decoding Algorithms. SODA Tom Gur, Oded Lachish
2019	J	`jnl`	A Lower Bound for Relaxed Locally Decodable Codes. CoRR Tom Gur, Oded Lachish
2019	J	`jnl`	A Lower Bound for Relaxed Locally Decodable Codes. Electron. Colloquium Comput. Complex. Tom Gur, Oded Lachish
2019	J	`jnl`	Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica Eldar Fischer, Oded Lachish, Yadu Vasudev
2019	J	`jnl`	Longest paths in 2-edge-connected cubic graphs. CoRR Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl
2017	J	`jnl`	Cellular Automata Simulation on FPGA for Training Neural Networks with Virtual World Imagery. CoRR Olivier Van Acker, Oded Lachish, Graeme Burnett
2017	—	`conf`	Cellular automata simulation on FPGA for training neural networks with virtual world imagery. CIG Olivier Van Acker, Oded Lachish, Graeme Burnett
2017	A	`conf`	Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS Eldar Fischer, Oded Lachish, Yadu Vasudev
2016	J	`jnl`	Improving and extending the testing of distributions for shape-restricted properties. CoRR Eldar Fischer, Oded Lachish, Yadu Vasudev
2016	J	`jnl`	Min-Sum 2-Paths Problems. Theory Comput. Syst. Trevor I. Fenner, Oded Lachish, Alexandru Popa
2016	J	`jnl`	Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs. CoRR Oded Lachish, Igor Razgon
2016	J	`jnl`	Testing Read-Once Formula Satisfaction. ACM Trans. Comput. Theory Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2015	A*	`conf`	Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	Trading query complexity for sample-based testing and multi-testing scalability. CoRR Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. Eldar Fischer, Oded Lachish, Yadu Vasudev
2014	A*	`conf`	O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. FOCS Oded Lachish
2014	J	`jnl`	O(log log rank) Competitive-Ratio for the Matroid Secretary Problem. CoRR Oded Lachish
2014	A	`conf`	Partial tests, universal tests and decomposability. ITCS Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2013	B	`conf`	Analysis of Cluster Structure in Large-Scale English Wikipedia Category Networks. IDA Thidawan Klaysri, Trevor I. Fenner, Oded Lachish, Mark Levene, Panagiotis Papapetrou
2013	B	`conf`	Min-Sum 2-Paths Problems. WAOA Trevor I. Fenner, Oded Lachish, Alexandru Popa
2013	J	`jnl`	Some properties are not even partially testable. CoRR Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2013	J	`jnl`	Some properties are not even partially testable. Electron. Colloquium Comput. Complex. Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2013	J	`jnl`	The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
2012	A*	`conf`	Improved competitive ratio for the matroid secretary problem. SODA Sourav Chakraborty, Oded Lachish
2012	J	`jnl`	On the query complexity of testing orientations for being Eulerian. ACM Trans. Algorithms Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom
2012	J	`jnl`	Testing Formula Satisfaction CoRR Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2012	—	`conf`	Testing Formula Satisfaction. SWAT Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2011	B	`conf`	Parity Games on Graphs with Medium Tree-Width. MFCS John Fearnley, Oded Lachish
2011	J	`jnl`	Testing Periodicity. Algorithmica Oded Lachish, Ilan Newman
2010	A	`conf`	Two-phase Algorithms for the Parametric Shortest Path Problem. STACS Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster
2010	J	`jnl`	Two-phase algorithms for the parametric shortest path problem CoRR Eldar Fischer, Oded Lachish, Raphael Yuster
2009	B	`conf`	Hilbert's Thirteenth Problem and Circuit Complexity. ISAAC Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen
2009	C	`conf`	Power Indices in Spanning Connectivity Games. AAIM Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani
2009	J	`jnl`	Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
2009	J	`jnl`	Spanning connectivity games CoRR Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani
2009	—	`conf`	The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
2009	—	`conf`	Wiretapping a Hidden Network. WINE Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani
2009	J	`jnl`	Wiretapping a hidden network CoRR Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani
2008	—	`conf`	On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom
2008	—	`conf`	Sound 3-Query PCPPs Are Long. ICALP (1) Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
2008	J	`jnl`	Space Complexity Vs. Query Complexity. Comput. Complex. Oded Lachish, Ilan Newman, Asaf Shapira
2007	J	`jnl`	Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. Oren Ben-Zwi, Oded Lachish, Ilan Newman
2007	J	`jnl`	Sound 3-query PCPPs are Long. Electron. Colloquium Comput. Complex. Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish
2007	—	`conf`	Testing APPROX-RANDOM Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
2007	A	`conf`	Testing Properties of Constraint-Graphs. CCC Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
2007	J	`jnl`	Testing Properties of Constraint-Graphs. Electron. Colloquium Comput. Complex. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
2006	—	`conf`	Space Complexity vs. Query Complexity. APPROX-RANDOM Oded Lachish, Ilan Newman, Asaf Shapira
2006	J	`jnl`	Space Complexity vs. Query Complexity. Electron. Colloquium Comput. Complex. Oded Lachish, Ilan Newman, Asaf Shapira
2005	J	`jnl`	Languages that are Recognized by Simple Counter Automata are not necessarily Testable Electron. Colloquium Comput. Complex. Oded Lachish, Ilan Newman
2005	J	`jnl`	Testing Orientation Properties Electron. Colloquium Comput. Complex. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
2005	—	`conf`	Testing Periodicity. APPROX-RANDOM Oded Lachish, Ilan Newman
2004	J	`jnl`	Testing Periodicity Electron. Colloquium Comput. Complex. Oded Lachish, Ilan Newman
2002	A*	`conf`	Hole analysis for functional coverage data. DAC Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv
2001	A*	`conf`	Explicit lower bound of STOC Oded Lachish, Ran Raz