{'fraction_non_alphanumeric': 0.013918629550321198, 'fraction_numerical': 0.0, 'mean_word_length': 5.631205673758865, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Parallel Computer Architecture: A Hardware/Software Approach

enter the circuit several times, possibly via different input processors. More elaborate combinatorial considerations than for standard VLSI circuits are needed to show how communication complexity can be used to get lower bounds on multilective VLSI computations. Near the end of the book, Hromkovic presents relations between communication complexity and some complexity measures of sequential computations. The core section introduces a uniform model of one-way communication protocols and shows that the corresponding uniform one-way communication complexity is strongly related to the size of deterministic finite automata. Then he relates communication complexity to the time and space complexity of Turing machines. Finally, he shows how communication complexity can be used to obtain lower bounds on the size and the depth of decisions nees and branching programs.