![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Arie Matsliah
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j12]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. SIAM J. Comput. 45(4): 1261-1296 (2016) - 2014
- [j11]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. Theory Comput. 10: 515-533 (2014) - 2013
- [j10]Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j9]Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano
, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. SIAM J. Comput. 42(2): 459-493 (2013) - [c24]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the power of conditional samples in distribution testing. ITCS 2013: 561-580 - [c23]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. Comb. 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 Trans. Algorithms 8(2): 15:1-15:41 (2012) - [c22]Sourav Chakraborty, Eldar Fischer, David García-Soriano
, Arie Matsliah:
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. CCC 2012: 148-158 - [c21]Matti Järvisalo
, Arie Matsliah, Jakob Nordström
, Stanislav Zivný:
Relating Proof Complexity Measures and Practical Hardness of SAT. CP 2012: 316-331 - [c20]Jason Baumgartner, Alexander Ivrii, Arie Matsliah, Hari Mony:
IC3-guided abstraction. FMCAD 2012: 182-185 - [c19]Hana Chockler, Alexander Ivrii, Arie Matsliah:
Computing Interpolants without Proofs. Haifa Verification Conference 2012: 72-85 - [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 - [i11]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) - [i10]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. CoRR abs/1210.8338 (2012) - [i9]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. Electron. Colloquium Comput. Complex. TR12 (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 - [i8]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. CoRR abs/1005.0523 (2010) - [i7]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i6]Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. Electron. Colloquium Comput. Complex. TR10 (2010) - [i5]David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët:
Monotonicity Testing and Shortest-Path Routing on the Cube. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j2]Eli Ben-Sasson, Prahladh Harsha
, Oded Lachish
, Arie Matsliah:
Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory 1(2): 7:1-7:49 (2009) - [c7]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254 - [i4]Harry Buhrman, David García-Soriano, Arie Matsliah:
Learning Parities in the Mistake-Bound model. Algebraic Methods in Computational Complexity 2009 - [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. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [b1]Arie Matsliah:
Property testing and combinatorial approximation. Technion - Israel Institute of Technology, Israel, 2008 - [j1]Eldar Fischer, Arie Matsliah:
Testing Graph Isomorphism. SIAM J. Comput. 38(1): 207-225 (2008) - [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. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c1]Eldar Fischer, Arie Matsliah:
Testing graph isomorphism. SODA 2006: 299-308
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint