AAAAAA
Results:
1-8
|
Results: 8
Authors:
Hromkovic, J
Sykora, O
Citation: J. Hromkovic et O. Sykora, Special DAM issue of WG'98 - Preface, DISCR APP M, 108(1-2), 2001, pp. 1-2
Authors:
Hromkovic, J
Schnitger, G
Citation: J. Hromkovic et G. Schnitger, On the power of Las Vegas for one-way communication complexity, OBDDs, andfinite automata, INF COMPUT, 169(2), 2001, pp. 284-296
Authors:
Freivalds, R
Hromkovic, J
Paun, G
Unger, W
Citation: R. Freivalds et al., Communication, molecular computing and randomized algorithms - Foreword, THEOR COMP, 264(1), 2001, pp. 1-2
Authors:
Hromkovic, J
Schnitger, G
Citation: J. Hromkovic et G. Schnitger, On the power of Las Vegas II: Two-way finite automata, THEOR COMP, 262(1-2), 2001, pp. 1-24
Authors:
Hromkovic, J
Seibert, S
Wilke, T
Citation: J. Hromkovic et al., Translating regular expressions into small epsilon-free nondeterministic finite automata, J COMPUT SY, 62(4), 2001, pp. 565-588
Authors:
Bockenhauer, HJ
Hromkovic, J
Klasing, R
Seibert, S
Unger, W
Citation: Hj. Bockenhauer et al., Approximation algorithms for the TSP with sharpened triangle inequality, INF PROCESS, 75(3), 2000, pp. 133-138
Authors:
Hromkovic, J
Citation: J. Hromkovic, Communication complexity and lower bounds on multilective computations, RAIRO-INF, 33(2), 1999, pp. 193-212
Authors:
Hromkovic, J
Citation: J. Hromkovic, Some contributions of the study of abstract communication complexity to other areas of computer science, ACM C SURV, 31, 1999, pp. F1-F5
Risultati:
1-8
|