Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Journal of the ACM (JACM)
Fast approximation algorithms for fractional packing and covering problems
Fast approximation algorithms for fractional packing and covering problems
Improved algorithms via approximations of probability distributions (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Finding r-Dominating Sets and p-Centers of Trees in Parallel
IEEE Transactions on Parallel and Distributed Systems
Distributed approximation: a survey
ACM SIGACT News
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Hitting sets when the VC-dimension is small
Information Processing Letters
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pricing for fairness: distributed resource allocation for multiple objectives
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Constant-time distributed dominating set approximation
Distributed Computing
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of linear programming in (γ,κ)-form
Information Processing Letters
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Foundations and Trends® in Networking
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Hitting sets when the VC-dimension is small
Information Processing Letters
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Fully Distributed Algorithms for Convex Optimization Problems
SIAM Journal on Optimization
Bandwidth allocation in networks: a single dual update subroutine for multiple objectives
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A sublinear-time randomized approximation algorithm for matrix games
Operations Research Letters
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
A distributed algorithm for large-scale generalized matching
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |