The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Asaf Shapira: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oded Lachish, Ilan Newman, Asaf Shapira
    Space Complexity vs. Query Complexity. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:426-437 [Conf]
  2. Noga Alon, Asaf Shapira
    A Characterization of the (natural) Graph Properties Testable with One-Sided Error. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:429-438 [Conf]
  3. Noga Alon, Asaf Shapira, Benny Sudakov
    Additive Approximation for Edge-Deletion Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:419-428 [Conf]
  4. Noga Alon, Asaf Shapira, Benny Sudakov
    Additive Approximation for Edge-Deletion Problems (Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:1-2 [Conf]
  5. Noga Alon, Asaf Shapira
    Testing satisfiability. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:645-654 [Conf]
  6. Noga Alon, Asaf Shapira
    A characterization of easily testable induced subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:942-951 [Conf]
  7. Noga Alon, Asaf Shapira
    Linear equations, arithmetic progressions and hypergraph property testing. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:708-717 [Conf]
  8. Noga Alon, Asaf Shapira
    Testing subgraphs in directed graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:700-709 [Conf]
  9. Noga Alon, Asaf Shapira
    Every monotone graph property is testable. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:128-137 [Conf]
  10. Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
    A combinatorial characterization of the testable graph properties: it's all about regularity. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:251-260 [Conf]
  11. Asaf Shapira, Noga Alon
    Homomorphisms in Graph Property Testing - A Survey [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:085, pp:- [Journal]
  12. Noga Alon, Asaf Shapira
    Testing satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:2, pp:87-103 [Journal]
  13. Noga Alon, Asaf Shapira
    Testing subgraphs in directed graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:354-382 [Journal]
  14. Noga Alon, Asaf Shapira, Uri Stav
    Can a Graph Have Distinct Regular Partitions? [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:428-438 [Conf]
  15. Asaf Shapira, Raphael Yuster, Uri Zwick
    All-pairs bottleneck paths in vertex weighted graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:978-985 [Conf]
  16. Noga Alon, Oded Schwartz, Asaf Shapira
    An elementary construction of constant-degree expanders. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:454-458 [Conf]
  17. Noga Alon, Asaf Shapira
    On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:6, pp:627-645 [Journal]

  18. Approximate Hypergraph Partitioning and Applications. [Citation Graph (, )][DBLP]


  19. All-Pairs Shortest Paths with a Sublinear Additive Error. [Citation Graph (, )][DBLP]


  20. The effect of induced subgraphs on quasi-randomness. [Citation Graph (, )][DBLP]


  21. Every minor-closed property of sparse graphs is testable. [Citation Graph (, )][DBLP]


  22. Green's conjecture and testing linear-invariant properties. [Citation Graph (, )][DBLP]


  23. A Note on Maximizing the Spread of Influence in Social Networks. [Citation Graph (, )][DBLP]


  24. Space Complexity Vs. Query Complexity. [Citation Graph (, )][DBLP]


  25. A separation theorem in property testing. [Citation Graph (, )][DBLP]


  26. Quasi-randomness and the distribution of copies of a fixed graph. [Citation Graph (, )][DBLP]


  27. Finding Cycles and Trees in Sublinear Time [Citation Graph (, )][DBLP]


  28. A Characterization of Easily Testable Induced Subgraphs. [Citation Graph (, )][DBLP]


  29. An Elementary Construction of Constant-Degree Expanders. [Citation Graph (, )][DBLP]


  30. Every Minor-Closed Property of Sparse Graphs is Testable. [Citation Graph (, )][DBLP]


  31. Testing the Expansion of a Graph. [Citation Graph (, )][DBLP]


  32. Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. [Citation Graph (, )][DBLP]


  33. An Elementary Construction of Constant-Degree Expanders. [Citation Graph (, )][DBLP]


  34. Space Complexity vs. Query Complexity. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002