Stathis Zachos at 70!

DOI10.1007/978-3-319-57586-5_39MaRDI QIDQ5283390zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Nikolaos S. Papaspyrou, Katerina Potika, Martin Fürer, Christos Papadimitriou

Publication date 21 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57586-5_39

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03)

Cites work

• scientific article; zbMATH DE number 4057011 (Why is no real title available?)
• scientific article; zbMATH DE number 1953880 (Why is no real title available?)
• scientific article; zbMATH DE number 2011842 (Why is no real title available?)
• scientific article; zbMATH DE number 2060762 (Why is no real title available?)
• scientific article; zbMATH DE number 3799016 (Why is no real title available?)
• scientific article; zbMATH DE number 1444332 (Why is no real title available?)
• A decisive characterization of BPP
• Completeness results for counting problems with easy decision
• Counting classes: Thresholds, parity, mods, and fewness
• Does co-NP have short interactive proofs ?
• Graph isomorphism in quasipolynomial time (extended abstract)
• Many-valued reflexive autoepistemic logic
• Maximizing the guarded boundary of an Art Gallery is APX-complete
• Neochromatica.
• On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
• On the Connection between Interval Size Functions and Path Counting
• Ordered coloring of grids and related graphs
• Path multicoloring with fewer colors in spiders and caterpillars
• Randomized and Approximation Algorithms for Blue-Red Matching
• Robustness of probabilistic computational complexity classes under definitional perturbations
• Routing and path multicoloring
• Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Selfish resource allocation in optical networks
• The Complexity of Computing the Size of an Interval
• The Complexity of Counting Functions with Easy Decision Version
• The combinator S

Cited in

(1)

• Noncommutative geometry framework and the Feynman’s proof of Maxwell equations

This page was built for publication: Stathis Zachos at 70!

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283390)