| 0 | -- | 0 | Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski. Approximability of Dense Instances of NEAREST CODEWORD Problem |
| 0 | -- | 0 | Oded Goldreich. Candidate One-Way Functions Based on Expander Graphs |
| 0 | -- | 0 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson. Extractors and pseudo-random generators with optimal seed length |
| 0 | -- | 0 | Lars Engebretsen, Marek Karpinski. Approximation Hardness of TSP with Bounded Metrics |
| 0 | -- | 0 | Meena Mahajan, V. Vinay. A note on the hardness of the characteristic polynomial |
| 0 | -- | 0 | Albert Atserias, Nicola Galesi, Pavel Pudlák. Monotone simulations of nonmonotone propositional proofs |
| 0 | -- | 0 | Michael Schmitt. On the Complexity of Computing and Learning with Multiplicative Neural Networks |
| 0 | -- | 0 | Rustam Mubarakzjanov. Probabilistic OBDDs: on Bound of Width versus Bound of Error |
| 0 | -- | 0 | Amit Sahai, Salil P. Vadhan. A Complete Problem for Statistical Zero Knowledge |
| 0 | -- | 0 | Eldar Fischer. Testing graphs for colorability properties |
| 0 | -- | 0 | Lefteris M. Kirousis, Phokion G. Kolaitis. The Complexity of Minimal Satisfiability Problems |
| 0 | -- | 0 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems |
| 0 | -- | 0 | Marco Cesati. Perfect Code is W[1]-complete |
| 0 | -- | 0 | Albert Atserias, Nicola Galesi, Ricard Gavaldà. Monotone Proofs of the Pigeon Hole Principle |
| 0 | -- | 0 | Mark Jerrum, Eric Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries |
| 0 | -- | 0 | Jean-Pierre Seifert. Using fewer Qubits in Shor s Factorization Algorithm via Simultaneous Diophantine Approximation |
| 0 | -- | 0 | Till Tantau. On the Power of Extra Queries to Selective Languages |
| 0 | -- | 0 | Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert. Measures of Nondeterminism in Finite Automata |
| 0 | -- | 0 | Andreas Klein, Martin Kutrib. Deterministic Turing Machines in the Range between Real-Time and Linear-Time |
| 0 | -- | 0 | Daniele Micciancio, Bogdan Warinschi. A Linear Space Algorithm for Computing the Hermite Normal Form |
| 0 | -- | 0 | Venkatesan Guruswami, Sanjeev Khanna. On the Hardness of 4-coloring a 3-colorable Graph |
| 0 | -- | 0 | Peter Auer, Philip M. Long, Aravind Srinivasan. Approximating Hyper-Rectangles: Learning and Pseudo-random Sets |
| 0 | -- | 0 | Peter Auer, Nicolò Cesa-Bianchi. On-line Learning with Malicious Noise and the Closure Algorithm |
| 0 | -- | 0 | Peter Auer, Manfred K. Warmuth. Tracking the best disjunction |
| 0 | -- | 0 | Pavlos Efraimidis, Paul G. Spirakis. Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines |
| 0 | -- | 0 | Peter Auer. Learning Nested Differences in the Presence of Malicious Noise |
| 0 | -- | 0 | Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire. Gambling in a rigged casino: The adversarial multi-armed bandit problem |
| 0 | -- | 0 | Peter Auer, Philip M. Long. Simulating Access to Hidden Information while Learning |
| 0 | -- | 0 | Peter Auer. On Learning from Ambiguous Information |
| 0 | -- | 0 | Eric Allender, David A. Mix Barrington. Uniform Circuits for Division: Consequences and Problems |
| 0 | -- | 0 | Klaus Jansen, Marek Karpinski, Andrzej Lingas. A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs |
| 0 | -- | 0 | Peter Auer. On-line Learning of Rectangles in Noisy Environments |
| 0 | -- | 0 | Venkatesan Guruswami, Johan Håstad, Madhu Sudan. Hardness of approximate hypergraph coloring |
| 0 | -- | 0 | Prahladh Harsha, Madhu Sudan. Small PCPs with low query complexity |
| 0 | -- | 0 | Uri Zwick. All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication |
| 0 | -- | 0 | Elizaveta A. Okol nishnikova. On Operations of Geometrical Projection and Monotone Extension |
| 0 | -- | 0 | Omer Reingold, Ronen Shaltiel, Avi Wigderson. Extracting Randomness via Repeated Condensing |
| 0 | -- | 0 | Martin Sauerhoff. Approximation of Boolean Functions by Combinatorial Rectangles |
| 0 | -- | 0 | Martin Sauerhoff. An Improved Hierarchy Result for Partitioned BDDs |
| 0 | -- | 0 | Oded Goldreich, Avi Wigderson. On Pseudorandomness with respect to Deterministic Observers |
| 0 | -- | 0 | Peter Auer, Stephen Kwek, Wolfgang Maass, Manfred K. Warmuth. Learning of Depth Two Neural Networks with Constant Fan-in at the Hidden Nodes |
| 0 | -- | 0 | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri. On the power assignment problem in radio networks |
| 0 | -- | 0 | Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim. Parallel Read Operations Without Memory Contention |
| 0 | -- | 0 | Beate Bollig, Ingo Wegener. Approximability and Nonapproximability by Binary Decision Diagrams |
| 0 | -- | 0 | Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas. Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs |
| 0 | -- | 0 | Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger. On the Complexity of Function Learning |
| 0 | -- | 0 | Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson. Near-Optimal Separation of Treelike and General Resolution |
| 0 | -- | 0 | Herbert Fleischner, Stefan Szeider. Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference |
| 0 | -- | 0 | Beate Bollig. Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication |
| 0 | -- | 0 | Tobias Polzin, Siavash Vahdati Daneshmand. Primal-Dual Approaches to the Steiner Problem |
| 0 | -- | 0 | Philipp Woelfel. New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing |
| 0 | -- | 0 | Maria Isabel Gonzalez Vasco, Igor Shparlinski. On the Security of Diffie-Hellman Bits |
| 0 | -- | 0 | Tzvika Hartman, Ran Raz. On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors |
| 0 | -- | 0 | Uriel Feige, Marek Karpinski, Michael Langberg. A Note on Approximating MAX-BISECTION on Regular Graphs |
| 0 | -- | 0 | Lars Engebretsen. Lower Bounds for non-Boolean Constraint Satisfaction |
| 0 | -- | 0 | Igor Shparlinski. Security of Polynomial Transformations of the Diffie--Hellma |
| 0 | -- | 0 | Maria Isabel Gonzalez Vasco, Igor Shparlinski. Security of the Most Significant Bits of the Shamir Message Passing Scheme |
| 0 | -- | 0 | Oded Goldreich, Salil P. Vadhan, Avi Wigderson. Simplified derandomization of BPP using a hitting set generator |
| 0 | -- | 0 | Yevgeniy Dodis. Impossibility of Black-Box Reduction from Non-Adaptively to Adaptively Secure Coin-Flipping |
| 0 | -- | 0 | Wolfgang Maass. On Computation with Pulses |
| 0 | -- | 0 | Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith. New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT |
| 0 | -- | 0 | Carsten Damm, Markus Holzer, Pierre McKenzie. The Complexity of Tensor Calculus |
| 0 | -- | 0 | Nikolai K. Vereshchagin, Michael V. Vyugin. Independent minimum length programs to translate between given strings |
| 0 | -- | 0 | Valentine Kabanets, Charles Rackoff, Stephen Cook. Efficiently Approximable Real-Valued Functions |
| 0 | -- | 0 | Jan Krajícek. Tautologies from pseudo-random generators |
| 0 | -- | 0 | Wolfgang Maass. On the Computational Power of Winner-Take-All |
| 0 | -- | 0 | Wolfgang Maass, Eduardo D. Sontag. Neural Systems as Nonlinear Filters |
| 0 | -- | 0 | Wolfgang Maass. A Simple Model for Neural Computation with Firing Rates and Firing Correlations |
| 0 | -- | 0 | Matthias Krause, Hans-Ulrich Simon. Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography |
| 0 | -- | 0 | Ran Raz, Amir Shpilka. Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates |
| 0 | -- | 0 | Lance Fortnow, Dieter van Melkebeek. Time-Space Tradeoffs for Nondeterministic Computation |
| 0 | -- | 0 | Pavol Duris, Juraj Hromkovic, Katsushi Inoue. A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition |
| 0 | -- | 0 | Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin. Combinatorial Interpretation of Kolmogorov Complexity |
| 0 | -- | 0 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation |
| 0 | -- | 0 | Amihood Amir, Richard Beigel, William I. Gasarch. Some Connections between Bounded Query Classes and Non-Uniform Complexity |
| 0 | -- | 0 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson. Pseudorandom Generators in Propositional Proof Complexity |
| 0 | -- | 0 | Rosario Gennaro, Luca Trevisan. Lower Bounds on the Efficiency of Generic Cryptographic Constructions |
| 0 | -- | 0 | Uriel Feige, Marek Karpinski, Michael Langberg. Improved Approximation of MAX-CUT on Graphs of Bounded Degree |
| 0 | -- | 0 | Oded Goldreich, Dana Ron. On Testing Expansion in Bounded-Degree Graphs |
| 0 | -- | 0 | Michael Schmitt. Lower Bounds on the Complexity of Approximating Continuous Functions by Sigmoidal Neural Networks |
| 0 | -- | 0 | Edward A. Hirsch. Worst-case time bounds for MAX-k-SAT w.r.t. the number of variables using local search |
| 0 | -- | 0 | Oliver Kullmann. An application of matroid theory to the SAT problem |
| 0 | -- | 0 | Valentin E. Brimkov, Stefan S. Dantchev. On the Algebraic Complexity of Integer Programming |
| 0 | -- | 0 | Michael V. Vyugin. Information Distance and Conditional Complexities |
| 0 | -- | 0 | Andrei A. Muchnik, Alexei L. Semenov. Multi-conditional Descriptions and Codes in Kolmogorov Complexity |
| 0 | -- | 0 | Matthias Krause, Stefan Lucks. On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators |
| 0 | -- | 0 | Daniel Král. Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization |
| 0 | -- | 0 | Ke Yang. Integer Circuit Evaluation is PSPACE-complete |
| 0 | -- | 0 | Sotiris E. Nikoletseas, Paul G. Spirakis. Efficient Communication Establishment in Extremely Unreliable Large Networks |
| 0 | -- | 0 | Amitabha Roy, Christopher Wilson. Supermodels and Closed Sets |
| 0 | -- | 0 | Piotr Berman, Moses Charikar, Marek Karpinski. On-Line Load Balancing for Related Machines |