( en | de | ru )

 

Disambiguation of "Zachos, Stathis"

Author of the publication

copydeleteadd this publication to your clipboard
On the Power of Counting the Total Number of Computation Paths of NPTMs.

, , , , and . TAMC, volume 14637 of Lecture Notes in Computer Science, page 209-220. Springer, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dimitrios Stathis

Stathis Philippou

Kyriakos Zachos

Alexandros Zachos

Konstantinos Zachos

 

Other publications of authors with the same name

Teaching Programming through Problem Solving: The Role of the Programming Language., and . FedCSIS, page 1533-1536. (2013)Acceptor-Definable Counting Classes., , , and . Panhellenic Conference on Informatics, volume 2563 of Lecture Notes in Computer Science, page 453-463. Springer, (2001)A New Characterization of BPP.. FSTTCS, volume 181 of Lecture Notes in Computer Science, page 179-187. Springer, (1984)Randomized and Approximation Algorithms for Blue-Red Matching., , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 715-725. Springer, (2007)Random Walks on Some Basic Classes of Digraphs., , and . ICTAC, volume 8049 of Lecture Notes in Computer Science, page 122-140. Springer, (2013)Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview.. SCT, volume 223 of Lecture Notes in Computer Science, page 383-400. Springer, (1986)How to Place Efficiently Guards and Paintings in an Art Gallery., , and . Panhellenic Conference on Informatics, volume 3746 of Lecture Notes in Computer Science, page 145-154. Springer, (2005)Probabilistic Quantifiers and Games.. J. Comput. Syst. Sci., 36 (3): 433-451 (1988)Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations. Inf. Control., 54 (3): 143-154 (September 1982)Completeness Results for Counting Problems with Easy Decision., , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 55-66. (2017)