Stathis Zachos at 70!

DOI10.1007/978-3-319-57586-5_39zbMATH Open1486.68007DBLPconf/ciac/BakaliCFFKMNPPP17OpenAlexW2605929785WikidataQ59818362 ScholiaQ59818362MaRDI QIDQ5283390FDOQ5283390

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

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

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)