Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stathis Zachos
@article{DBLP:journals/corr/abs-2306-11614,
author = {Eleni Bakali and
Aggeliki Chalki and
Sotiris Kanellopoulos and
Aris Pagourtzis and
Stathis Zachos},
title = {On the power of counting the total number of computation paths of
NPTMs},
journal = {CoRR},
volume = {abs/2306.11614},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.11614},
doi = {10.48550/ARXIV.2306.11614},
eprinttype = {arXiv},
eprint = {2306.11614},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-11614.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BakaliCGPZ22,
author = {Eleni Bakali and
Aggeliki Chalki and
Andreas G{\"{o}}bel and
Aris Pagourtzis and
Stathis Zachos},
title = {Guest column: {A} panorama of counting problems the decision version
of which is in P\({}^{\mbox{3}}\)},
journal = {{SIGACT} News},
volume = {53},
number = {3},
pages = {46--68},
year = {2022},
url = {https://doi.org/10.1145/3561064.3561072},
doi = {10.1145/3561064.3561072},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/BakaliCGPZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AntonopoulosBCP22,
author = {Antonis Antonopoulos and
Eleni Bakali and
Aggeliki Chalki and
Aris Pagourtzis and
Petros Pantavos and
Stathis Zachos},
title = {Completeness, approximability and exponential time results for counting
problems with easy decision version},
journal = {Theor. Comput. Sci.},
volume = {915},
pages = {55--73},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.02.030},
doi = {10.1016/J.TCS.2022.02.030},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AntonopoulosBCP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BakaliCPPZ17,
author = {Eleni Bakali and
Aggeliki Chalki and
Aris Pagourtzis and
Petros Pantavos and
Stathis Zachos},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Completeness Results for Counting Problems with Easy Decision},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {55--66},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_6},
doi = {10.1007/978-3-319-57586-5\_6},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BakaliCPPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fedcsis/PapaspyrouZ13,
author = {Nikolaos S. Papaspyrou and
Stathis Zachos},
editor = {Maria Ganzha and
Leszek A. Maciaszek and
Marcin Paprzycki},
title = {Teaching Programming through Problem Solving: The Role of the Programming
Language},
booktitle = {Proceedings of the 2013 Federated Conference on Computer Science and
Information Systems, Krak{\'{o}}w, Poland, September 8-11, 2013},
pages = {1533--1536},
year = {2013},
url = {https://ieeexplore.ieee.org/document/6644222/},
timestamp = {Mon, 09 Aug 2021 14:54:05 +0200},
biburl = {https://dblp.org/rec/conf/fedcsis/PapaspyrouZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictac/ChengCZ13,
author = {Wen{-}Ju Cheng and
Jim Cox and
Stathis Zachos},
editor = {Zhiming Liu and
Jim Woodcock and
Huibiao Zhu},
title = {Random Walks on Some Basic Classes of Digraphs},
booktitle = {Theoretical Aspects of Computing - {ICTAC} 2013 - 10th International
Colloquium, Shanghai, China, September 4-6, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8049},
pages = {122--140},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39718-9\_8},
doi = {10.1007/978-3-642-39718-9\_8},
timestamp = {Fri, 17 Feb 2023 09:02:01 +0100},
biburl = {https://dblp.org/rec/conf/ictac/ChengCZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NoyCLMZ12,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Michael Lampis and
Valia Mitsou and
Stathis Zachos},
title = {Ordered coloring of grids and related graphs},
journal = {Theor. Comput. Sci.},
volume = {444},
pages = {40--51},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.04.036},
doi = {10.1016/J.TCS.2012.04.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NoyCLMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Bar-NoyCLMZ09,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Michael Lampis and
Valia Mitsou and
Stathis Zachos},
editor = {Shay Kutten and
Janez Zerovnik},
title = {Ordered Coloring Grids and Related Graphs},
booktitle = {Structural Information and Communication Complexity, 16th International
Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5869},
pages = {30--43},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11476-2\_4},
doi = {10.1007/978-3-642-11476-2\_4},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/Bar-NoyCLMZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/FragoudakisMZ07,
author = {Christodoulos Fragoudakis and
Euripides Markou and
Stathis Zachos},
title = {Maximizing the guarded boundary of an Art Gallery is APX-complete},
journal = {Comput. Geom.},
volume = {38},
number = {3},
pages = {170--180},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2006.12.001},
doi = {10.1016/J.COMGEO.2006.12.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/FragoudakisMZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/PagourtzisPZ07,
author = {Aris Pagourtzis and
Katerina Potika and
Stathis Zachos},
title = {Path multicoloring with fewer colors in spiders and caterpillars},
journal = {Computing},
volume = {80},
number = {3},
pages = {255--274},
year = {2007},
url = {https://doi.org/10.1007/s00607-007-0234-2},
doi = {10.1007/S00607-007-0234-2},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/PagourtzisPZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/NomikosPZ07,
author = {Christos Nomikos and
Aris Pagourtzis and
Stathis Zachos},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {Randomized and Approximation Algorithms for Blue-Red Matching},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {715--725},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_63},
doi = {10.1007/978-3-540-74456-6\_63},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/NomikosPZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/NomikosPPZ06,
author = {Christos Nomikos and
Aris Pagourtzis and
Katerina Potika and
Stathis Zachos},
title = {Routing and wavelength assignment in multifiber {WDM} networks with
non-uniform fiber cost},
journal = {Comput. Networks},
volume = {50},
number = {1},
pages = {1--14},
year = {2006},
url = {https://doi.org/10.1016/j.comnet.2004.11.028},
doi = {10.1016/J.COMNET.2004.11.028},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cn/NomikosPPZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PagourtzisZ06,
author = {Aris Pagourtzis and
Stathis Zachos},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {The Complexity of Counting Functions with Easy Decision Version},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {741--752},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_64},
doi = {10.1007/11821069\_64},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/PagourtzisZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pci/IoannidisNPZ05,
author = {Stratis Ioannidis and
Christos Nomikos and
Aris Pagourtzis and
Stathis Zachos},
editor = {Panayiotis Bozanis and
Elias N. Houstis},
title = {Routing and Wavelength Assignment in Generalized {WDM} Tree Networks
of Bounded Degree},
booktitle = {Advances in Informatics, 10th Panhellenic Conference on Informatics,
{PCI} 2005, Volos, Greece, November 11-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3746},
pages = {57--67},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11573036\_6},
doi = {10.1007/11573036\_6},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pci/IoannidisNPZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pci/FragoudakisMZ05,
author = {Christodoulos Fragoudakis and
Euripides Markou and
Stathis Zachos},
editor = {Panayiotis Bozanis and
Elias N. Houstis},
title = {How to Place Efficiently Guards and Paintings in an Art Gallery},
booktitle = {Advances in Informatics, 10th Panhellenic Conference on Informatics,
{PCI} 2005, Volos, Greece, November 11-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3746},
pages = {145--154},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11573036\_14},
doi = {10.1007/11573036\_14},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pci/FragoudakisMZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/NomikosPPZ04,
author = {Christos Nomikos and
Aris Pagourtzis and
Katerina Potika and
Stathis Zachos},
editor = {Nikolas Mitrou and
Kimon P. Kontovasilis and
George N. Rouskas and
Ilias Iliadis and
Lazaros F. Merakos},
title = {Fiber Cost Reduction and Wavelength Minimization in Multifiber {WDM}
Networks},
booktitle = {{NETWORKING} 2004, Networking Technologies, Services, and Protocols;
Performance of Computer and Communication Networks; Mobile and Wireless
Communication, Third International {IFIP-TC6} Networking Conference,
Athens, Greece, May 9-14, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3042},
pages = {150--161},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24693-0\_13},
doi = {10.1007/978-3-540-24693-0\_13},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/networking/NomikosPPZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/NomikosPZ03,
author = {Christos Nomikos and
Aris Pagourtzis and
Stathis Zachos},
title = {Satisfying a maximum number of pre-routed requests in all-optical
rings},
journal = {Comput. Networks},
volume = {42},
number = {1},
pages = {55--63},
year = {2003},
url = {https://doi.org/10.1016/S1389-1286(02)00448-6},
doi = {10.1016/S1389-1286(02)00448-6},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/NomikosPZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MarkouZF03,
author = {Euripides Markou and
Stathis Zachos and
Christodoulos Fragoudakis},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {24--35},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_10},
doi = {10.1007/3-540-44849-7\_10},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MarkouZF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/NomikosPZ03,
author = {Christos Nomikos and
Aris Pagourtzis and
Stathis Zachos},
title = {Minimizing Request Blocking in All-Optical Rings},
booktitle = {Proceedings {IEEE} {INFOCOM} 2003, The 22nd Annual Joint Conference
of the {IEEE} Computer and Communications Societies, San Franciso,
CA, USA, March 30 - April 3, 2003},
pages = {1355--1361},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/INFCOM.2003.1208971},
doi = {10.1109/INFCOM.2003.1208971},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/NomikosPZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NomikosPZ01,
author = {Christos Nomikos and
Aris Pagourtzis and
Stathis Zachos},
title = {Routing and path multicoloring},
journal = {Inf. Process. Lett.},
volume = {80},
number = {5},
pages = {249--256},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00167-3},
doi = {10.1016/S0020-0190(01)00167-3},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NomikosPZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pci/KiayiasPSZ01,
author = {Aggelos Kiayias and
Aris Pagourtzis and
Kiron Sharma and
Stathis Zachos},
editor = {Yannis Manolopoulos and
Skevos Evripidou and
Antonis C. Kakas},
title = {Acceptor-Definable Counting Classes},
booktitle = {Advances in Informatics, 8th Panhellenic Conference on Informatics,
{PCI} 2001. Nicosia, Cyprus, November 8-10, 2001, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {2563},
pages = {453--463},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-38076-0\_29},
doi = {10.1007/3-540-38076-0\_29},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/pci/KiayiasPSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/KoutrasZ00,
author = {Costas D. Koutras and
Stathis Zachos},
title = {Many-Valued Reflexive Autoepistemic Logic},
journal = {Log. J. {IGPL}},
volume = {8},
number = {1},
pages = {33--54},
year = {2000},
url = {https://doi.org/10.1093/jigpal/8.1.33},
doi = {10.1093/JIGPAL/8.1.33},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/KoutrasZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/KoutrasKZ99,
author = {Costas D. Koutras and
George Koletsos and
Stathis Zachos},
title = {Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets
and Logics with Linear Truth Spaces},
journal = {Fundam. Informaticae},
volume = {38},
number = {3},
pages = {281--324},
year = {1999},
url = {https://doi.org/10.3233/FI-1999-38303},
doi = {10.3233/FI-1999-38303},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/KoutrasKZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/PgourtzisSZ98,
author = {A. Pgourtzis and
K. Sharma and
Efstathios K. Zachos},
editor = {Xuemin Lin},
title = {Tree Models and Probabilistic Polynomial Time Computations},
booktitle = {Proceedings of Computing: The Fourth Australasian Theory Symposium
(CATS'98), Perth, WA, Australia, February 2-3, 1998},
series = {Australian Computer Science Communications},
volume = {20},
number = {3},
pages = {291--304},
publisher = {Springer-Verlag Singapore Pte. Ltd.},
year = {1998},
timestamp = {Mon, 16 Mar 2020 17:44:09 +0100},
biburl = {https://dblp.org/rec/conf/cats/PgourtzisSZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acr/FurerGMSZ89,
author = {Martin F{\"{u}}rer and
Oded Goldreich and
Yishay Mansour and
Michael Sipser and
Stathis Zachos},
title = {On Completeness and Soundness in Interactive Proof Systems},
journal = {Adv. Comput. Res.},
volume = {5},
pages = {429--442},
year = {1989},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acr/FurerGMSZ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Zachos88,
author = {Stathis Zachos},
title = {Probabilistic Quantifiers and Games},
journal = {J. Comput. Syst. Sci.},
volume = {36},
number = {3},
pages = {433--451},
year = {1988},
url = {https://doi.org/10.1016/0022-0000(88)90037-2},
doi = {10.1016/0022-0000(88)90037-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Zachos88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoppanaHZ87,
author = {Ravi B. Boppana and
Johan H{\aa}stad and
Stathis Zachos},
title = {Does co-NP Have Short Interactive Proofs?},
journal = {Inf. Process. Lett.},
volume = {25},
number = {2},
pages = {127--132},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90232-8},
doi = {10.1016/0020-0190(87)90232-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoppanaHZ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ZachosF87,
author = {Stathis Zachos and
Martin F{\"{u}}rer},
editor = {Kesav V. Nori},
title = {Probabalistic Quantifiers vs. Distrustful Adversaries},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Seventh Conference, Pune, India, December 17-19, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {287},
pages = {443--455},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18625-5\_67},
doi = {10.1007/3-540-18625-5\_67},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/ZachosF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ZachosH86,
author = {Stathis Zachos and
Hans Heller},
title = {A Decisive Characterization of {BPP}},
journal = {Inf. Control.},
volume = {69},
number = {1-3},
pages = {125--135},
year = {1986},
url = {https://doi.org/10.1016/S0019-9958(86)80044-4},
doi = {10.1016/S0019-9958(86)80044-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ZachosH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Zachos86,
author = {Stathis Zachos},
editor = {Alan L. Selman},
title = {Probabilistic Quantifiers, Adversaries, and Complexity Classes: An
Overview},
booktitle = {Structure in Complexity Theory, Proceedings of the Conference hold
at the University of California, Berkeley, California, USA, June 2-5,
1986},
series = {Lecture Notes in Computer Science},
volume = {223},
pages = {383--400},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16486-3\_112},
doi = {10.1007/3-540-16486-3\_112},
timestamp = {Thu, 02 Feb 2023 13:27:01 +0100},
biburl = {https://dblp.org/rec/conf/coco/Zachos86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Zachos84,
author = {Stathis Zachos},
editor = {Mathai Joseph and
R. K. Shyamasundar},
title = {A New Characterization of {BPP}},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {181},
pages = {179--187},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-13883-8\_72},
doi = {10.1007/3-540-13883-8\_72},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Zachos84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/PapadimitriouZ83,
author = {Christos H. Papadimitriou and
Stathis Zachos},
editor = {Armin B. Cremers and
Hans{-}Peter Kriegel},
title = {Two remarks on the power of counting},
booktitle = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany,
January 5-7, 1983, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {145},
pages = {269--276},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/BFb0009651},
doi = {10.1007/BFB0009651},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/tcs/PapadimitriouZ83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Zachos82,
author = {Stathis Zachos},
title = {Robustness of Probabilistic Computational Complexity Classes under
Definitional Perturbations},
journal = {Inf. Control.},
volume = {54},
number = {3},
pages = {143--154},
year = {1982},
url = {https://doi.org/10.1016/S0019-9958(82)80019-3},
doi = {10.1016/S0019-9958(82)80019-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Zachos82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
