Marc Snir

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
A note on \(N\)-body computations with cutoffs	2004-09-22	Paper
Demonstrating the scalability of a molecular dynamics application on a petaflops computer	2003-05-06	Paper
Calling names on nameless networks	1996-02-26	Paper
The IBM external user interface for scalable parallel systems	1995-01-29	Paper
Random walks on weighted graphs and applications to on-line algorithms	1993-12-09	Paper
Cost-performance tradeoffs for interconnection networks	1993-01-16	Paper
Better computing on the anonymous ring	1991-01-01	Paper
Size-depth trade-offs for monotone arithmetic circuits	1991-01-01	Paper
A complexity theory of efficient parallel algorithms	1990-01-01	Paper
Communication complexity of PRAMs	1990-01-01	Paper
Efficient parallel algorithms for graph problems	1990-01-01	Paper
Techniques for parallel manipulation of sparse matrices	1989-01-01	Paper
Computing on an anonymous ring	1988-01-01	Paper
Efficient synchronization of multiprocessors with shared memory	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3805898	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3799564	1988-01-01	Paper
The distribution of waiting times in clocked multistage interconnection networks	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3741044	1987-01-01	Paper
A unified theory of interconnection network structure	1986-01-01	Paper
Depth-size trade-offs for parallel prefix computation	1986-01-01	Paper
Exact balancing is not always good	1986-01-01	Paper
On Parallel Searching	1985-01-01	Paper
Applications of Ramsey's theorem to decision tree complexity	1985-01-01	Paper
Lower bounds on probabilistic linear decision trees	1985-01-01	Paper
Circuit partitioning with size and connection constraints	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3664431	1983-01-01	Paper
Some Exact Complexity Results for Straight-Line Computations over Semirings	1982-01-01	Paper
Probabilities over rich languages, testing and randomness	1982-01-01	Paper
Comparisons between linear functions can help	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3926036	1981-01-01	Paper
On the complexity of simplifying quadratic forms	1981-01-01	Paper
On the depth complexity of formulas	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3886860	1980-01-01	Paper
The covering problem of complete uniform hypergraphs	1979-01-01	Paper
A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors	1977-01-01	Paper

Research outcomes over time

This page was built for person: Marc Snir