|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom |
On the query complexity of testing orientations for being Eulerian.  |
ACM Transactions on Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and algorithms for rainbow connection. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, David García-Soriano, Arie Matsliah |
Nearly Tight Bounds for Testing Function Isomorphism. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, David García-Soriano, Arie Matsliah |
Efficient Sample Extractors for Juntas with Applications. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, David García-Soriano, Arie Matsliah |
Cycle Detection, Order Finding and Discrete Log with Jumps. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah |
Query Complexity Lower Bounds for Reconstruction of Codes. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, David García-Soriano, Arie Matsliah |
Learning parities in the mistake-bound model. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah |
Query Complexity Lower Bounds for Reconstruction of Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, David García-Soriano, Arie Matsliah |
Nearly Tight Bounds for Testing Function Isomorphism. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Arie Matsliah, Ofer Strichman |
Underapproximation for model-checking based on universal circuits. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah, Asaf Shapira |
Approximate Hypergraph Partitioning and Applications. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah |
Monotonicity Testing and Shortest-Path Routing on the Cube. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
Sound 3-Query PCPPs Are Long. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, David García-Soriano, Arie Matsliah |
Learning parities in the mistake-bound model. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah |
Testing Graph Isomorphism. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
Sound 3-Query PCPPs Are Long. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom |
On the Query Complexity of Testing Orientations for Being Eulerian. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish |
Sound 3-query PCPPs are Long. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Arie Matsliah, Ofer Strichman |
Underapproximation for Model-Checking Based on Random Cryptographic Constructions. |
CAV |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman |
Testing st -Connectivity. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah, Asaf Shapira |
Approximate Hypergraph Partitioning and Applications. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah |
Testing graph isomorphism. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")