| Information Theoretic Measures for Ant Colony Optimization | 0 | 0.34 | 2014 |
| Ant colony optimization with group learning | 0 | 0.34 | 2014 |
| Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. | 5 | 0.43 | 2014 |
| Structural RNA alignment by multi-objective optimization. | 8 | 0.56 | 2013 |
| RNA-Pareto: interactive analysis of Pareto-optimal RNA sequence-structure alignments. | 2 | 0.36 | 2013 |
| Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. | 0 | 0.34 | 2012 |
| Choosing probability distributions for stochastic local search and the role of make versus break | 28 | 1.02 | 2012 |
| Das SAT-Problem | 0 | 0.34 | 2010 |
| Using Stochastic Indexed Grammars for RNA Structure PredictionWith Pseudoknots. | 0 | 0.34 | 2010 |
| Comparing two stochastic local search algorithms for constraint satisfaction problems | 0 | 0.34 | 2010 |
| Principles of Stochastic Local Search | 3 | 0.48 | 2007 |
| Smaller superconcentrators of density 28 | 1 | 0.36 | 2006 |
| A note on the size of Craig Interpolants | 2 | 0.36 | 2006 |
| New algorithmic paradigms in exponential time algorithms | 0 | 0.34 | 2005 |
| Randomized Quicksort and the Entropy of the Random Number Generator | 1 | 0.37 | 2004 |
| A Probabilistic 3-SAT Algorithm Further Improved | 42 | 5.10 | 2002 |
| A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. | 38 | 1.76 | 2002 |
| New Algorithms for k -SAT Based on the Local Search Principle | 6 | 0.66 | 2001 |
| Mastering the Master Theorem | 2 | 0.43 | 2000 |
| Construction of expanders and superconcentrators using Kolmogorov complexity | 2 | 0.43 | 2000 |
| Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search | 12 | 1.43 | 2000 |
| A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems | 134 | 10.87 | 1999 |
| Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. | 7 | 0.56 | 1997 |
| Better Expanders and Superconcentrators by Kolmogorov Complexity | 3 | 0.55 | 1997 |
| High Sets for NP. | 2 | 0.37 | 1997 |
| Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity | 3 | 0.54 | 1997 |
| If NP has polynomial-size circuits, then MA=AM | 9 | 0.62 | 1995 |
| Instance complexity | 30 | 4.40 | 1994 |
| On random reductions from sparse sets to tally sets | 9 | 0.61 | 1993 |
| Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 | 11 | 2.50 | 1993 |
| Reductions to Sets of Low Information Content | 33 | 1.52 | 1992 |
| Logarithmic advice classes | 5 | 0.44 | 1992 |
| Graph Isomorphism is Low for PP | 22 | 2.46 | 1992 |
| Complexity cores and hard problem instances | 2 | 0.41 | 1990 |
| Turing machines with few accepting computations and low sets for PP | 43 | 3.68 | 1989 |
| The power of counting | 12 | 4.09 | 1988 |
| Robust Orale Machines | 5 | 0.42 | 1988 |
| Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries | 20 | 1.81 | 1988 |
| Complexity Cores and Hard-To-Prove Formulas | 2 | 0.39 | 1987 |
| The Difference and Truth-Table Hierarchies for NP | 57 | 3.22 | 1987 |
| Lowness and probabilistic complexity classes. | 0 | 0.34 | 1987 |
| Sparse sets lowness and highness | 51 | 2.35 | 1986 |
| The polynomial-time hierarchy and sparse oracles | 20 | 1.28 | 1986 |
| Lower Bounds by Recursion Theoretic Arguments (Extended Abstract) | 0 | 0.34 | 1986 |
| Optimal approximations and polynomially levelable sets | 28 | 2.32 | 1986 |
| The density and complexity of polynomial cores for intractable sets | 29 | 2.02 | 1986 |
| On Circuit-Size Complexity And The Low Hierarchy In Np | 49 | 7.54 | 1985 |
| On bounded query machines | 9 | 0.96 | 1985 |
| Bi-Immune Sets for Complexity Classes | 65 | 7.06 | 1985 |
| Polynomial Levelability and Maximal Complexity Cores | 0 | 0.34 | 1985 |
