Communication Complexity and Lower Bounds on Multilective Computations (Q4265538): Difference between revisions

@@ Property / cites work @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+On lower bounds for read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+A very simple function that requires exponential size read-once branching programs.
+Normal rank
@@ Property / cites work @@
+On the power of multiple reads in a chip
@@ Property / cites work: On the power of multiple reads in a chip / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on communication complexity
@@ Property / cites work: Lower bounds on communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of two lower-bound methods for communication complexity
+Normal rank
@@ Property / cites work @@
+Q4266539
@@ Property / cites work: Q4266539 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear lower bounds on the number of processors of circuits with sublinear separators
+Normal rank
@@ Property / cites work @@
+Lower bounds for depth-restricted branching programs
+Normal rank
@@ Property / cites work @@
+Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The performance of multilective VLSI algorithms
@@ Property / cites work: The performance of multilective VLSI algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4287364
@@ Property / cites work: Q4287364 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3352964
@@ Property / cites work: Q3352964 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for synchronous circuits and planar circuits
+Normal rank
@@ Property / cites work @@
+On the complexity of planar Boolean circuits
@@ Property / cites work: On the complexity of planar Boolean circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of branching programs and decision trees for clique functions
+Normal rank
@@ Property / cites work @@
+Q3347300
@@ Property / cites work: Q3347300 / rank @@
+Normal rank
@@ Property / cites work @@
+An exponential lower bound for real-time branching programs
+Normal rank