| 2013 | ||
|---|---|---|
| c23 | Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah: On the power of conditional samples in distribution testing. ITCS 2013: 561-580 | |
| c22 | Hana Chockler, Alexander Ivrii, Arie Matsliah, Simone Fulvio Rollini, Natasha Sharygina: Using cross-entropy for satisfiability. SAC 2013: 1196-1203 | |
| 2012 | ||
| j8 | Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah: Monotonicity testing and shortest-path routing on the cube. Combinatorica 32(1): 35-53 (2012) | |
| j7 | Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom: On the query complexity of testing orientations for being Eulerian. ACM Transactions on Algorithms 8(2): 15 (2012) | |
| c21 | Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah: Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. IEEE Conference on Computational Complexity 2012: 148-158 | |
| c20 | Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivny: Relating Proof Complexity Measures and Practical Hardness of SAT. CP 2012: 316-331 | |
| c19 | Jason Baumgartner, Alexander Ivrii, Arie Matsliah, Hari Mony: IC3-guided abstraction. FMCAD 2012: 182-185 | |
| c18 | Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva: On Efficient Computation of Variable MUSes. SAT 2012: 298-311 | |
| c17 | Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah: Perfect Hashing and CNF Encodings of Cardinality Constraints. SAT 2012: 397-409 | |
| c16 | Arie Matsliah, Ashish Sabharwal, Horst Samulowitz: Augmenting Clause Learning with Implied Literals - (Poster Presentation). SAT 2012: 500-501 | |
| i10 | Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf: The non-adaptive query complexity of testing k-parities. CoRR abs/1209.3849 (2012) | |
| i9 | Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah: On the Power of Conditional Samples in Distribution Testing. CoRR abs/1210.8338 (2012) | |
| i8 | Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah: On the Power of Conditional Samples in Distribution Testing. Electronic Colloquium on Computational Complexity (ECCC) 19: 154 (2012) | |
| 2011 | ||
| j6 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011) | |
| c15 | Hana Chockler, Alexander Ivrii, Arie Matsliah, Shiri Moran, Ziv Nevo: Incremental formal verification of hardware. FMCAD 2011: 135-143 | |
| c14 | Sourav Chakraborty, David García-Soriano, Arie Matsliah: Efficient Sample Extractors for Juntas with Applications. ICALP (1) 2011: 545-556 | |
| c13 | Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin: Detecting and exploiting near-sortedness for efficient relational query evaluation. ICDT 2011: 256-267 | |
| c12 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah: Query Complexity Lower Bounds for Reconstruction of Codes. ICS 2011: 264-274 | |
| c11 | Sourav Chakraborty, David García-Soriano, Arie Matsliah: Cycle Detection, Order Finding and Discrete Log with Jumps. ICS 2011: 284-297 | |
| c10 | Sourav Chakraborty, David García-Soriano, Arie Matsliah: Nearly Tight Bounds for Testing Function Isomorphism. SODA 2011: 1683-1702 | |
| 2010 | ||
| j5 | Arie Matsliah, Ofer Strichman: Underapproximation for model-checking based on universal circuits. Inf. Comput. 208(4): 315-326 (2010) | |
| j4 | Harry Buhrman, David García-Soriano, Arie Matsliah: Learning parities in the mistake-bound model. Inf. Process. Lett. 111(1): 16-21 (2010) | |
| j3 | Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. 39(7): 3155-3185 (2010) | |
| c9 | Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah: Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM 2010: 462-475 | |
| c8 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf: New Results on Quantum Property Testing. FSTTCS 2010: 145-156 | |
| i7 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf: New Results on Quantum Property Testing. CoRR abs/1005.0523 (2010) | |
| i6 | David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët: Monotonicity Testing and Shortest-Path Routing on the Cube. Electronic Colloquium on Computational Complexity (ECCC) 17: 48 (2010) | |
| i5 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah: Query Complexity Lower Bounds for Reconstruction of Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 67 (2010) | |
| i4 | Sourav Chakraborty, David García-Soriano, Arie Matsliah: Nearly Tight Bounds for Testing Function Isomorphism. Electronic Colloquium on Computational Complexity (ECCC) 17: 93 (2010) | |
| 2009 | ||
| j2 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. TOCT 1(2) (2009) | |
| c7 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254 | |
| i3 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity. CoRR abs/0902.1255 (2009) | |
| i2 | Harry Buhrman, David García-Soriano, Arie Matsliah: Learning parities in the mistake-bound model. Electronic Colloquium on Computational Complexity (ECCC) 16: 60 (2009) | |
| 2008 | ||
| j1 | ||
| c6 | Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom: On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM 2008: 402-415 | |
| c5 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697 | |
| 2007 | ||
| c4 | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman: Testing st -Connectivity. APPROX-RANDOM 2007: 380-394 | |
| c3 | Arie Matsliah, Ofer Strichman: Underapproximation for Model-Checking Based on Random Cryptographic Constructions. CAV 2007: 339-351 | |
| c2 | Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589 | |
| i1 | Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish: Sound 3-query PCPPs are Long. Electronic Colloquium on Computational Complexity (ECCC) 14(127) (2007) | |
| 2006 | ||
| c1 | ||
Colors in the list of coauthors
Last update Fri May 24 16:24:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page