Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Juraj Hromkovic"'
Publikováno v:
Informatics in Education, Vol 20, Iss 3, Pp 333-360 (2021)
Computing as a discipline has common roots with mathematics and written languages, and computing as a way of thinking and handling has been integral to human culture since ever. This is not only a reasonable argument for convincing society to conside
Externí odkaz:
https://doaj.org/article/47b556f207984882a3e3ce236f1a723d
Autor:
Michael Barot, Juraj Hromkovič
Aufbauend auf dem ersten Band, werden in diesem Buch weiterführende Konzepte der Wahrscheinlichkeitstheorie ausführlich und verständlich diskutiert. Mit vielen exemplarisch durchgerechneten Aufgaben, einer Vielzahl weiterer Problemstellungen und a
Autor:
Juraj Hromkovič
The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the th
Autor:
Juraj Hromkovič
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of curr
Autor:
Juraj Hromkovic, Georg Schnitger
Publikováno v:
Theoretical Computer Science. 262:1-24
The investigation of the computational power of randomized computations is one of the central tasks of complexity and algorithm theory. While for one-way finite automata the power of different computational modes was successfully determined, one does
Autor:
Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovič, Keith Jeffery, Rastislav Kralovic, Marko Vukolic, Stefan Wolf
This book constitutes the refereed proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011, held in Nový, Smokovec, Slovakia in January 2011. The 41 revised full papers, presented together with 5
Publikováno v:
Information and Computation. 118(2):302-305
We prove exact results on dilations in cycles for important parallel computer interconnection networks such as complete trees, hypercubes, and 2- and 3- dimensional meshes. Moreover, we show that trees, X -trees, n -dimensional meshes, pyramids, and
Autor:
Juraj Hromkovic
Publikováno v:
Einführung in die Programmierung mit LOGO ISBN: 9783834818522
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4d6dfb6b7d85a3d3b4774f07675eeed
https://doi.org/10.1007/978-3-8348-2266-6_13
https://doi.org/10.1007/978-3-8348-2266-6_13
Publikováno v:
Theoretical Computer Science. 132:319-336
The study of synchronized alternating machines has enabled to characterize several natural complexity classes. It is known that synchronized alternating space SASPACE(S(n))= ∪c>0NSPACE(ncS(n)) for any (space-constructible) function S(n) [Hromkovic