The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eldar Fischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eldar Fischer, Lance Fortnow
    Tolerant Versus Intolerant Testing for Boolean Properties. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:135-140 [Conf]
  2. Eldar Fischer, Ilan Newman
    Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:73-79 [Conf]
  3. Eldar Fischer, Johann A. Makowsky
    The Specker-Blatter Theorem Revisited. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:90-101 [Conf]
  4. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
    Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:656-666 [Conf]
  5. Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
    Testing Random Variables for Independence and Identity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:442-451 [Conf]
  6. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing Juntas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:103-112 [Conf]
  7. Eldar Fischer, Frédéric Magniez, Michel de Rougemont
    Approximate Satisfiability and Equivalence. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:421-430 [Conf]
  8. Eldar Fischer
    Testing graphs for colorable properties. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:873-882 [Conf]
  9. Eldar Fischer, Arie Matsliah
    Testing graph isomorphism. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:299-308 [Conf]
  10. Eldar Fischer, Orly Yahalom
    Testing Convexity Properties of Tree Colorings. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:109-120 [Conf]
  11. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:29-40 [Conf]
  12. Eldar Fischer
    The difficulty of testing for isomorphism against a graph that is given in advance. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:391-397 [Conf]
  13. Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
    Monotonicity testing over general poset domains. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:474-483 [Conf]
  14. Eldar Fischer, Ilan Newman
    Testing of matrix properties. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:286-295 [Conf]
  15. Eldar Fischer, Ilan Newman
    Testing versus estimation of graph properties. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:138-146 [Conf]
  16. 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]
  17. Noga Alon, Eldar Fischer
    Refining the Graph Density Condition for the Existence of Almost K-factors. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:52, n:, pp:- [Journal]
  18. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
    Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:451-476 [Journal]
  19. Eldar Fischer
    Induced Complete h-partite Graphs in Dense Clique-less Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  20. Eldar Fischer
    The Art of Uninformed Decisions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:75, n:, pp:97- [Journal]
  21. Eldar Fischer
    Testing graphs for colorability properties [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:83, pp:- [Journal]
  22. Eldar Fischer
    On the strength of comparisons in property testing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:8, pp:- [Journal]
  23. Eldar Fischer, Frédéric Magniez, Michel de Rougemont
    Property and Equivalence Testing on Strings [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:096, pp:- [Journal]
  24. Eldar Fischer, Lance Fortnow
    Tolerant Versus Intolerant Testing for Boolean Properties [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:105, pp:- [Journal]
  25. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:66, pp:- [Journal]
  26. Eldar Fischer
    On the strength of comparisons in property testing. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:1, pp:107-116 [Journal]
  27. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing juntas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:753-787 [Journal]
  28. Noga Alon, Eldar Fischer, Mario Szegedy
    Parent-Identifying Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:2, pp:349-359 [Journal]
  29. Eldar Fischer
    The Specker-Blatter theorem does not hold for quaternary relations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:103, n:1, pp:121-136 [Journal]
  30. Eldar Fischer
    Testing graphs for colorability properties. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:289-309 [Journal]
  31. Eldar Fischer, Ilan Newman, Jiri Sgall
    Functions that have read-twice constant width branching programs are not necessarily testable. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:2, pp:175-193 [Journal]
  32. Eldar Fischer
    The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1147-1158 [Journal]
  33. Eldar Fischer, Ilan Newman
    Testing versus Estimation of Graph Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:482-501 [Journal]
  34. Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
    Testing st -Connectivity. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:380-394 [Conf]
  35. Eldar Fischer, Eyal Rozenberg
    Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:464-478 [Conf]
  36. Eldar Fischer
    Cycle factors in dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:309-323 [Journal]
  37. Noga Alon, Eldar Fischer
    2-factors in dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:13-23 [Journal]
  38. Noga Alon, Eldar Fischer, Ilan Newman
    Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:959-976 [Journal]

  39. On the Query Complexity of Testing Orientations for Being Eulerian. [Citation Graph (, )][DBLP]


  40. Linear Recurrence Relations for Graph Polynomials. [Citation Graph (, )][DBLP]


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


  42. Two-phase Algorithms for the Parametric Shortest Path Problem. [Citation Graph (, )][DBLP]


  43. Hardness and Algorithms for Rainbow Connectivity. [Citation Graph (, )][DBLP]


  44. Testing of matrix-poset properties. [Citation Graph (, )][DBLP]


  45. Hardness and Algorithms for Rainbow Connectivity [Citation Graph (, )][DBLP]


  46. Two-phase algorithms for the parametric shortest path problem [Citation Graph (, )][DBLP]


  47. New Results on Quantum Property Testing [Citation Graph (, )][DBLP]


  48. Counting truth assignments of formulas of bounded tree-width or clique-width. [Citation Graph (, )][DBLP]


  49. Testing Convexity Properties of Tree Colorings. [Citation Graph (, )][DBLP]


Search in 0.722secs, Finished in 0.723secs
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