Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the exponent of the all pairs shortest path problem
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Computing the rectangle discrepancy
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A note on polynomial arithmetic analogue of Halton sequences
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the all-pairs shortest-path algorithm of Moffat and Takaoka
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Programming pearls: perspective on performance
Communications of the ACM
Programming pearls: algorithm design techniques
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Approximations with Axis-Aligned Rectangles (Extended Abstract)
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
The effect of algebraic structure on the computational complexity of matrix multiplication
The effect of algebraic structure on the computational complexity of matrix multiplication
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Computing Optimal Hypotheses Efficiently for Boosting
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Improved algorithmms for the k maximum-sums problems
Theoretical Computer Science
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Theoretical Computer Science
Finding the maximum subsequence sum on interconnection networks
International Journal of Parallel, Emergent and Distributed Systems
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Effect of corner information in simultaneous placement of K rectangles and tableaux
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithm for K disjoint maximum subarrays
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Randomized algorithm for the sum selection problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved algorithms for the k maximum-sums problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Efficient algorithms for k maximum sums
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the sum selection problem and k maximum sums problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Algorithms for computing the maximum weight region decomposable into elementary shapes
Computer Vision and Image Understanding
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |