Вы здесь

Hromkovic J.

Автор:

Вид Название Год Автор Серия Редакторы Колл. автор Источник Дата поступления
СТ Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids 1995 Hromkovic J., Klasing R., Pardubska D., Unger W., Waczulik J., Wagener H. Lecture Notes in Computer Science Fundamentals of Computation Theory 18.10.1995
СТ On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks 1995 Hromkovic J., Lorys K., Kanarek P., Klasing R., Unger W., Wagener H. Lecture Notes in Computer Science 25.03.1995
СТ A Comparison of Two Lower Bound Methods for Communication Complexity 1994 Dietzfelbinger M., Hromkovic J., Schnitger G. Lecture Notes in Computer Science 29.09.1994
СТ Two Lower Bounds on Distributive Generation of Languages 1994 Hromkovic J., Kari J., Kari L., Pardubska D. Lecture Notes in Computer Science 29.09.1994
СТ The Complexity of Systolic Dissemination of Information in Interconnection Networks 1994 Hromkovic J., Klasing R., Unger W., Wagener H. Lecture Notes in Computer Science 29.06.1994
СТ Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems 1993 Hromkovic J., Kari J., Kiri L. Lecture Notes in Computer Science 20.10.1993
СТ Topology of Parallel Networks and Computational Complexity 1992 Hromkovic J. Lecture Notes in Computer Science 20.03.1993
СТ On Embedding Interconnection Networks into Rings of Processors 1992 Hromkovic J., Muller V., Sykora O., Vrto I. Lecture Notes in Computer Science 28.07.1992
СТ Optimal Algorithms for Dissemination of Information in Generalized Communication Modes 1992 Feldmann R., Hromkovic J., Madhavapeddy S., Monien B., Mysliwietz P. Lecture Notes in Computer Science 28.07.1992
СТ Branching Programs versus Oblivious Branching Programs 1991 Hromkovic J. Computers and Artificial Intelligence 23.04.1991