Journal: Computational Complexity

Volume 5, Issue 3/4

191 -- 204Mauricio Karchmer, Ran Raz, Avi Wigderson. Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity
205 -- 221Ran Raz. Fourier Analysis for Probabilistic Communication Complexity
222 -- 236Thomas Lickteig, Kai Werther. How can a Complex Square Root be Computed in an Optimal Way
237 -- 247Ueli M. Maurer. On the Oracle Complexity of Factoring Integers
248 -- 266Meera Sitharam. Pseudorandom Generators and Learning Algorithms for AC^0
267 -- 283David W. Juedes. Weakly Complete Problems are not Rare

Volume 5, Issue 2

99 -- 112Johan Håstad, Stasys Jukna, Pavel Pudlák. Top-Down Lower Bounds for Depth-Three Circuits
113 -- 131Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde. Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs
132 -- 154Alain P. Hiltgen, Mike Paterson. PI_k Mass Production and an Optimal Circuit for the Neciporuk Slice
155 -- 166Carme Àlvarez, Birgit Jenner. A Note on Logspace Optimization
167 -- 189Meera Sitharam. Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates

Volume 5, Issue 1

1 -- 23Nick Littlestone, Philip M. Long, Manfred K. Warmuth. On-line Learning of Linear Functions
24 -- 42György Turán. On the Complexity of Planar Boolean Circuits
43 -- 59Benny Chor, Netta Shani. The Privacy of Dense Symmetric Functions
60 -- 75Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman. Derandomized Graph Products
76 -- 97Keju Ma, Joachim von zur Gathen. The Computational Complexity of Recognizing Permutation Functions