Author:
Jurdziński Tomasz,Kutyłowski Mirosław,Loryś Krzysztof
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. P. Beame, M. Tompa, P. Yan, Communication-Space Tradeoffs for Unrestricted Protocols, SICOMP 23 (1994), 652–661.
2. A. Borodin, S. Cook, A Time-Space Tradeo_for Sorting on a General Sequential Model of Computation, SICOMP 11 (1982), 287–297.
3. A.O. Buda, Multiprocessor Automata, IPL 25 (1987), 157–161.
4. M. Dietzfelbinger, The Linear-Array Problem in Communication Complexity Resolved, in Proc. STOC'97, 373–382.
5. P. Duriš, Z. Galil, A Time-Space Tradeoff for Language Recognition, MST 17 (1984), 3–12.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Party Watson-Crick Computations;Implementation and Application of Automata;2011
2. Efficient simulation of synchronous systems by multi-speed systems;RAIRO - Theoretical Informatics and Applications;2005-04
3. Communication Gap for Finite Memory Devices;Automata, Languages and Programming;2001