Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the existence of pseudorandom generators
CRYPTO '88 Proceedings on Advances in cryptology
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Parallel algorithms for routing in non-blocking networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
Decomposing graphs into regions of small diameter
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
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Computing minimal spanning subgraphs in linear time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Designing synchronous algorithms for asynchronous processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Efficient asynchronous distributed symmetry breaking
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On construction of k-wise independent random variables
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
Probabilistic recurrence relations
Journal of the ACM (JACM)
PMRSB: parallel multilevel recursive spectral bisection
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Localizing Failures in Distributed Synchronization
IEEE Transactions on Parallel and Distributed Systems
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Distributed algorithms visualisation for educational purposes
ITiCSE '99 Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education
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
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Parallel search for maximal independence given minimal dependence
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Parallel multigrid solver for 3D unstructured finite element problems
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Parallel multilevel k-way partitioning scheme for irregular graphs
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Parallel threshold-based ILU factorization
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
BoomerAMG: a parallel algebraic multigrid solver and preconditioner
Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
An approximation algorithm for the minimum common supertree problem
Nordic Journal of Computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Load balancing for unstructured mesh applications
Progress in computer research
hypre: A Library of High Performance Preconditioners
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Towards an Implementation of a Multilevel ILU Preconditioner on Shared-Memory Computers
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Two Examples of Distributed Architecture for Solving Combinatorial Optimization Problems
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
An efficient algorithm for parallel stiffness matrix assembling
ICECT'03 Proceedings of the third international conference on Engineering computational technology
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Almost k-wise independence versus k-wise independence
Information Processing Letters
A fully parallel block independent set algorithm for distributed sparse matrices
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Using the parallel algebraic recursive multilevel solver in modern physical applications
Future Generation Computer Systems - Special issue: Selected numerical algorithms
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Variations on algebraic recursive multilevel solvers (ARMS) for the solution of CFD problems
Applied Numerical Mathematics
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distributed block independent set algorithms and parallel multilevel ILU preconditioners
Journal of Parallel and Distributed Computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A fast localized algorithm for scheduling sensors
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Want scalable computing?: speculate!
ACM SIGACT News
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
An application of multigrid methods for a discrete elastic model for epitaxial systems
Journal of Computational Physics
Relaxed RS0 or CLJP coarsening strategy for parallel AMG
Parallel Computing
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algebraic multigrid methods for elastic structures with highly discontinuous coefficients
Mathematics and Computers in Simulation
Formula dissection: A parallel algorithm for constraint satisfaction
Computers & Mathematics with Applications
A framework for scalable greedy coloring on distributed-memory parallel computers
Journal of Parallel and Distributed Computing
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A parallel algorithm for finding a separator in planar graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local, distributed weighted matching on general and wireless topologies
Proceedings of the fifth international workshop on Foundations of mobile computing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A Power Peer-Based Reputation Scheme for Mobile P2P Systems
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The Complexity of Perfect Matching Problems on Dense Hypergraphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Local randomness in candidate one-way functions
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
High-performance graph algorithms from parallel sparse matrices
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A parallel approximation algorithm for the weighted maximum matching problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Throughput performance of d-tree multicast capable optical cross-connect under synchronous traffic
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: exponential speed-up of local algorithms using non-local communication
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
Deterministic algorithms for the Lovász Local Lemma
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Journal of Combinatorial Optimization
Sublinear graph approximation algorithms
Property testing
Sublinear graph approximation algorithms
Property testing
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The tao of parallelism in algorithms
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Bounds on contention management algorithms
Theoretical Computer Science
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Trading bit, message, and time complexity of distributed algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Invisible safety of distributed protocols
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Formulas and protocols for broadcasting in mobile ad hoc networks
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Distributed approximation algorithms for planar graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On greedy graph coloring in the distributed model
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Speeding up parallel graph coloring
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distance approximation in bounded-degree and general sparse graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
MapReduce in MPI for Large-scale graph algorithms
Parallel Computing
Greedy sequential maximal independent set and matching are parallel on average
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for scheduling on line and tree networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
SIAM Journal on Discrete Mathematics
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Distributed approximation algorithms for weighted problems in minor-closed families
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: fair maximal independent sets in trees
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Efficient computation of balanced structures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Information and Computation
| Hi-index | 0.01 |