| 0 | -- | 0 | Matthias Krause. A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits |
| 0 | -- | 0 | Nader H. Bshouty. Exact Learning Boolean Functions via the Monotone Theory |
| 0 | -- | 0 | Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern. The Nucleon of Cooperative Games and an Algorithm for Matching Games |
| 0 | -- | 0 | Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky. A Lower Bound for Randomized Algebraic Decision Trees |
| 0 | -- | 0 | Amir M. Ben-Amram, Zvi Galil. On Data Structure Tradeoffs and an Application to Union-Find |
| 0 | -- | 0 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. Hitting Sets Derandomize BPP |
| 0 | -- | 0 | Nader H. Bshouty. A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries |
| 0 | -- | 0 | Kenneth W. Regan, D. Sivakumar, Jin-yi Cai. Pseudorandom Generators, Measure Theory, and Natural Proofs |
| 0 | -- | 0 | Nader H. Bshouty. The Monotone Theory for the PAC-Model |
| 0 | -- | 0 | Amnon Ta-Shma. On Extracting Randomness From Weak Random Sources |
| 0 | -- | 0 | Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao. An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX |
| 0 | -- | 0 | Oded Goldreich. Three XOR-Lemmas - An Exposition |
| 0 | -- | 0 | Marek Karpinski. VC Dimension of Sigmoidal and General Pfaffian Networks |
| 0 | -- | 0 | Farid M. Ablayev. On the Power of Randomized Branching Programs |
| 0 | -- | 0 | Petr Slavík. Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems |
| 0 | -- | 0 | Douglas R. Stinson. On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes |
| 0 | -- | 0 | Pascal Koiran. VC Dimension in Circuit Complexity |
| 0 | -- | 0 | Oded Goldreich, Noam Nisan, Avi Wigderson. On Yao s XOR-Lemma |
| 0 | -- | 0 | Maciej Liskiewicz, Rüdiger Reischuk. The Sublogarithmic Alternating Space World |
| 0 | -- | 0 | Anna Gál. Boolean Complexity Classes vs. Their Arithmetic Analogs |
| 0 | -- | 0 | Helmut Veith. Succinct Representation and Leaf Languages |
| 0 | -- | 0 | Martin Löbbing, Ingo Wegener. The Number of Knight s Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams |
| 0 | -- | 0 | Vince Grolmusz. On the Power of Circuits with Gates of Low L::1:: Norms |
| 0 | -- | 0 | Moni Naor. Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions |
| 0 | -- | 0 | Carsten Damm, Stasys Jukna, Jiri Sgall. Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
| 0 | -- | 0 | Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay. Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds |
| 0 | -- | 0 | Beate Bollig. Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams |
| 0 | -- | 0 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. Optimal Bounds for the Approximation of Boolean Functions and Some Applications |
| 0 | -- | 0 | Uri Zwick, Mike Paterson. The Complexity of Mean Payoff Games on Graphs |
| 0 | -- | 0 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk. Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs |
| 0 | -- | 0 | Tomoyuki Yamakami. Polynomial Time Samplable Distributions |
| 0 | -- | 0 | Joe Kilian. An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions |
| 0 | -- | 0 | Richard Beigel. The Power of Local Self-Reductions |
| 0 | -- | 0 | Richard Beigel, William I. Gasarch. Frequency Computation and Bounded Queries |
| 0 | -- | 0 | Richard Beigel. Closure Properties of GapP and #P |
| 0 | -- | 0 | Christoph Meinel. Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems |
| 0 | -- | 0 | Richard Beigel. 3-Coloring in time O(1.3446:::n:::): A no-MIS Algorithm |
| 0 | -- | 0 | Nader H. Bshouty, Christino Tamon. On the Fourier spectrum of Monotone Functions |
| 0 | -- | 0 | Dorit Dor. Selecting the Median |
| 0 | -- | 0 | Marek Karpinski. New Approximation Algorithms for the Steiner Tree Problems |
| 0 | -- | 0 | Marek Karpinski, Alexander Zelikovsky. 1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems |
| 0 | -- | 0 | Oded Goldreich, Leonid A. Levin, Noam Nisan. On Constructing 1-1 One-Way Functions |
| 0 | -- | 0 | Eric Allender. Measure on P: Robustness of the Notion |
| 0 | -- | 0 | Frederic Green. Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate |
| 0 | -- | 0 | Claus-Peter Schnorr, Horst Helmut Hörner. Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction |
| 0 | -- | 0 | Günter Hotz, Gero Vierke, Björn Schieffer. Analytic Machines |
| 0 | -- | 0 | Mihir Bellare, Oded Goldreich, Madhu Sudan. Free Bits, PCP and Non-Approximability - Towards Tight Results |
| 0 | -- | 0 | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani. On Syntactic versus Computational Views of Approximability |
| 0 | -- | 0 | Marek Karpinski, Wojciech Rytter. Pattern-Matching for Strings with Short Descriptions |
| 0 | -- | 0 | Marek Karpinski. On Randomized Versus Deterministic Computation |
| 0 | -- | 0 | William Hurwood. Dynamic Fault Diagnosis |
| 0 | -- | 0 | Detlef Sieling. New Lower Bounds and Hierarchy Results for Restricted Branching Programs |
| 0 | -- | 0 | Jin-yi Cai. Average Time Complexity Classes |
| 0 | -- | 0 | Jay Belanger. Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions |
| 0 | -- | 0 | Claudia Bertram-Kretzberg, Thomas Hofmeister. Multiple Product Modulo Arbitrary Numbers |
| 0 | -- | 0 | Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern. On Approximately Fair Cost Allocation in Euclidean TSP Games |
| 0 | -- | 0 | Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon. Oracles and Queries That Are Sufficient for Exact Learning |
| 0 | -- | 0 | Ulrich Faigle, Walter Kern, M. Streng. Note On the Computational Complexity of j-Radii of Polytopes in R:::n::: |
| 0 | -- | 0 | Oleg Verbitsky. The Parallel Repetition Conjecture for Trees is True |
| 0 | -- | 0 | Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern. On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games |
| 0 | -- | 0 | Roman Bacik, Sanjeev Mahajan. Semidefinite Programming and its Applications to NP Problems |
| 0 | -- | 0 | Pavel Pudlák, Jiri Sgall. An Upper Bound for a Communication Game Related to Time-Space Tradeoffs |
| 0 | -- | 0 | Amos Beimel, Anna Gál, Mike Paterson. Lower Bounds for Monotone Span Programs |