Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Asynchronous shared memory parallel computation (preliminary version)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Improved approximation algorithms for shop scheduling problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the parallel complexity of computing a maximal independent set in a hypergraph
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Polynomial space polynomial delay algorithms for listing families of graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Channel routing of multiterminal nets
Journal of the ACM (JACM)
Listing graphs that satisfy first-order sentences
Journal of Computer and System Sciences
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved algorithms via approximations of probability distributions (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On linear potential functions for approximating Bayesian computations
Journal of the ACM (JACM)
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Reconstructing a three-dimensional model with arbitrary errors
Journal of the ACM (JACM)
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Generating low-degree 2-spanners
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation alogorithms for the maximum acyclic subgraph problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
The value of strong inapproximability results for clique
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
K-medians, facility location, and the Chernoff-Wald bound
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximating the maximum quadratic assignment problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Lattice approximation and linear discrepency of totally unimodular matrices
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Web caching using access statistics
SODA '01 Proceedings of the twelfth 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
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the closest string and substring problems
Journal of the ACM (JACM)
Parallel and out-of-core view-dependent isocontour visualization using random data distribution
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the approximation of the minimum disturbance p-facility location problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
Routing Strategies for Fast Networks
IEEE Transactions on Computers
An approximate truthful mechanism for combinatorial auctions with single parameter agents
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Non-independent randomized rounding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithmic Embedding of Graphs via Perfect Matchings
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Non-independent Randomized Rounding and an Application to Digital Halftoning
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Discrete Applied Mathematics
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the solution of reroute sequence planning problem in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Combinatorics, Probability and Computing
Matrix rounding and approximation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Integer programming models for computational biology problems
Journal of Computer Science and Technology - Special issue on bioinformatics
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Approximate and dynamic rank aggregation
Theoretical Computer Science - Special papers from: COCOON 2003
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Load-Balanced Short-Path Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Bounds and constructions for the star-discrepancy via δ-covers
Journal of Complexity
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Algorithms for non-uniform size data placement on parallel disks
Journal of Algorithms
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Matrix approximation and Tusnády's problem
European Journal of Combinatorics
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Truthful unsplittable flow for large capacity networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
ACM Transactions on Algorithms (TALG)
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
On routing in VLSI design and communication networks
Discrete Applied Mathematics
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Scalable isosurface visualization of massive datasets on commodity off-the-shelf clusters
Journal of Parallel and Distributed Computing
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Approximation algorithms for data placement on parallel disks
ACM Transactions on Algorithms (TALG)
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Bounds and constructions for the star-discrepancy via δ-covers
Journal of Complexity
Truthful unsplittable flow for large capacity networks
ACM Transactions on Algorithms (TALG)
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Randomly rounding rationals with cardinality constraints and derandomizations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Convex combinations of single source unsplittable flows
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
More efficient algorithms for closest string and substring problems
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
Journal of Complexity
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Near optimal solutions for maximum quasi-bicliques
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Approximation algorithms for non-single-minded profit-maximization problems with limited supply
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Polynomial-time computation of exact correlated equilibrium in compact games
Proceedings of the 12th ACM conference on Electronic commerce
Deterministic discrepancy minimization
ESA'11 Proceedings of the 19th European conference on Algorithms
Truthful and Near-Optimal Mechanism Design via Linear Programming
Journal of the ACM (JACM)
A closest vector problem arising in radiation therapy planning
Journal of Combinatorial Optimization
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
Spectral Sparsification of Graphs
SIAM Journal on Computing
Unbiased rounding of rational matrices
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Generating randomized roundings with cardinality constraints and derandomizations
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A linear time approximation algorithm for permutation flow shop scheduling
Theoretical Computer Science
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Randomized rounding for routing and covering problems: experiments and improvements
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On routing in VLSI design and communication networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Roundings respecting hard constraints
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Approximation algorithms for dynamic resource allocation
Operations Research Letters
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
Operations Research Letters
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating the min-max (regret) selecting items problem
Information Processing Letters
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Discrete Applied Mathematics
Improved approximation algorithms for the Min-Max Selecting Items problem
Information Processing Letters
Parameterized complexity of weak odd domination problems
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.01 |