Skip to main content
SpringerLink
Log in

Stathis Zachos at 70!

  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10236))

Included in the following conference series:

  • 1365 Accesses

Abstract

This year we are celebrating the 70th birthday of Stathis! We take this chance to recall some of his remarkable contributions to Computer Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In Smullyan’s book To mock a mockingbird [31], combinator S is called the starling.

References

  1. Babai, L.: Graph isomorphism in quasipolynomial time (extended abstract). In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18–21 June 2016, pp. 684–697. ACM (2016)

    Google Scholar 

  2. Bakali, E., Chalki, A., Pagourtzis, A., Pantavos, P., Zachos, S.: Completeness results for counting problems with easy decision. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 55–66. Springer, Cham (2017)

    Google Scholar 

  3. Bampas, E., Göbel, A.-N., Pagourtzis, A., Tentes, A.: On the connection between interval size functions and path counting. Comput. Complex. (2016). doi:10.1007/s00037-016-0137-8

  4. Bampas, E., Pagourtzis, A., Pierrakos, G., Potika, K.: On a noncooperative model for wavelength assignment in multifiber optical networks. IEEE/ACM Trans. Netw. 20(4), 1125–1137 (2012)

    Article  MATH  Google Scholar 

  5. Bampas, E., Pagourtzis, A., Pierrakos, G., Syrgkanis, V.: Selfish resource allocation in optical networks. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 25–36. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38233-8_3

    Chapter  Google Scholar 

  6. Bar-Noy, A., Cheilaris, P., Lampis, M., Mitsou, V., Zachos, S.: Ordered coloring of grids and related graphs. Theoret. Comput. Sci. 444, 40–51 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Beigel, R., Gill, J.: Counting classes: thresholds, parity, mods, and fewness. Theor. Comput. Sci. 103(1), 3–23 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Boppana, R.B., Håstad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25(2), 127–132 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cheilaris, P., Ramirez, J., Zachos, S.: Checking in linear time if an \(S\)-term normalizes. In: Proceedings of the 8th Panhellenic Logic Symposium (2011)

    Google Scholar 

  10. Cheilaris, P., Specker, E., Zachos, S.: Neochromatica. Commentationes Math. Univ. Carol. 51(3), 469–480 (2010)

    MathSciNet  MATH  Google Scholar 

  11. Fragoudakis, C., Markou, E., Zachos, S.: Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom.: Theory Appl. 38(3), 170–180 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fürer, M., Goldreich, O., Mansour, Y., Sipser, M., Zachos, S.: On completeness and soundness in interactive proof systems. Adv. Comput. Res. 5, 249–442 (1989)

    Google Scholar 

  13. Hemaspaandra, L.A., Homan, C.M., Kosub, S., Wagner, K.W.: The complexity of computing the size of an interval. SIAM J. Comput. 36(5), 1264–1300 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kiayias, A., Pagourtzis, A., Sharma, K., Zachos, S.: Acceptor-definable counting classes. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds.) PCI 2001. LNCS, vol. 2563, pp. 453–463. Springer, Heidelberg (2003). doi:10.1007/3-540-38076-0_29

    Chapter  Google Scholar 

  15. Kiayias, A., Pagourtzis, A., Zachos, S.: Cook reductions blur structural differences between functional complexity classes. In: Proceedings of the 2nd Panhellenic Logic Symposium, Delphi, 13–17 July 1999, pp. 132–137 (1999)

    Google Scholar 

  16. Koutras, C.D., Koletsos, G., Zachos, S.: Many-valued modal non-monotonic reasoning: sequential stable sets and logics with linear truth spaces. Fundam. Inform. 38(3), 281–324 (1999)

    MathSciNet  MATH  Google Scholar 

  17. Koutras, C.D., Zachos, S.: Many-valued reflexive autoepistemic logic. Logic J. IGPL 8(1), 33–54 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Markou, E., Fragoudakis, C., Zachos, S.: Approximating visibility problems within a constant. In: Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 91–103 (2002)

    Google Scholar 

  19. Markou, E., Zachos, S., Fragoudakis, C.: Maximizing the guarded boundary of an Art Gallery is APX-complete. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 24–35. Springer, Heidelberg (2003). doi:10.1007/3-540-44849-7_10

    Chapter  Google Scholar 

  20. Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Fiber cost reduction and wavelength minimization in multifiber WDM networks. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 150–161. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24693-0_13

    Google Scholar 

  21. Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Netw. 50(1), 1–14 (2006)

    Article  MATH  Google Scholar 

  22. Nomikos, C., Pagourtzis, A., Zachos, S.: Routing and path multicoloring. Inf. Process. Lett. 80(5), 249–256 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2003), San Franciso, CA, USA, 30 March–3 April 2003. IEEE (2003)

    Google Scholar 

  24. Nomikos, C., Pagourtzis, A., Zachos, S.: Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Netw. 42(1), 55–63 (2003)

    Article  MATH  Google Scholar 

  25. Nomikos, C., Pagourtzis, A., Zachos, S.: Randomized and approximation algorithms for blue-red matching. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 715–725. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74456-6_63

    Chapter  Google Scholar 

  26. Pagourtzis, A., Potika, K., Zachos, S.: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3), 255–274 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  27. Pagourtzis, A., Sharma, K., Zachos, S.: Tree models, probabilistic polynomial time computations. In: Lin, X. (ed.) Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS 1998). Australian Computer Science Communications, vol. 20, pp. 291–304. Springer-Verlag Singapore Pte. Ltd., Singapore (1998)

    Google Scholar 

  28. Pagourtzis, A., Zachos, S.: The complexity of counting functions with easy decision version. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 741–752. Springer, Heidelberg (2006). doi:10.1007/11821069_64

    Chapter  Google Scholar 

  29. Papadimitriou, C.H., Zachos, S.K.: Two remarks on the power of counting. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 269–275. Springer, Heidelberg (1982). doi:10.1007/BFb0036487

    Chapter  Google Scholar 

  30. Papaspyrou, N.S., Zachos, S.: Teaching programming through problem solving: the role of the programming language. In: Proceedings of the 4th Workshop on Advances in Programming Languages (WAPL 2013), Federated Conference on Computer Science and Information Systems (FedCSIS 2013), pp. 1533–1536, Kraków, Poland, September 2013

    Google Scholar 

  31. Smullyan, R.: To Mock a Mockingbird and Other Logic Puzzles Including an Amazing Adventure in Combinatory Logic. Knopf, New York (1985)

    Google Scholar 

  32. Waldmann, J.: The combinator \(S\). Inf. Comput. 159, 2–21 (2000)

    Article  MATH  Google Scholar 

  33. Zachos, S.: Kombinatorische Logik und \(S\)-Terme. Ph.D. thesis, ETH Zürich (1978)

    Google Scholar 

  34. Zachos, S.: Robustness of probabilistic computational complexity classes under definitional perturbations. Inf. Control 54(3), 143–154 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  35. Zachos, S., Furer, M.: Probabilistic quantifiers vs. distrustful adversaries. In: Nori, K.V. (ed.) FSTTCS 1987. LNCS, vol. 287, pp. 443–455. Springer, Heidelberg (1987). doi:10.1007/3-540-18625-5_67

    Chapter  Google Scholar 

  36. Zachos, S., Heller, H.: A decisive characterization of BPP. Inf. Control 69(1–3), 125–135 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We would like to apologize to numerous friends and colleagues of Stathis that would deserve to appear in this article if time and space permitted. We are grateful to them for being part of this great community, influencing Stathis and all of us in so many positive ways.

We are also thankful to all Stathis’s family members we have met—including those, fondly remembered and greatly missed, who are not with us anymore—for their tolerance, support and friendship throughout so many, long-lasting research and social meetings in their house in Lycabettus and, of course, in Kinetta.

Author information

Authors and Affiliations

  1. School of Electrical and Computer Engineering, National Technical University of Athens, 15780, Athens, Greece

    Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Aris Pagourtzis & Nikolaos S. Papaspyrou

  2. Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802, USA

    Martin Fürer

  3. Department of Informatics and Telecommunications, University of Peloponnese, 22100, Tripoli, Hellas

    Costas D. Koutras

  4. Department of Computer Science and Biomedical Informatics, University of Thessaly, 35100, Lamia, Greece

    Euripides Markou

  5. Department of Computer Science and Engineering, University of Ioannina, 45110, Ioannina, Greece

    Christos Nomikos

  6. EECS Deparment, University of California at Berkeley, Berkeley, CA, 94720, USA

    Christos H. Papadimitriou

  7. Department of Computer Science, San Jose State University, San Jose, CA, 95192, USA

    Katerina Potika

Authors
  1. Eleni Bakali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panagiotis Cheilaris
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dimitris Fotakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Fürer
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Costas D. Koutras
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Euripides Markou
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Christos Nomikos
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Aris Pagourtzis
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  10. Nikolaos S. Papaspyrou
    View author publications

    You can also search for this author in PubMed Google Scholar

  11. Katerina Potika
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aris Pagourtzis .

Editor information

Editors and Affiliations

  1. National Technical University of Athens, Zografou, Athens, Greece

    Dimitris Fotakis

  2. National Technical University of Athens, Zografou, Athens, Greece

    Aris Pagourtzis

  3. Université Paris-Dauphine, Paris, France

    Vangelis Th. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bakali, E. et al. (2017). Stathis Zachos at 70!. In: Fotakis, D., Pagourtzis, A., Paschos, V. (eds) Algorithms and Complexity. CIAC 2017. Lecture Notes in Computer Science(), vol 10236. Springer, Cham. https://doi.org/10.1007/978-3-319-57586-5_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57586-5_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57585-8

  • Online ISBN: 978-3-319-57586-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation