Marc Snir

Inf. Comput., August, 1994

The IBM External User Interface for Scalable Parallel Systems.

[BibT_eX]

[DOI]

Parallel Comput., 1994

Memory versus randomization in on-line algorithms.

[BibT_eX]

[DOI]

Prabhakar Raghavan

IBM J. Res. Dev., 1994

MPI-F: An Efficient Implementation of MPI on IBM-SP1.

[BibT_eX]

[DOI]

Proceedings of the 1994 International Conference on Parallel Processing, 1994

1993

Random Walks on Weighted Graphs and Applications to On-line Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1993

Scalable Parallel Computing: The IBM 9076 Scalable POWERparallel 1.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Designing Efficient, Scalable, and Portable Collective Communication Libraries.

[BibT_eX]

Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

Computer Architectures and Programming Models for Scalable Parallel Computing.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Issues and Directions in Scalable Parallel Computing.

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Using Visualization Tools to Understand Concurrency.

[BibT_eX]

[DOI]

Dror Zernik

Dalia Malki

IEEE Softw., 1992

Cost-Performance Tradeoffs for Interconnection Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Scalable Parallel Computers and Scalable Parallel Codes: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991

Size-depth Trade-Offs for Monotone Arithmetic Circuits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Better Computing on the Anonymous Ring.

[BibT_eX]

[DOI]

Hagit Attiya

J. Algorithms, 1991

1990

A Complexity Theory of Efficient Parallel Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Communication Complexity of PRAMs.

[BibT_eX]

[DOI]

Alok Aggarwal

Ashok K. Chandra

Theor. Comput. Sci., 1990

Efficient Parallel Algorithms for Graph Problems.

[BibT_eX]

[DOI]

Algorithmica, 1990

Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Techniques for Parallel Manipulation of Sparse Matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Cost-Bandwidth Tradeoffs for Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

On Communication Latency in PRAM Computations.

[BibT_eX]

[DOI]

Alok Aggarwal

Ashok K. Chandra

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Memory Versus Randomization in On-line Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Prabhakar Raghavan

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Efficient and Correct Execution of Parallel Programs that Share Memory.

[BibT_eX]

[DOI]

Dennis E. Shasha

ACM Trans. Program. Lang. Syst., 1988

Efficient Synchronization on Multiprocessors with Shared Memory.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1988

The Distribution of Waiting Times in Clocked Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Alan Weiss

IEEE Trans. Computers, 1988

Computing on an anonymous ring.

[BibT_eX]

[DOI]

Hagit Attiya

Manfred K. Warmuth

J. ACM, 1988

A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

A Model for Hierarchical Memory

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Hierarchical Memory with Block Transfer

[BibT_eX]

[DOI]

Alok Aggarwal

Ashok K. Chandra

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

A Unified Theory of Interconnection Network Structure.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Depth-Size Trade-Offs for Parallel Prefix Computation.

[BibT_eX]

[DOI]

J. Algorithms, 1986

Exact Balancing is Not Always Good.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Efficient Parallel Algorithms for Graph Models.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1986

1985

Applications of Ramsey's Theorem to Decision Tree Complexity

[BibT_eX]

[DOI]

Shlomo Moran

Udi Manber

J. ACM, October, 1985

Lower Bounds on Probabilistic Linear Decision Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

The Power of Parallel Prefix.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1985

On Parallel Searching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Issues Related to MIMD Shared-memory Computers: The NYU Ultracomputer Approach.

[BibT_eX]

[DOI]

Proceedings of the 12th Annual Symposium on Computer Architecture, 1985

1984

The Importance of Being Square.

[BibT_eX]

[DOI]

Proceedings of the 11th Annual Symposium on Computer Architecture, 1984

Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version)

[BibT_eX]

[DOI]

Shlomo Moran

Udi Manber

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

The Performance of Multistage Interconnection Networks for Multiprocessors.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

The NYU Ultracomputer - Designing an MIMD Shared Memory Parallel Computer.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

Circuit partitioning with size and connection constraints.

[BibT_eX]

[DOI]

Yehoshua Perl

Networks, 1983

1982

Comparisons between Linear Functions can Help.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Probabilities Over Rich Languages, Testing and Randomness.

[BibT_eX]

[DOI]

Haim Gaifman

J. Symb. Log., 1982

Some Exact Complexity Results for Straight-Line Computations over Semirings.

[BibT_eX]

[DOI]

Mark Jerrum

J. ACM, 1982

On Parallel Searching (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

The NYU Ultracomputer-designing a MIMD, shared-memory parallel machine (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Computer Architecture (ISCA 1982), 1982

1981

On the Complexity of Simplifying Quadratic Forms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Proving Lower Bounds for Linar Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

On the Depth Complexity of Formulas.

[BibT_eX]

[DOI]

Eli Shamir

Math. Syst. Theory, 1980

On the Size Complexity of Monotone Formulas.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

סבוך העומק של נוסחאות (Depth complexity of formulas.).

[BibT_eX]

[DOI]

PhD thesis, 1979

The covering problem of complete uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1979

1977

A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors.

[BibT_eX]

[DOI]