Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Relations between concurrent-write models of parallel computation
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Faster optimal parallel prefix sums and list ranking
Information and Computation
Recognizing breadth-first search trees in linear time
Information Processing Letters
Recursive star-tree parallel data-structure
Recursive star-tree parallel data-structure
Journal of the ACM (JACM)
Parallel Tridiagonal Equation Solvers
ACM Transactions on Mathematical Software (TOMS)
Approximate and exact parallel scheduling with applications to list, tree and graph problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
IEEE Transactions on Parallel and Distributed Systems
The level-ancestor problem on pure pointer machines
Information Processing Letters
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
All-pairs disjoint paths from a common ancestor in Õ(nω) time
Theoretical Computer Science
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics
Efficient data structures for range-aggregate queries on trees
Proceedings of the 12th International Conference on Database Theory
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Succinct representations of permutations and functions
Theoretical Computer Science
Cross-Document pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Speeding up q-gram mining on grammar-based compressed texts
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Efficient LZ78 factorization of grammar compressed text
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Fingerprints in compressed strings
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Algorithms for interval structures with applications
Theoretical Computer Science
Cross-document pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Several learning algorithms have been derived for equilibrium points in recurrent neural networks. In this paper, we also consider learning the equilibrium points of such dynamical systems. We derive a structurally simple learning algorithm for recurrent ...