From post

The Complexity of Systolic Dissemination of Information in Interconnection Networks.

, , , , и . Canada-France Conference on Parallel and Distributed Computing, том 805 из Lecture Notes in Computer Science, стр. 235-249. Springer, (1994)

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.

 

Другие публикации лиц с тем же именем

Parallel Communicating Grammar Systems with Regular Control., , и . CAI, том 5725 из Lecture Notes in Computer Science, стр. 342-360. Springer, (2009)Lexicalized Syntactic Analysis by Restarting Automata., , , и . Stringology, стр. 69-83. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2019)Randomization in Non-Uniform Finite Automata., , , , , и . MFCS, том 170 из LIPIcs, стр. 30:1-30:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the complexity of reductions by restarting automata., , и . NCMA, том 304 из books@ocg.at, стр. 207-222. Österreichische Computer Gesellschaft, (2014)Analysis by reduction of analytical PDT-trees., , и . NCMA, стр. 211-226. Österreichische Computer Gesellschaft, (2017)Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus., , и . ITAT, том 1422 из CEUR Workshop Proceedings, стр. 43-50. CEUR-WS.org, (2015)One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars., , , и . ITAT, том 3498 из CEUR Workshop Proceedings, стр. 110-120. CEUR-WS.org, (2023)Two Lower Bounds on Distributive Generation of Languages., , , и . Fundam. Informaticae, 25 (3): 271-284 (1996)Wireless Parallel Computing and its Links to Descriptive Complexity., и . DCFS, стр. 41-56. University of Kosice, Slovakia, (2007)Factoring and testing primes in small space., и . RAIRO Theor. Informatics Appl., 47 (3): 241-259 (2013)