WorldCat Identities

Haddad, Ramsey W.

Overview
Works: 13 works in 24 publications in 1 language and 43 library holdings
Roles: Editor
Classifications: QA76, 001.642
Publication Timeline
Key
Publications about  Ramsey W Haddad Publications about Ramsey W Haddad
Publications by  Ramsey W Haddad Publications by Ramsey W Haddad
Most widely held works by Ramsey W Haddad
A programming and problem-solving seminar by Ramsey W Haddad ( Book )
4 editions published in 1985 in English and held by 11 WorldCat member libraries worldwide
Beta operations : efficient implementation of a primitive parallel operation by Evan Reid Cohn ( Book )
5 editions published in 1986 in English and Undetermined and held by 10 WorldCat member libraries worldwide
The ever decreasing cost of computer processors has created a great interest in multi-processor computers. However, along with the increased power that this parallelism brings, comes increased complexity in programming. One approach to lessening this complexity is to provide the programmer with general purpose parallel primitives that shield him from the structure of the underlying maching. In The Connection Machine Hillis suggests the Beta Operation as a parallel primitive for his hypercube-based machine. This paper explores efficient ways to perform this operator on several different well known architectures including the hypercube. It presents some lower bounds associated with the problem
Triangularization : a two-processor scheduling problem by Ramsey W Haddad ( Book )
5 editions published in 1990 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Abstract: "We explore the following matrix problem: Given an n x n boolean matrix, is there a permutation of the rows and a permutation of the columns such that the resulting matrix is lower triangular? We show the relationship of this matrix problem to the two important scheduling problems: optimization of code for pipelined execution and microcode compaction for very long instruction computers. This matrix problem is unclassified -- it is unknown whether it is NP-Complete or whetherit can be solved by a polynomial time algorithm. We find several minor extensions that would make the problem NP-Complete. Also, we show polynomial algorithms for a number of special cases of the problem, and develop a number of interesting techniques in the process. We also explore approximation algorithms and lower bounds."
Drip : a schematic drawing interpreter by Ramsey W Haddad ( Book )
1 edition published in 1995 in English and held by 8 WorldCat member libraries worldwide
Problem solving with Donald Knuth ( Visual )
1 edition published in 1985 in English and held by 1 WorldCat member library worldwide
Triangularization : a two-processor scheduling system by Ramsey W Haddad ( Book )
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
A Programming and problem-solving seminar by Donald Ervin Knuth ( Book )
1 edition published in 1985 in Undetermined and held by 1 WorldCat member library worldwide
This report contains edited transcripts of the discussions held in Stanford's Computer Science problem solving course, CS304, during winter quarter 1989. Since the topics span a large range of ideas in computer science, and since most of the important research paradigms and programming paradigms were touched on during the discussions, these notes may be of interest to graduate students of computer science at other universities, as well as to their professors and to professional people in the "real world."
Triangularization: a two-processor scheduling problem by Stanford University ( )
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
We explore the following matrix problem: Given an n x n boolean matrix, is there a permutation of the rows and a permutation of the columns such that the resulting matrix is lower triangular? We show the relationship of this matrix problem to the two important scheduling problems: optimization of code for pipelined execution and microcode compaction for very long instruction computers. This matrix problem is unclassified-it is unknown whether it is NP-Complete or whether it can be solved by a polynomial time algorithm. We find several minor extensions that would make the problem NP-Complete. Also, we show polynomial algorithms for a number of special cases of the problem, and develop a number of interesting techniques in the process. We also explore approximation algorithms and lower bounds
Programming and Problem Solving Seminar. Stanford video journal, Volume one. Problem solving with Donald Knuth. Problem Number 2. ( Contained in nine VHS video cassettes ) by Ramsey W Haddad ( Visual )
1 edition published in 1985 in English and held by 0 WorldCat member libraries worldwide
Programming and Problem Solving Seminar. Stanford video journal, Volume one. Problem solving with Donald Knuth. Problem Number 3. ( Contained in eleven VHS video cassettes ) by Ramsey W Haddad ( Visual )
1 edition published in 1985 in English and held by 0 WorldCat member libraries worldwide
Programming and Problem Solving Seminar. Stanford video journal, Volume one. Problem solving with Donald Knuth. Problem number 4. ( Contained in eight VHS video cassettes ) by Ramsey W Haddad ( Visual )
1 edition published in 1985 in English and held by 0 WorldCat member libraries worldwide
Programming and Problem Solving Seminar. Stanford video journal, Volume one. Problem solving with Donald Knuth. Problem Number 1. ( Contained in six VHS video cassettes ) by Ramsey W Haddad ( Visual )
1 edition published in 1985 in English and held by 0 WorldCat member libraries worldwide
Programming and Problem Solving Seminar. Stanford video journal, Volume one. Problem solving with Donald Knuth. Problem number 5. ( Contained in six VHS video cassettes ) by Ramsey W Haddad ( Visual )
1 edition published in 1985 in English and held by 0 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.83 (from 0.00 for Programmin ... to 1.00 for Problem so ...)
Languages
English (21)