Hardness and Algorithms for Rainbow Connectivity (2009)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the...
Hardness and Algorithms for Rainbow Connectivity (2009)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the...
Hardness and Algorithms for Rainbow Connectivity (2009)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the...
Hardness and Algorithms for Rainbow Connectivity (2009)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the...
Hardness and Algorithms for Rainbow Connectivity (2009)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the...
Hardness and Algorithms for Rainbow Connectivity (2009)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph $G$ is {em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {em rainbow connectivity} of a connected graph $G$, denoted...
Underapproximation for Model-Checking Based on Universal Circuits (2008)
Abstract. For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit defines a...
On the Query Complexity of Testing for Eulerian Orientations (2008)
Eldar Fischer, Arie Matsliah, Ilan Newman, Orly Yahalom
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder...
Hardness and Algorithms for Rainbow Connection (2008)
Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael
An edge-colored graph $G$ is {\em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {\em rainbow connection} of a connected graph $G$, denoted...
Approximate Hypergraph Partitioning and Applications (2008)
Eldar Fischer, Arie Matsliah, Asaf Shapira
We show that any partition-problem of hypergraphs has an O(n) time approximate partitioning algorithm and an efficient property tester. This extends the results of Goldreich, Goldwasser and Ron who...
Approximate Hypergraph Partitioning and Applications (2008)
Eldar Fischer, Arie Matsliah, Asaf Shapira
Abstract We show that any partition-problem of hypergraphs has a sublinear O(n) time algorithm(where n is the number of vertices) with the following property: Given an input hypergraph H,which...
Arie Matsliah, Advisor Assoc, Prof Eldar Fischer, Cum Laude, E. Fischer, ...
I am also interested in the actual applications of theoretical concepts, mainly in efficient algorithms for Formal Verification.
Yaniv Altshuler, Arie Matsliah, Ariel Felner
Abstract. As the complexity of systems increases, so does the need of examining the nature of complexity itself. This work discusses the domain of physical swarm problems, in which a swarm of mobile...
Approximate Hypergraph Partitioning and Applications (2008)
Eldar Fischer, Arie Matsliah, Asaf Shapira
We show that any partition-problem of hypergraphs has an O(n) time approximate partitioning algorithm and an efficient property tester. This extends the results of Goldreich, Goldwasser and Ron who...
Testing st-connectivity (2007)
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
We continue the study, started in [9], of property testing of graphs in the orientation model. A major question which was left open in [9] is whether the property of st-connectivity can be tested...
Testing st-connectivity (2007)
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
Abstract. We continue the study, started in [9], of property testing of graphs in the orientation model. A major question which was left open in [9] is whether the property of st-connectivity can be...
Underapproximation for model-checking based on random cryptographic constructions (2007)
Abstract. For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit defines a...
Sound 3-query PCPPs are long (2007)
Eli Ben-sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah, Shalom Foundations
We initiate the study of the tradeoff between the length of a probabilistically checkable proof of proximity (PCPP) and the maximal soundness that can be guaranteed by a 3-query verifier with oracle...
Testing st-connectivity (2007)
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
We continue the study, started in [9], of property testing of graphs in the orientation model. A major question which was left open in [9] is whether the property of st-connectivity can be tested...
Sound 3-query PCPPs are long (2007)
Eli Ben-sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah, Shalom Foundations
We initiate the study of the tradeoff between the length of a probabilistically checkable proof of proximity (PCPP) and the maximal soundness that can be guaranteed by a 3-query verifier with oracle...
Sound 3-query PCPPs are long (2007)
Eli Ben-sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah, Shalom Foundations
We initiate the study of the tradeoff between the length of a probabilistically checkable proof of proximity (PCPP) and the maximal soundness that can be guaranteed by a 3-query verifier with oracle...
Testing Graph Isomorphism (2006)
Abstract We deal with the question of how many queries arerequired to distinguish between the case that two graphs G and H on n vertices are isomorphic, and the case thatthey are s^-far, that is they...
Testing Graph Isomorphism (2006)
Two graphs G and H on n vertices are ɛ-far from being isomorphic if at least ɛ � � n 2 edges must be added or removed from E(G) in order to make G and H isomorphic. In this paper we deal with...