Scheduling Cilk multithreaded parallel programs on processors of different speeds
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Optimal scheduling for disconnected cooperation
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Randomization Helps to Perform Tasks on Processors Prone to Failures
Proceedings of the 13th International Symposium on Distributed Computing
Distributed Cooperation During the Absence of Communication
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Complexity of Synchronous Iterative Do-All with Crashes
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
distributed cooperation and adversity: complexity trade-offs
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Work-competitive scheduling for cooperative computing with dynamic groups
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Distributed algorithm engineering
Experimental algorithmics
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Deterministic computations on a PRAM with static processor and memory faults
Fundamenta Informaticae
Cooperative computing with fragmentable and mergeable groups
Journal of Discrete Algorithms
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The complexity of synchronous iterative Do-All with crashes
Distributed Computing
An algorithm for the asynchronous Write-All problem based on process collision
Distributed Computing
Cooperative asynchronous update of shared memory
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
Theoretical Computer Science
Performing work with asynchronous processors: message-delay-sensitive bounds
Information and Computation
Lock-free dynamic hash tables with open addressing
Distributed Computing - Special issue: PODC 02
Split-ordered lists: Lock-free extensible hash tables
Journal of the ACM (JACM)
The Do-All problem with Byzantine processor failures
Theoretical Computer Science - Foundations of software science and computation structures
Lock-free parallel and concurrent garbage collection by mark&sweep
Science of Computer Programming
Dynamic load balancing with group communication
Theoretical Computer Science
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
ACM Transactions on Algorithms (TALG)
The Journal of Supercomputing
Performing work with asynchronous processors: Message-delay-sensitive bounds
Information and Computation
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Journal of Parallel and Distributed Computing
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
At-most-once semantics in asynchronous shared memory
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Performing dynamically injected tasks on processes prone to crashes and restarts
DISC'11 Proceedings of the 25th international conference on Distributed computing
Lock-Free parallel garbage collection
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Robust network supercomputing without centralized control
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Solving the at-most-once problem with nearly optimal effectiveness
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Deterministic Computations on a PRAM with Static Processor and Memory Faults
Fundamenta Informaticae
The strong at-most-once problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |