The computational complexity of universal hashing (Q1208411): Difference between revisions

@@ Property / cites work @@
+Communication-Space Tradeoffs for Unrestricted Protocols
+Normal rank
@@ Property / cites work @@
+Q4385519
@@ Property / cites work: Q4385519 / rank @@
+Normal rank
@@ Property / cites work @@
+A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
+Normal rank
@@ Property / cites work @@
+Parallel computation for well-endowed rings and space-bounded probabilistic machines
+Normal rank
@@ Property / cites work @@
+A time-space tradeoff for sorting on non-oblivious machines
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+Method of determining lower bounds for the complexity of \(\Pi\)-circuits
+Normal rank
@@ Property / cites work @@
+Time-space tradeoffs for computing functions, using connectivity properties of their circuits
+Normal rank
@@ Property / cites work @@
+Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(93)90257-t
+Normal rank
@@ Property / OpenAlex ID @@
+W2031934066
@@ Property / OpenAlex ID: W2031934066 / rank @@
+Normal rank