The following pages link to Faith E. Fich (Q760214):
Displaying 50 items.
- (Q582085) (redirect page) (← links)
- (Q1331900) (redirect page) (← links)
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- On generalized locally testable languages (Q760215) (← links)
- Simulations among concurrent-write PRAMs (Q1104097) (← links)
- A tradeoff between search and update time for the implicit dictionary problem (Q1108806) (← links)
- Languages of R-trivial monoids (Q1146010) (← links)
- A homomorphic characterization of regular languages (Q1162364) (← links)
- A generalized setting for fixpoint theory (Q1259161) (← links)
- Bounds on certain multiplications of affine combinations (Q1331901) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q1373140) (← links)
- Pointers versus arithmetic in PRAMs (Q1816730) (← links)
- Limits on the power of parallel random access machines with weak forms of write conflict resolution (Q1816745) (← links)
- Lower bounds for the cycle detection problem (Q1838298) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs (Q1904664) (← links)
- Relationships between broadcast and shared memory in reliable anonymous distributed systems (Q1953650) (← links)
- On the inherent weakness of conditional primitives (Q2375295) (← links)
- (Q2754194) (← links)
- (Q2766858) (← links)
- (Q2766891) (← links)
- Optimal bounds for the predecessor problem (Q2819557) (← links)
- Time-space tradeoffs for implementations of snapshots (Q2931381) (← links)
- The complexity of end-to-end communication in memoryless networks (Q2942767) (← links)
- On the space complexity of randomized synchronization (Q3158522) (← links)
- Toward Understanding Exclusive Read (Q3474893) (← links)
- A tight time lower bound for space-optimal implementations of multi-writer snapshots (Q3581246) (← links)
- Bounds for Width Two Branching Programs (Q3718153) (← links)
- (Q3725558) (← links)
- (Q3745272) (← links)
- A Time-Space Tradeoff for Element Distinctness (Q3776617) (← links)
- The parallel complexity of exponentiating polynomials over finite fields (Q3798223) (← links)
- Relations between Concurrent-Write Models of Parallel Computation (Q3798244) (← links)
- (Q4199560) (← links)
- (Q4281540) (← links)
- (Q4436054) (← links)
- Estimating the maximum (Q4651815) (← links)
- Permuting in Place (Q4834380) (← links)
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs (Q5056126) (← links)
- Tables should be sorted (on random access machines) (Q5057459) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q5060110) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Space-optimal multi-writer snapshot objects are slow (Q5170861) (← links)
- On the space complexity of randomized synchronization (Q5361383) (← links)
- Distributed Computing (Q5395138) (← links)
- Distributed Computing (Q5395143) (← links)
- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems (Q5464196) (← links)
- Graph Minors and Reliable Single Message Transmission (Q5470796) (← links)
- Lower bounds for adaptive collect and related objects (Q5501483) (← links)
- Efficient synchronous snapshots (Q5501484) (← links)
- On the inherent weakness of conditional synchronization primitives (Q5501485) (← links)
