The following pages link to Marc Snir (Q804294):
Displaying 35 items.
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- Communication complexity of PRAMs (Q913504) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- Exact balancing is not always good (Q1072369) (← links)
- A unified theory of interconnection network structure (Q1088405) (← links)
- Techniques for parallel manipulation of sparse matrices (Q1119337) (← links)
- On the complexity of simplifying quadratic forms (Q1157964) (← links)
- Comparisons between linear functions can help (Q1170029) (← links)
- Cost-performance tradeoffs for interconnection networks (Q1199441) (← links)
- The covering problem of complete uniform hypergraphs (Q1259552) (← links)
- Efficient parallel algorithms for graph problems (Q1262781) (← links)
- The IBM external user interface for scalable parallel systems (Q1325921) (← links)
- Calling names on nameless networks (Q1333277) (← links)
- Demonstrating the scalability of a molecular dynamics application on a petaflops computer (Q1871091) (← links)
- A note on \(N\)-body computations with cutoffs (Q1879373) (← links)
- Random walks on weighted graphs and applications to on-line algorithms (Q3140012) (← links)
- Better computing on the anonymous ring (Q3361868) (← links)
- (Q3664431) (← links)
- Circuit partitioning with size and connection constraints (Q3670554) (← links)
- (Q3741044) (← links)
- Depth-size trade-offs for parallel prefix computation (Q3745780) (← links)
- On Parallel Searching (Q3746899) (← links)
- Applications of Ramsey's theorem to decision tree complexity (Q3771610) (← links)
- (Q3799564) (← links)
- (Q3805898) (← links)
- The distribution of waiting times in clocked multistage interconnection networks (Q3809254) (← links)
- Computing on an anonymous ring (Q3813292) (← links)
- Efficient synchronization of multiprocessors with shared memory (Q3814768) (← links)
- (Q3886860) (← links)
- On the depth complexity of formulas (Q3890111) (← links)
- (Q3926036) (← links)
- Some Exact Complexity Results for Straight-Line Computations over Semirings (Q3945585) (← links)
- Probabilities over rich languages, testing and randomness (Q3966829) (← links)
- A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors (Q4134958) (← links)
