| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The quasi-randomness of hypergraph cut properties. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Kintali, Asaf Shapira |
A Note on the Balanced ST-Connectivity |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira |
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. |
SIAM J. Discrete Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
Testing odd-cycle-freeness in Boolean functions. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eyal Even-Dar, Asaf Shapira |
A note on maximizing the spread of influence in social networks. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Asaf Shapira |
Sublinear Time Algorithms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
Testing Odd-Cycle-Freeness in Boolean Functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster, Uri Zwick |
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Asaf Shapira |
All-pairs shortest paths with a sublinear additive error. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
Testing Odd-Cycle-Freeness in Boolean Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Asaf Shapira |
Sublinear Time Algorithms. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin P. Costello, Asaf Shapira, Prasad Tetali |
Randomized greedy: new variants of some classic approximation algorithms. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira |
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
On the density of a graph and its blowup. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira |
A Unified Framework for Testing Linear-Invariant Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Asaf Nachmias, Asaf Shapira |
Testing the expansion of a graph. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira |
A Unified Framework for Testing Linear-Invariant Properties |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time |
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 | Asaf Shapira |
Green's Conjecture and Testing Linear Invariant Properties. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira |
A Unified Framework for Testing Linear-Invariant Properties. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira, Uri Stav |
Can a Graph Have Distinct Regular Partitions? |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Asaf Shapira, Christian Sohler |
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira |
Green's conjecture and testing linear-invariant properties. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
hypergraphs removal lemma, boolean functions, property testing |
| 1 | Itai Benjamini, Oded Schramm, Asaf Shapira |
Every Minor-Closed Property of Sparse Graphs is Testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Oded Schwartz, Asaf Shapira |
An Elementary Construction of Constant-Degree Expanders. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
A separation theorem in property testing. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05D99, 05C35, 68R05 |
| 1 | Asaf Shapira |
Quasi-randomness and the distribution of copies of a fixed graph. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Lachish, Ilan Newman, Asaf Shapira |
Space Complexity Vs. Query Complexity. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q15, 68Q10 |
| 1 | Noga Alon, Asaf Shapira |
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
Every Monotone Graph Property Is Testable. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Asaf Shapira |
All-Pairs Shortest Paths with a Sublinear Additive Error. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Benjamini, Oded Schramm, Asaf Shapira |
Every minor-closed property of sparse graphs is testable. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
minor closed properties, graph algorithms, property testing |
| 1 | Asaf Nachmias, Asaf Shapira |
Testing the Expansion of a Graph. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Artur Czumaj, Asaf Shapira, Christian Sohler |
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster, Uri Zwick |
All-pairs bottleneck paths in vertex weighted graphs. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Oded Schwartz, Asaf Shapira |
An elementary construction of constant-degree expanders. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Even-Dar, Asaf Shapira |
A Note on Maximizing the Spread of Influence in Social Networks. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira, Uri Stav |
Can a Graph Have Distinct Regular Partitions? |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah, Asaf Shapira |
Approximate Hypergraph Partitioning and Applications. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Oded Schwartz, Asaf Shapira |
An Elementary Construction of Constant-Degree Expanders. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Oded Lachish, Ilan Newman, Asaf Shapira |
Space Complexity vs. Query Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
A Characterization of Easily Testable Induced Subgraphs. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C65, 05D99 |
| 1 | Noga Alon, Asaf Shapira, Benny Sudakov |
Additive Approximation for Edge-Deletion Problems (Abstract). |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Lachish, Ilan Newman, Asaf Shapira |
Space Complexity vs. Query Complexity. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
A combinatorial characterization of the testable graph properties: it's all about regularity. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
characterization, property testing, regularity lemma |
| 1 | Asaf Shapira, Noga Alon |
Homomorphisms in Graph Property Testing - A Survey |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. |
Theory of Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
Linear equations, arithmetic progressions and hypergraph property testing. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira, Benny Sudakov |
Additive Approximation for Edge-Deletion Problems. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
A Characterization of the (natural) Graph Properties Testable with One-Sided Error. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
Every monotone graph property is testable. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
monotone properties, property testing, regularity lemma |
| 1 | Noga Alon, Asaf Shapira |
Testing subgraphs in directed graphs. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
A characterization of easily testable induced subgraphs. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
Testing satisfiability. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira |
Testing subgraphs in directed graphs. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
directed graphs, property testing, regularity lemma |
| 1 | Noga Alon, Asaf Shapira |
Testing satisfiability. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")