On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Exact and approximate aggregation in constraint query languages
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGACT news complexity theory comun 37
ACM SIGACT News
SIGACT news complexity theory column 38
ACM SIGACT News
On the complexity of approximating the VC dimension
Journal of Computer and System Sciences - Complexity 2001
On the Complexity and Inapproximability of Shortest Implicant Problems
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Finding a Path of Superlogarithmic Length
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
Satisfiability with exponential families
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Parent assignment is hard for the MDL, AIC, and NML costs
COLT'06 Proceedings of the 19th annual conference on Learning Theory
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Vertex cover, dominating set and my encounters with parameterized complexity and mike fellows
The Multivariate Algorithmic Revolution and Beyond
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |