Electronic Colloquium on Computational Complexity, Volume 11, 2004
: Valiant's model and the cost of computing integers.
: A remark on nondecidabilities of the initial value problem of ODEs.
: The Complexity of Constructing Pseudorandom Generators from Hard Functions.
: Limitations of Quantum Advice and One-Way Communication.
: A new algorithm for optimal constraint satisfaction and its implications.
: On the sample complexity of learning for networks of spiking neurons with nonlinear synaptic interactions.
, Martin Wahlen
: On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems.
: Multilinear-NC1 != Multilinear-NC2.
: Some Applications of Coding Theory in Computational Complexity.
: A note on dimensions of polynomial size circuits.
: A note on the P versus NP intersected with co-NP question in communication complexity.
: Inapproximability of Combinatorial Optimization Problems.
, Amnon Ta-Shma
: Improveing the alphabet size in high noise, almost optimal rate list decodable codes.
: Combinatorial and algorithmic aspects of hyperbolic polynomials.
: A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set.
: Two-Layer Planarization: Improving on Parameterized Algorithmics.
: Simulated Annealing Beats Metropolis in Combinatorial Optimization.
: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions.
: Extractors with Weak Random Seeds.
: An O(log n log log n) Space Algorithm for Undirected s,t-Connectivity.
: On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields.
, founded at