Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Optimal Assignments in Broadcast Networks
IEEE Transactions on Computers
Dynamic Remapping of Parallel Computations with Varying Resource Demands
IEEE Transactions on Computers
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Optimal Dynamic Remapping of Data Parallel Computations
IEEE Transactions on Computers
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Algorithms and complexity analysis for some flow problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Parametric optimization of sequence alignment
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Parametric Module Allocation on Partial k-Trees
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems
IEEE Transactions on Computers
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Parametric Multiple Sequence Alignment and Phylogeny Construction
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Some Compartmentalized Secure Task Assignment Models for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Alignment of biological sequences with quality scores
International Journal of Bioinformatics Research and Applications
An efficient algorithm for the parametric resource allocation problem
Discrete Applied Mathematics
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Possibilistic bottleneck combinatorial optimization problems with ill-known weights
International Journal of Approximate Reasoning
Constructing the minimization diagram of a two-parameter problem
Operations Research Letters
Calculation of stability radii for combinatorial optimization problems
Operations Research Letters
Strongly polynomial-time approximation for a class of bicriteria problems
Operations Research Letters
| Hi-index | 0.02 |