The following pages link to Alexander A. Schwarzmann (Q529040):
Displaying 50 items.
- (Q477092) (redirect page) (← links)
- (Q1002109) (redirect page) (← links)
- (Q1292425) (redirect page) (← links)
- Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Optimal deployment of eventually-serializable data services (Q545558) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- (Q861277) (redirect page) (← links)
- Dynamic load balancing with group communication (Q861278) (← links)
- Reconfigurable distributed storage for dynamic networks (Q897399) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- Achieving optimal CRCW PRAM fault-tolerance (Q1182119) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- An efficient write-all algorithm for fail-stop PRAM without initialized memory (Q1208446) (← links)
- Timing conditions for linearizability in uniform counting networks (Q1292426) (← links)
- Eventually-serializable data services (Q1292429) (← links)
- Cooperative computing with fragmentable and mergeable groups (Q1827289) (← links)
- Distributed scheduling for disconnected cooperation (Q2375304) (← links)
- Long-lived RAMBO: trading knowledge for communication (Q2383603) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Tractable low-delay atomic memory (Q2657276) (← links)
- (Q2766867) (← links)
- Counting networks are practically linearizable (Q2942741) (← links)
- Performing work with asynchronous processors (Q2943763) (← links)
- (Q3152802) (← links)
- (Q3396596) (← links)
- Robust Network Supercomputing with Malicious Processes (Q3524326) (← links)
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory (Q3540237) (← links)
- Collective asynchronous reading with polylogarithmic worst-case overhead (Q3580978) (← links)
- Work-competitive scheduling for cooperative computing with dynamic groups (Q3581245) (← links)
- At-Most-Once Semantics in Asynchronous Shared Memory (Q3646230) (← links)
- (Q4232882) (← links)
- (Q4344152) (← links)
- (Q4413404) (← links)
- (Q4436048) (← links)
- (Q4437122) (← links)
- (Q4437132) (← links)
- (Q4668735) (← links)
- (Q4847020) (← links)
- Parallel Algorithms with Processor Failures and Delays (Q4864434) (← links)
- IN MEMORIAM Paris C. Kanellakis (1953–1995) (Q4876690) (← links)
- Writing-all deterministically and optimally using a nontrivial number of asynchronous processors (Q4962738) (← links)
- Performing tasks on synchronous restartable message-passing processors (Q5138349) (← links)
- The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)
- In memoriam Paris C. Kanellakis (Q5228138) (← links)
- Efficient parallel algorithms on restartable fail-stop processors (Q5255803) (← links)
- Structural Information and Communication Complexity (Q5315225) (← links)
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups (Q5317178) (← links)
- Specifying and using a partitionable group communication service (Q5361466) (← links)
- Brief Announcement (Q5361956) (← links)
