Stathis Zachos (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Stathis Zachos" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
207th place
136th place
6th place
6th place

archive.org

doi.org

  • Zachos, Stathis (1982). "Robustness of probabilistic computational complexity classes under definitional perturbations". Information and Control. 54 (3): 143–154. doi:10.1016/s0019-9958(82)80019-3.
  • Zachos, Stathis; Hans Heller (1986). "A decisive characterization of BPP". Information and Control. 69 (1–3): 125–135. doi:10.1016/s0019-9958(86)80044-4.
  • Zachos, Stathis; Martin Fürer (1987). "Probabilistic quantifiers vs. Distrustful adversaries". Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 287. pp. 443–455. doi:10.1007/3-540-18625-5_67. ISBN 978-3-540-18625-0.
  • Boppana, Ravi B.; Hastad, Johan; Zachos, Stathis (6 May 1987). "Does co-NP have short interactive proofs?". Information Processing Letters. 25 (2): 127–132. doi:10.1016/0020-0190(87)90232-8.
  • Papadimitriou, Christos H.; Stathis Zachos (1982). "Two remarks on the power of counting". Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 145. pp. 269–276. doi:10.1007/BFb0009651 (inactive 2024-06-22). ISBN 978-3-540-11973-9. {{cite book}}: |journal= ignored (help)CS1 maint: DOI inactive as of June 2024 (link)
  • Zachos, Stathis (1988). "Probabilistic quantifiers and games". Journal of Computer and System Sciences. 36 (3): 433–451. doi:10.1016/0022-0000(88)90037-2.

psu.edu

citeseerx.ist.psu.edu

  • Fürer, Martin; Oded Goldreich; Yishay Mansour; Michael Sipser; Stathis Zachos (1989). "On completeness and soundness in interactive proof systems". Advances in Computing Research: Randomness and Computation. 5: 25–32. CiteSeerX 10.1.1.39.9412.