Optimal edge ranking of trees in linear time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum and classical query complexities of local search are polynomially related
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New upper and lower bounds for randomized and quantum local search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Enhanced algorithms for local search
Information Processing Letters
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Optimal vertex ranking of block graphs
Information and Computation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Enhanced algorithms for Local Search
Information Processing Letters
Graph unique-maximum and conflict-free colorings
Journal of Discrete Algorithms
Too fast unbiased black-box algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Quantum and randomized lower bounds for local search on vertex-transitive graphs
Quantum Information & Computation
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Optimizing a 2d function satisfying unimodality properties
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Ordered coloring grids and related graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Probability and convergence for supra-majority rule with Euclidean preferences
Mathematical and Computer Modelling: An International Journal
Ordered coloring of grids and related graphs
Theoretical Computer Science
The benefits of using variable-length pipelined operations in high-level synthesis
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.05 |