A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The query complexity of finding local minima in the lattice
Information and Computation
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive Versus Nonadaptive Attribute-Efficient Learning
Machine Learning
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Computational Aspects of Parallel Attribute-Efficient Learning
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Combinatorics, Probability and Computing
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
The cell probe complexity of succinct data structures
Theoretical Computer Science
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms (TALG)
Improved Parameterized Algorithms for Weighted 3-Set Packing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Efficient algorithms for clique problems
Information Processing Letters
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Randomized disposal of unknowns and implicitly enforced bounds on parameters
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
An O*(3.523k) parameterized algorithm for 3-set packing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms (TALG)
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
Journal of Computer and System Sciences
Finding monotone paths in edge-ordered graphs
Discrete Applied Mathematics
The curse of connectivity: t-total vertex (edge) cover
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms
Clustering with local restrictions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algorithms for testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized complexity of even/odd subgraph problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Balanced families of perfect hash functions and their applications
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Clustering with local restrictions
Information and Computation
On some network design problems with degree constraints
Journal of Computer and System Sciences
Packing paths: Recycling saves time
Discrete Applied Mathematics
On testing monomials in multivariate polynomials
Theoretical Computer Science
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Threshold and majority group testing
Information Theory, Combinatorics, and Search Theory
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
| Hi-index | 0.01 |
We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2/sup k/ configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/spl Sigma/ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.