Probabilistic analysis of a network resource allocation algorithm
Information and Control
Fault tolerance in networks of bounded degree
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Efficient synchronization of multiprocessors with shared memory
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel algorithmic techniques for combinatorial computation
Annual review of computer science: vol. 3, 1988
Deterministic P-RAM simulation with constant redundancy
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A bridging model for parallel computation
Communications of the ACM
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Combining tentative and definite executions for dependable parallel computing
Combining tentative and definite executions for dependable parallel computing
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Understanding fault-tolerant distributed systems
Communications of the ACM
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Achieving Optimal CRCW PRAM Fault-Tolerance
Achieving Optimal CRCW PRAM Fault-Tolerance
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Performing work efficiently in the presence of faults
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Designing synchronous algorithms for asynchronous processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
ACM SIGACT News
Efficient execution of nondeterministic parallel programs on asynchronous systems
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Possible and Impossible Self-Stabilizing Digital ClockSynchronization in General Graphs
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
Efficient computations on fault-prone BSP machines
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
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
Efficient parallel algorithms can be made robust
Distributed Computing
| Hi-index | 0.02 |