Journal of the ACM (JACM)
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Space-efficient routing in vertex-symmetric networks (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Static Dictionaries Supporting Rank
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Simple Minimal Perfect Hashing in Less Space
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ACM SIGGRAPH 2006 Papers
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms (TALG)
Variants of constrained longest common subsequence
Information Processing Letters
Flash memory efficient LTL model checking
Science of Computer Programming
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching
ACM Transactions on Algorithms (TALG)
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Greedy localization and color-coding: improved matching and packing algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
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
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Symmetry matters for the sizes of extended formulations
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Practical perfect hashing in nearly optimal space
Information Systems
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Balanced families of perfect hash functions and their applications
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Simple and space-efficient minimal perfect hash functions
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Large neighborhood local search for the maximum set packing problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Memory efficient sanitization of a deduplicated storage system
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |