Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A representation for linear lists with movable fingers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
SAIL
Linear lists and priority queues as balanced binary trees
Linear lists and priority queues as balanced binary trees
Set representation and set intersection.
Set representation and set intersection.
Big Omicron and big Omega and big Theta
ACM SIGACT News
Fast set operations using treaps
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Identifying Occurrences of Maximal Pairs in Multiple Strings
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Algorithms for Efficient Filtering in Content-Based Multicast
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On the limits of cache-obliviousness
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Longest repeats with a block of k don't cares
Theoretical Computer Science
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms
Unimodal regression via prefix isotonic regression
Computational Statistics & Data Analysis
Efficient unbalanced merge-sort
Information Sciences: an International Journal
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Fast set intersection in memory
Proceedings of the VLDB Endowment
Checking determinism of XML Schema content models in optimal time
Information Systems
The weighted maximum-mean subtree and other bicriterion subtree problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Worst case optimal union-intersection expression evaluation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Faster upper bounding of intersection sizes
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.01 |